Aaron Dutle
Research Subjects
Research Interests
Aaron Dutle has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Laura Titolo
Code Metal, Boston, USA
3 shared publications - Cesar A. Muñoz
NASA Langley Research Center
2 shared publications César Muñoz
NASA Langley Research Center, Hampton, VA, USA
2 shared publicationsDimitra Giannakopoulou
NASA Ames Research Center, USA
2 shared publications- Esther Conrad
NASA Langley Research Center, USA
2 shared publications Mariano Moscato
National Institute of Aerospace, Hampton, VA, USA
2 shared publications
Latest Publications
- 4 April 2023
- Published by Springer Nature
- p. 295-308
Authoring, Analyzing, and Monitoring Requirements for a Lift-Plus-Cruise Aircraft
- 4 April 2023
- Published by Springer Nature
- p. 295-308
Authoring, Analyzing, and Monitoring Requirements for a Lift-Plus-Cruise Aircraft
- 2 November 2022
- Published by Springer Nature
- p. 59-73
Interpretation and Formalization of the Right-of-Way Rules
- 2 November 2022
- Published by Springer Nature
- p. 59-73
Interpretation and Formalization of the Right-of-Way Rules
- 20 May 2022
- Published by Springer Nature
- p. 809-815
Proof Mate: An Interactive Proof Helper for PVS (Tool Paper)
- 20 May 2022
- Published by Springer Nature
- p. 809-815
Proof Mate: An Interactive Proof Helper for PVS (Tool Paper)
- Open Access
- 11 January 2022
- Published by Association for Computing Machinery (ACM)
- p. 68-81
A compositional proof framework for FRETish requirements
Structured natural languages provide a trade space between ambiguous natural languages that make up most written requirements, and mathematical formal specifications such as Linear Temporal Logic. FRETish is a structured natural language for the elicitation of system requirements developed at NASA. The related open-source tool Fret provides support for translating FRETish requirements into temporal logic formulas that can be input to several verification and analysis tools. In the context of safety-critical systems, it is crucial to ensure that a generated formula captures the semantics of the corresponding FRETish requirement precisely. This paper presents a rigorous formalization of the FRETish language including a new denotational semantics and a proof of semantic equivalence between FRETish specifications and their temporal logic counterparts computed by Fret. The complete formalization and the proof have been developed in the Prototype Verification System (PVS) theorem prover.
- 11 January 2022
- Published by Association for Computing Machinery (ACM)
- p. 68-81
Open AccessA compositional proof framework for FRETish requirements
Structured natural languages provide a trade space between ambiguous natural languages that make up most written requirements, and mathematical formal specifications such as Linear Temporal Logic. FRETish is a structured natural language for the elicitation of system requirements developed at NASA. The related open-source tool Fret provides support for translating FRETish requirements into temporal logic formulas that can be input to several verification and analysis tools. In the context of safety-critical systems, it is crucial to ensure that a generated formula captures the semantics of the corresponding FRETish requirement precisely. This paper presents a rigorous formalization of the FRETish language including a new denotational semantics and a proof of semantic equivalence between FRETish specifications and their temporal logic counterparts computed by Fret. The complete formalization and the proof have been developed in the Prototype Verification System (PVS) theorem prover.
- Open Access
A Compositional Proof Framework for FRETish Requirements
Structured natural languages provide a trade space between ambiguous natural languages that make up most written requirements and mathematical formal specifications such as Linear Temporal Logic. FRETish is a structured natural language for the elicitation of system requirements developed at NASA. The related open-source tool Fret provides support for translating FRETish requirements into temporal logic formulas that can be input to several verification and analysis tools. In the context of safety-critical systems, it is crucial to ensure that a generated formula captures the semantics of the corresponding FRETish requirement precisely. This paper presents a rigorous formalization of the FRETish language including a new denotational semantics and a proof of semantic equivalence between FRETish specifications and their temporal logic counterparts computed by Fret. The complete formalization and the proof have been developed in the Prototype Verification System (PVS) theorem prover.
Open AccessA Compositional Proof Framework for FRETish Requirements
Structured natural languages provide a trade space between ambiguous natural languages that make up most written requirements and mathematical formal specifications such as Linear Temporal Logic. FRETish is a structured natural language for the elicitation of system requirements developed at NASA. The related open-source tool Fret provides support for translating FRETish requirements into temporal logic formulas that can be input to several verification and analysis tools. In the context of safety-critical systems, it is crucial to ensure that a generated formula captures the semantics of the corresponding FRETish requirement precisely. This paper presents a rigorous formalization of the FRETish language including a new denotational semantics and a proof of semantic equivalence between FRETish specifications and their temporal logic counterparts computed by Fret. The complete formalization and the proof have been developed in the Prototype Verification System (PVS) theorem prover.
- Open Access
- 11 February 2020
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 33 (1) , 65-86
Formal analysis of the compact positionreporting algorithm
The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate current state information, including position and velocity messages, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B protocol responsible for the encoding and decoding of aircraft positions. CPR is sensitive to computer arithmetic since it relies on functions that are intrinsically unstable such as floor and modulus. In this paper, a formal verification of the CPR algorithm is presented. In contrast to previous work, the algorithm presented here encompasses the entire range of message types supported by ADS-B. The paper also presents two implementations of the CPR algorithm, one in double-precision floating-point and one in 32-bit unsigned integers, which are both formally verified against the real-number algorithm. The verification proceeds in three steps. For each implementation, a version of CPR, which is simplified and manipulated to reduce numerical instability and leverage features of the datatypes, is proposed. Then, the Prototype Verification System (PVS) is used to formally prove real conformance properties, which assert that the ideal real-number counterpart of the improved algorithm is mathematically equivalent to the standard CPR definition. Finally, the static analyzer Frama-C is used to verify software conformance properties, which say that the software implementation of the improved algorithm is correct with respect to its idealized real-number counterpart. In concert, the two properties guarantee that the implementation meets the original specification. The two implementations will be included in the revised version of the ADS-B standards document as the reference implementation of the CPR algorithm.
- 11 February 2020
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 33 (1) , 65-86
Open AccessFormal analysis of the compact positionreporting algorithm
The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate current state information, including position and velocity messages, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B protocol responsible for the encoding and decoding of aircraft positions. CPR is sensitive to computer arithmetic since it relies on functions that are intrinsically unstable such as floor and modulus. In this paper, a formal verification of the CPR algorithm is presented. In contrast to previous work, the algorithm presented here encompasses the entire range of message types supported by ADS-B. The paper also presents two implementations of the CPR algorithm, one in double-precision floating-point and one in 32-bit unsigned integers, which are both formally verified against the real-number algorithm. The verification proceeds in three steps. For each implementation, a version of CPR, which is simplified and manipulated to reduce numerical instability and leverage features of the datatypes, is proposed. Then, the Prototype Verification System (PVS) is used to formally prove real conformance properties, which assert that the ideal real-number counterpart of the improved algorithm is mathematically equivalent to the standard CPR definition. Finally, the static analyzer Frama-C is used to verify software conformance properties, which say that the software implementation of the improved algorithm is correct with respect to its idealized real-number counterpart. In concert, the two properties guarantee that the implementation meets the original specification. The two implementations will be included in the revised version of the ADS-B standards document as the reference implementation of the CPR algorithm.
- 16 August 2019
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 15 (3-4) , 167-168
Selected extended papers of NFM 2018
- 16 August 2019
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 15 (3-4) , 167-168
Selected extended papers of NFM 2018
- 15 December 2017
- Published by Springer Nature
- p. 19-34
A Formal Analysis of the Compact Position Reporting Algorithm
- 15 December 2017
- Published by Springer Nature
- p. 19-34
A Formal Analysis of the Compact Position Reporting Algorithm
- 21 March 2015
- Published by Springer Nature in European Journal of Mathematics
- Vol. 1 (2) , 320-328
Abelian groups yield many large families for the diamond problem
- 21 March 2015
- Published by Springer Nature in European Journal of Mathematics
- Vol. 1 (2) , 320-328
Abelian groups yield many large families for the diamond problem