Paul B. Jackson

Orcid: 0000-0003-3863-8336

Affiliations:
  • University of Edinburgh, UK


According to our database1, Paul B. Jackson authored at least 22 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Transforming Optimization Problems into Disciplined Convex Programming Form.
Proceedings of the Intelligent Computer Mathematics - 17th International Conference, 2024

2019
Verifying Safety and Persistence in Hybrid Systems Using Flowpipes and Continuous Invariants.
J. Autom. Reason., 2019

2018
Compositional Taylor Model Based Validated Integration.
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

VerC3: A library for explicit state synthesis of concurrent systems.
Proceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition, 2018

2017
Verifying Safety and Persistence Properties of Hybrid Systems Using Flowpipes and Continuous Invariants.
Proceedings of the NASA Formal Methods - 9th International Symposium, 2017

Verification of a lazy cache coherence protocol against a weak memory model.
Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

2016
A Method for Invariant Generation for Polynomial Continuous Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

2015
Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems.
Proceedings of the FM 2015: Formal Methods, 2015

2014
Verifying Hybrid Systems Involving Transcendental Functions.
Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

2013
Auditing User-Provided Axioms in Software Verification Conditions.
Proceedings of the Formal Methods for Industrial Critical Systems, 2013

2012
Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase.
Proceedings of the How the World Computes, 2012

2010
Gröbner Basis Construction Algorithms Based on Theorem Proving Saturation Loops.
Proceedings of the Decision Procedures in Software, Hardware and Bioware, 18.04., 2010

2009
Combined Decision Techniques for the Existential Theory of the Reals.
Proceedings of the Intelligent Computer Mathematics, 2009

2006
A Compact Linear Translation for Bounded Model Checking.
Proceedings of the Fourth International Workshop on Bounded Model Checking, 2006

Nuprl.
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

2004
Clause Form Conversions for Boolean Circuits.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

2000
Total-Correctness Refinement for Sequential Reactive Systems.
Proceedings of the Theorem Proving in Higher Order Logics, 13th International Conference, 2000

Constructively formalizing automata theory.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1998
Verifying a Garbage Collection Algorithm.
Proceedings of the Theorem Proving in Higher Order Logics, 11th International Conference, 1998

1995
Enhancing the NUPRL Proof Development System and Applying it to Computational Abstract Algebra.
PhD thesis, 1995

1994
Exploring Abstract Algebra in Constructive Type Theory.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1992
Nuprl and Its Use in Circuit Design.
Proceedings of the Theorem Provers in Circuit Design, 1992


  Loading...