| 2008 |
|---|
| 25 | EE | Michael Zeller,
Aaron Stump,
Morgan Deters:
Signature Compilation for the Edinburgh Logical Framework.
Electr. Notes Theor. Comput. Sci. 196: 129-135 (2008) |
| 2007 |
|---|
| 24 | | Aaron Stump,
Hongwei Xi:
Proceedings of the ACM Workshop Programming Languages meets Program Verification, PLPV 2007, Freiburg, Germany, October 5, 2007
ACM 2007 |
| 23 | EE | Aaron Stump:
Lightweight Verification with Dependent Types.
VERIFY 2007 |
| 22 | EE | Aaron Stump,
Hongwei Xi:
Preface.
Electr. Notes Theor. Comput. Sci. 174(7): 1-2 (2007) |
| 21 | EE | Clark Barrett,
Leonardo Mendonça de Moura,
Aaron Stump:
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006).
Formal Methods in System Design 31(3): 221-239 (2007) |
| 2006 |
|---|
| 20 | EE | Gary T. Leavens,
Jean-Raymond Abrial,
Don S. Batory,
Michael J. Butler,
Alessandro Coglio,
Kathi Fisler,
Eric C. R. Hehner,
Cliff B. Jones,
Dale Miller,
Simon L. Peyton Jones,
Murali Sitaraman,
Douglas R. Smith,
Aaron Stump:
Roadmap for enhanced languages and methods to aid verification.
GPCE 2006: 221-236 |
| 19 | EE | Ian Wehrman,
Aaron Stump,
Edwin M. Westbrook:
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.
RTA 2006: 287-296 |
| 18 | EE | Ian Wehrman,
Aaron Stump:
Mining Propositional Simplification Proofs for Small Validating Clauses.
Electr. Notes Theor. Comput. Sci. 144(2): 79-91 (2006) |
| 17 | EE | Aaron Stump,
Bernd Löchner:
Knuth-Bendix completion of theories of commuting group endomorphisms.
Inf. Process. Lett. 98(5): 195-198 (2006) |
| 2005 |
|---|
| 16 | EE | Clark W. Barrett,
Leonardo Mendonça de Moura,
Aaron Stump:
SMT-COMP: Satisfiability Modulo Theories Competition.
CAV 2005: 20-23 |
| 15 | EE | Edwin M. Westbrook,
Aaron Stump,
Ian Wehrman:
A language-based approach to functionally correct imperative programming.
ICFP 2005: 268-279 |
| 14 | EE | Aaron Stump,
Li-Yang Tan:
The Algebra of Equality Proofs.
RTA 2005: 469-483 |
| 13 | EE | Aaron Stump,
Ryan Besand,
James C. Brodman,
Jonathan Hseu,
Bill Kinnersley:
From Rogue to MicroRogue.
Electr. Notes Theor. Comput. Sci. 117: 69-87 (2005) |
| 12 | EE | Aaron Stump,
Carsten Schürmann:
Logical Semantics for the Rewriting Calculus.
Electr. Notes Theor. Comput. Sci. 125(2): 149-164 (2005) |
| 11 | EE | Clark W. Barrett,
Leonardo Mendonça de Moura,
Aaron Stump:
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005).
J. Autom. Reasoning 35(4): 373-390 (2005) |
| 2003 |
|---|
| 10 | EE | Aaron Stump:
Subset Types and Partial Functions.
CADE 2003: 151-165 |
| 9 | EE | Dinghao Wu,
Andrew W. Appel,
Aaron Stump:
Foundational proof checkers with small witnesses.
PPDP 2003: 264-274 |
| 8 | EE | Andrew W. Appel,
Neophytos G. Michael,
Aaron Stump,
Roberto Virga:
A Trustworthy Proof Checker.
J. Autom. Reasoning 31(3-4): 231-260 (2003) |
| 2002 |
|---|
| 7 | EE | Aaron Stump,
David L. Dill:
Faster Proof Checking in the Edinburgh Logical Framework.
CADE 2002: 392-407 |
| 6 | EE | Clark W. Barrett,
David L. Dill,
Aaron Stump:
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT.
CAV 2002: 236-249 |
| 5 | EE | Aaron Stump,
Clark W. Barrett,
David L. Dill:
CVC: A Cooperating Validity Checker.
CAV 2002: 500-504 |
| 4 | EE | Clark W. Barrett,
David L. Dill,
Aaron Stump:
A Generalization of Shostak's Method for Combining Decision Procedures.
FroCos 2002: 132-146 |
| 3 | EE | Aaron Stump,
Clark W. Barrett,
David L. Dill:
Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF.
Electr. Notes Theor. Comput. Sci. 70(2): (2002) |
| 2001 |
|---|
| 2 | | Aaron Stump,
Clark W. Barrett,
David L. Dill,
Jeremy R. Levitt:
A Decision Procedure for an Extensional Theory of Arrays.
LICS 2001: 29-37 |
| 2000 |
|---|
| 1 | | Clark W. Barrett,
David L. Dill,
Aaron Stump:
A Framework for Cooperating Decision Procedures.
CADE 2000: 79-98 |
