226 search results - page 19 / 46 » BDDs and Automated Deduction |
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
TIME
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
IJCAI
1993
13 years 8 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...