1716 search results - page 99 / 344 » Proving Conditional Termination |
126
click to vote
SP
2010
IEEE
14 years 10 months ago
2010
IEEE
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
79
Voted
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
A control part ? data path partition based sequential circuit verification scheme aimed at avoiding state explosion comprises two major modules namely, a data path verifier and a ...
127
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
We present a novel reasoning calculus for Description Logics (DLs)--knowledge representation formalisms with applications in areas such as the Semantic Web. In order to reduce the ...
103
Voted
PCI
2009
Springer
15 years 7 months ago
2009
Springer
—The design of efficient information dissemination mechanism is a challenging problem in large-scale network with respect to the number of messages and termination time. In this...
107
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...