Nathan Fulton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nathan Fulton has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- André Platzer
Karlsruhe Institute of Technology
4 shared publications Cyrus Omar
Carnegie Mellon University, Pittsburgh, PA, USA
1 shared publication- Jan-David Quesel
Carnegie Mellon University
1 shared publication Jonathan Aldrich
Carnegie Mellon University, Pittsburgh, PA, USA
1 shared publication- Marcus Völp
Carnegie Mellon University
1 shared publication Rose Bohrer
1 shared publication
Latest Publications
- Open Access
- 4 April 2019
- Published by Springer Nature
- p. 413-430
Verifiably Safe Off-Model Reinforcement Learning
- 4 April 2019
- Published by Springer Nature
- p. 413-430
Open AccessVerifiably Safe Off-Model Reinforcement Learning
- 21 August 2017
- Published by Springer Nature
- p. 207-224
Bellerophon: Tactical Theorem Proving for Hybrid Systems
- 21 August 2017
- Published by Springer Nature
- p. 207-224
Bellerophon: Tactical Theorem Proving for Hybrid Systems
- Open Access
- 18 January 2016
- Published by Association for Computing Machinery (ACM)
- p. 110-121
A logic of proofs for differential dynamic logic: toward independently checkable proof certificates for dynamic logics
Differential dynamic logic is a logic for specifying and verifying safety, liveness, and other properties about models of cyber-physical systems. Theorem provers based on differential dynamic logic have been used to verify safety properties for models of self-driving cars and collision avoidance protocols for aircraft. Unfortunately, these theorem provers do not have explicit proof terms, which makes the implementation of a number of important features unnecessarily complicated without soundness-critical and extra-logical extensions to the theorem prover. Examples include: an unambiguous separation between proof checking and proof search, the ability to extract program traces corresponding to counter-examples, and synthesis of surely-live deterministic programs from liveness proofs for nondeterministic programs. This paper presents a differential dynamic logic with such an explicit representation of proofs. The resulting logic extends both the syntax and semantics of differential dynamic logic with proof terms -- syntactic representations of logical deductions. To support axiomatic theorem proving, the logic allows equivalence rewriting deep within formulas and supports both uniform renaming and uniform substitutions.
- 18 January 2016
- Published by Association for Computing Machinery (ACM)
- p. 110-121
Open AccessA logic of proofs for differential dynamic logic: toward independently checkable proof certificates for dynamic logics
Differential dynamic logic is a logic for specifying and verifying safety, liveness, and other properties about models of cyber-physical systems. Theorem provers based on differential dynamic logic have been used to verify safety properties for models of self-driving cars and collision avoidance protocols for aircraft. Unfortunately, these theorem provers do not have explicit proof terms, which makes the implementation of a number of important features unnecessarily complicated without soundness-critical and extra-logical extensions to the theorem prover. Examples include: an unambiguous separation between proof checking and proof search, the ability to extract program traces corresponding to counter-examples, and synthesis of surely-live deterministic programs from liveness proofs for nondeterministic programs. This paper presents a differential dynamic logic with such an explicit representation of proofs. The resulting logic extends both the syntax and semantics of differential dynamic logic with proof terms -- syntactic representations of logical deductions. To support axiomatic theorem proving, the logic allows equivalence rewriting deep within formulas and supports both uniform renaming and uniform substitutions.
- Top Cited Papers
- 25 July 2015
- Published by Springer Nature
- p. 527-538
KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems
- 25 July 2015
- Published by Springer Nature
- p. 527-538
Top Cited PapersKeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems
- Open Access
- 21 October 2014
- Published by Association for Computing Machinery (ACM)
- p. 3-10
Statically typed string sanitation inside a python
Web applications must ultimately command systems like web browsers and database engines using strings. Strings derived from improperly sanitized user input can as a result be a vector for command injection attacks. In this paper, we introduce regular string types, which classify strings constrained statically to be in a regular language specified by a regular expression. Regular strings support standard string operations like concatenation and substitution, as well as safe coercions, so they can be used to implement, in an essentially conventional manner, the pieces of a web application or framework that handle strings arising from user input. Simple type annotations at function interfaces can be used to statically verify that sanitization has been performed correctly without introducing redundant run-time checks. We specify this type system first as a minimal typed lambda calculus, lambdaRS. To be practical, adopting a specialized type system like this should not require the adoption of a new programming language. Instead, we advocate for extensible type systems: new type system fragments like this should be implemented as libraries atop a mechanism that guarantees that they can be safely composed. We support this with two contributions. First, we specify a translation from lambdaRS to a calculus with only standard strings and regular expressions. Then, taking Python as a language with these constructs, we implement the type system together with the translation as a library using typy, an extensible static type system for Python.
- 21 October 2014
- Published by Association for Computing Machinery (ACM)
- p. 3-10
Open AccessStatically typed string sanitation inside a python
Web applications must ultimately command systems like web browsers and database engines using strings. Strings derived from improperly sanitized user input can as a result be a vector for command injection attacks. In this paper, we introduce regular string types, which classify strings constrained statically to be in a regular language specified by a regular expression. Regular strings support standard string operations like concatenation and substitution, as well as safe coercions, so they can be used to implement, in an essentially conventional manner, the pieces of a web application or framework that handle strings arising from user input. Simple type annotations at function interfaces can be used to statically verify that sanitization has been performed correctly without introducing redundant run-time checks. We specify this type system first as a minimal typed lambda calculus, lambdaRS. To be practical, adopting a specialized type system like this should not require the adoption of a new programming language. Instead, we advocate for extensible type systems: new type system fragments like this should be implemented as libraries atop a mechanism that guarantees that they can be safely composed. We support this with two contributions. First, we specify a translation from lambdaRS to a calculus with only standard strings and regular expressions. Then, taking Python as a language with these constructs, we implement the type system together with the translation as a library using typy, an extensible static type system for Python.
- Open Access
- 19 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 107-108
Security through extensible type systems
- 19 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 107-108
Open AccessSecurity through extensible type systems