Jackson, Paul - School of Informatics, University of Edinburgh

Advanced Search

Jackson, Paul - School of Informatics, University of Edinburgh

Combined Decision Techniques for the Existential Theory of the Reals
Exploring Abstract Algebra in Constructive Type Theory \Lambda
Paul Jackson Formalization and answers by Paul Jackson .
Clause Form Conversions for Boolean Circuits Paul Jackson and Daniel Sheridan
Verifying a Garbage Collection Algorithm \Lambdayz Paul B. Jackson
The Nuprl Proof Development System, Version 4.2 Reference Manual and User's Guide
Expressive Typing and Abstract Theories in Nuprl and PVS
Formalization of Divisibility Theory in Nuprl Paul B. Jackson
Using SMT solvers to verify high-integrity programs Paul B. Jackson
TotalCorrectness Refinement for Sequential Reactive Systems #
A Compact Linear Translation for Bounded Model Checking 1
Constructively Formalizing Automata Theory \Lambda Robert L. Constable y
Exploring Abstract Algebra in Constructive Type Theory *
Constructively Formalizing Automata Theory* Robert L. Constable y
ENHANCING THE NUPRL PROOF DEVELOPMENT SYSTEM AND APPLYING IT TO COMPUTATIONAL ABSTRACT ALGEBRA
Nuprl and its Use in Circuit Design1 Paul B. Jackson 2
Can we Resolve the Tension between Constructive Type Theorists and Classical Mathematicians?
manuscript No. (will be inserted by the editor)
Expressive Typing and Abstract Theories in Nuprl and PVS
Verifying a Garbage Collection Algorithm*yz Paul B. Jackson
Expression Coverability Analysis: Improving code coverage with model checking Graeme D. Cunningham, Institute for System Level Integration, Livingston, Scotland
Can we Resolve the Tension between Constructive Type Theorists and Classical Mathematicians?
Formalization of Divisibility Theory in Nuprl Paul B. Jackson
Total-Correctness Refinement for Sequential Reactive Systems?
manuscript No. (will be inserted by the editor)