499 search results - page 51 / 100 » LTL satisfiability checking |
109
click to vote
CADE
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
MEMOCODE
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
PLDI
2010
ACM
15 years 3 months ago
2010
ACM
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
TODAES
2008
14 years 11 months ago
2008
We present an extension of Duato's necessary and sufficient condition a routing function must satisfy in order to be deadlock-free, to support environment constraints inducing...
DAC
2004
ACM
16 years 25 days ago
2004
ACM
This paper describes a strategy for verifying data-hazard correctness of out-of-order processors that implement register-renaming. We define a set of predicates to characterize re...