788 search results - page 70 / 158 » Symbolic Equivalence Checking |
ICLP
1994
Springer
13 years 12 months ago
1994
Springer
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
PADL
2004
Springer
14 years 1 months ago
2004
Springer
Message Sequence Charts (MSC) have traditionally been used as a weak form of behavioral requirements in software design; they denote scenarios which may happen. Live Sequence Chart...
ISIM
2007
13 years 9 months ago
2007
A scattered context grammar, G, erases nonterminals in a k-limited way, where k ≥ 1, if in every sentential form of any derivation, between every two symbols from which G derive...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability. First of all, it introduces optimized techniques to speedup the comp...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...