|
10
|
Design and results of the 1st satisfiability modulo theories competition (SMT-COMP
– Clark Barrett, Leonardo De Moura, Aaron Stump
- 2005
|
|
19
|
Splitting on demand in sat modulo theories
– Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
- 2006
|
|
75
|
A decision procedure for bitvectors and arrays
– Vijayganeshanddavidl. Dill
- 2007
|
|
2
|
Satisfiability Modulo Software
– Micha̷l Jan Moskal, Supervisor Prof, Leszek Pacholski, Promotor Prof, Leszek Pacholski, Instytut Informatyki
- 2009
|
|
102
|
CVC: a Cooperating Validity Checker
– Aaron Stump, Clark W. Barrett, David L. Dill
- 2002
|
|
|
Stateless HOL Dedicated to Roel de Vrijer, in the tradition of Automath
– Freek Wiedijk
|
|
|
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Computer Assisted Reasoning
– A Festschrift, Michael J. C. Gordon, Richard Boulton, Joe Hurd, Konrad Slind
- 2009
|
|
8
|
A thread of HOL development
– Michael Norrish, Konrad Slind
|
|
10
|
Source-Level Proof Reconstruction for Interactive Theorem Proving
– Lawrence C. Paulson, Kong Woei Susanto
|
|
|
SMT-COMP ’06 Entry: the Cooperating Validity Checker (CVC)
– Aaron Stump
|
|
24
|
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal
– Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz
- 2005
|
|
18
|
New results on rewrite-based satisfiability procedures
– Allessandro Armando, Silvio Ranise, Stephan Schulz
|
|
67
|
What’s decidable about arrays
– Aaron R. Bradley, Zohar Manna, Henny B. Sipma
- 2006
|
|
22
|
A proof-producing decision procedure for real arithmetic
– Sean Mclaughlin, John Harrison
- 2005
|
|
|
A Complete Proof Procedure for Recursive Data Structures
– Bahareh Badban
|
|
2
|
Combining SAT Methods with Non-Clausal Decision Heuristics
– Clark Barrett, Jacob Donham
- 2004
|
|
|
Recursive Abstractions for Parameterized Systems
– Joxan Jaffar, Andrew E. Santosa
|
|
|
Abstraction Learning
– Joxan Jaffar, Jorge Navas, Andrew E. Santosa
|
|
1
|
Validity Checking for Finite Automata over Linear Arithmetic Constraints
– Gary Wassermann, Zhendong Su
|