3446 search results - page 325 / 690 » A Reasoning Algorithm for pD* |
150
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
169
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
180
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
162
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
190
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
The study of methodologies and techniques to produce correct software has been active for four decades. During this period, researchers have developed and investigated a wide vari...