136 search results - page 14 / 28 » Boolean Formulas and Frequent Sets |
114
Voted
DLT
2010
14 years 11 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
DATE
2004
IEEE
2004
IEEE
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
15 years 1 months ago
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
DATE
2008
IEEE
14 years 11 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
ENTCS
2008
14 years 9 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...