181 search results - page 13 / 37 » Effective characterizations of tree logics |
IJCAI
2003
13 years 9 months ago
2003
We introduce a logical formalism of irreflexivc causal production relations that possesses both a standard monotonic semantics, and a natural nonmonotonic semantics. The formalism...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
CSL
2004
Springer
14 years 27 days ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
DAC
1993
ACM
13 years 11 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
RTSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...