499 search results - page 41 / 100 » LTL satisfiability checking |
108
click to vote
FSTTCS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
ICSOC
2003
Springer
15 years 5 months ago
2003
Springer
Converting a conventional contract into an electronic equivalent is not trivial. The difficulties are caused by the ambiguities that the original human-oriented text is likely to c...
EUROMICRO
2000
IEEE
15 years 4 months ago
2000
IEEE
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...