Jeremy E. Dawson

According to our database, Jeremy E. Dawson authored at least 35 papers between 1977 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic.

Caitlin D'Abrera, Jeremy E. Dawson, Rajeev Goré

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

2018

Well-Founded Unions.

Jeremy E. Dawson, Nachum Dershowitz, Rajeev Goré

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017

Issues in Machine-Checking the Decidability of Implicational Ticket Entailment.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

2016

Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi.

Jeremy E. Dawson, James Brotherston, Rajeev Goré

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

Machine-Checked Reasoning About Complex Voting Schemes Using Higher-Order Logic.

Jeremy E. Dawson, Rajeev Goré, Thomas Meumann

Proceedings of the E-Voting and Identity - 5th International Conference, 2015

2014

From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic.

Jeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu

Proceedings of the Theoretical Computer Science, 2014

2013

Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic - Extended Version.

Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu

CoRR, 2013

Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic.

Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2010

A Proof Theoretic Analysis of Intruder Theories

Alwen Tiu, Rajeev Goré, Jeremy E. Dawson

Log. Methods Comput. Sci., 2010

Generic Methods for Formalising Sequent Calculi Applied to Provability Logic.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Automating Open Bisimulation Checking for the Spi Calculus.

Alwen Tiu, Jeremy E. Dawson

Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

2009

Termination of Abstract Reduction Systems.

Jeremy E. Dawson, Rajeev Goré

Int. J. Found. Comput. Sci., 2009

Formalising Observer Theory for Environment-Sensitive Bisimulation.

Jeremy E. Dawson, Alwen Tiu

Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

2007

Isabelle Theories for Machine Words.

Jeremy E. Dawson

Proceedings of the Seventh International Workshop on Automated Verification of Critical Systems, 2007

Formalising Generalised Substitutions.

Jeremy E. Dawson

Proceedings of the Theorem Proving in Higher Order Logics, 20th International Conference, 2007

Compound monads in specification languages.

Jeremy E. Dawson

Proceedings of the ACM Workshop Programming Languages meets Program Verification, 2007

2004

Formalising General Correctness.

Jeremy E. Dawson

Proceedings of Computing: The Australasian Theory Symposium, 2004

A General Theorem on Termination of Rewriting.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

A New Machine-checked Proof of Strong Normalisation for Display Logic.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

2002

Formalised Cut Admissibility for Display Logic.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Theorem Proving in Higher Order Logics, 15th International Conference, 2002

Machine-Checking the Timed Interval Calculus.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

2001

Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Computing: The Australasian Theory Symposium, 2001

2000

Neighborly Pythagorean Triples: 10704.

William G. Spohn Jr., Jeremy E. Dawson

Am. Math. Mon., 2000

A Sum of Chebyshev Inequalities: 10687.

James C. Owings Jr., Jeremy E. Dawson, Robin J. Chapman, Darryl K. Nester, Robert A. Agnew, John Beebee, David Callan, R. Garcia-Pelayo, V. Hernandez, J. Martin, J. Hickman, D. Jones, S. S. Kim, Olaf Krafft, Martin Schaefer, G. Letac, John H. Lindsey II, O. P. Lossers, K. Poelladennou, K. Schilling, M. Shemesh

Am. Math. Mon., 2000

A Characterization of Min or Max: 10677.

Harm Derksen, Jeremy E. Dawson

Am. Math. Mon., 2000

1999

Optimizing User-Level Communication Patterns on the Fujitsu AP3000.

Jeremy E. Dawson, Peter E. Strazdins

Proceedings of the International Workshop on Cluster Computing (IWCC '99), 1999

1998

A Mechanised Proof System for Relation Algebra using Display Logic.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

A Mechanisation of Classical Modal Tense Logics Using Isabelle.

Jeremy E. Dawson, Rajeev Goré

Proceedings of the Advanced Topics in Artificial Intelligence, 1998

1994

An Asymptotic Result on the Existence of Generalised Hadamard Matrices.

Warwick de Launey, Jeremy E. Dawson

J. Comb. Theory, Ser. A, 1994

1992

A note on the construction of GH(4tq, EA(q)) for t=1, 2.

Warwick de Launey, Jeremy E. Dawson

Australas. J Comb., 1992

1985

Independence Structures on the Submodules of a Module.

Jeremy E. Dawson

Eur. J. Comb., 1985

Independence Spaces and Uniform Modules.

Jeremy E. Dawson

Eur. J. Comb., 1985

Decomposition of binary matroids.

Jeremy E. Dawson

Comb., 1985

1984

The directed packing numbers DD (t, v, v), t>=;4.

Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn

Comb., 1984

1977

Balanced sets and circuits in a transversal space.

Jeremy E. Dawson

J. Comb. Theory, Ser. B, 1977