499 search results - page 28 / 100 » LTL satisfiability checking |
149
click to vote
AMAST
2004
Springer
15 years 11 months ago
2004
Springer
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
164
click to vote
DAC
2008
ACM
16 years 6 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
182
click to vote
CHARME
2005
Springer
15 years 11 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
202
click to vote
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
160
click to vote
DAC
2005
ACM
15 years 7 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...