Taming test inputs for separation assurance

Giannakopoulou, Dimitra; Howar, Falk; Isberner, Malte; Lauderdale, Todd A.; Rakamarić, Zvonimir; Raman, V. V.

doi:10.1145/2642937.2642940

Cited by 14 publications

(16 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Benchmarks sphere and azimuth are taken from NASA World Wind Java SDK [56], which is a popular open-source 3D interactive world viewer with many users ranging from US Army and Air Force to European Space Agency. An example application that leverages World Wind is a critical component of the Next Generation Air Transportation System (NextGen) called AutoResolver, whose task is to provide separation assurance for airplanes [20]. Table 5 contains additional information about benchmarks.…”

Section: Resultsmentioning

confidence: 99%

“…However, these tools very often generate pessimistic error bounds, especially when nonlinear functions are involved. No tool that is currently maintained rigorously handles transcendental functions that arise in problems such as the safe separation of aircraft [20]. 1 At this point, interval abstraction does not yield a satisfactory result since it computes t d 2 by setting the numerator t to 999 and the denominator d to 1.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions

Solovyev

Jacobsen

Rakamarić

et al. 2015

FM 2015: Formal Methods

Self Cite

123

View full text Add to dashboard Cite

Rigorous estimation of maximum floating-point round-off errors is an important capability central to many formal verification tools. Unfortunately, available techniques for this task often provide overestimates. Also, there are no available rigorous approaches that handle transcendental functions. We have developed a new approach called Symbolic Taylor Expansions that avoids this difficulty, and implemented a new tool called FPTaylor embodying this approach. Key to our approach is the use of rigorous global optimization, instead of the more familiar interval arithmetic, affine arithmetic, and/or SMT solvers. In addition to providing far tighter upper bounds of round-off error in a vast majority of cases, FPTaylor also emits analysis certificates in the form of HOL Light proofs. We release FPTaylor along with our benchmarks for evaluation. Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor ExpansionsAlexey Solovyev, Charles Jacobsen, Zvonimir Rakamarić, and Ganesh Gopalakrishnan School of Computing, University of Utah, Salt Lake City, UT 84112, USA {monad,charlesj,zvonimir,ganesh}@cs.utah.edu Abstract. Rigorous estimation of maximum floating-point round-off errors is an important capability central to many formal verification tools. Unfortunately, available techniques for this task often provide overestimates. Also, there are no available rigorous approaches that handle transcendental functions. We have developed a new approach called Symbolic Taylor Expansions that avoids this difficulty, and implemented a new tool called FPTaylor embodying this approach. Key to our approach is the use of rigorous global optimization, instead of the more familiar interval arithmetic, affine arithmetic, and/or SMT solvers. In addition to providing far tighter upper bounds of round-off error in a vast majority of cases, FPTaylor also emits analysis certificates in the form of HOL Light proofs. We release FPTaylor along with our benchmarks for evaluation.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions

Solovyev

Jacobsen

Rakamarić

et al. 2015

FM 2015: Formal Methods

Self Cite

123

View full text Add to dashboard Cite

show abstract

“…To ensure more systematic testing of the behavior of AutoResolver, potentially targeting some type of test coverage, we previously developed a lighter-weight testing environment to complement the current testing process [16]. That testing environment has the following features.…”

Section: A Lightweight Testing Frameworkmentioning

confidence: 99%

“…In our previous work [16] we measured and compared coverage of our generated test suites in terms of both standard structural coverage criteria, but also in terms of the sets of attempted and successful resolutions.…”

Section: Monitoring the Monitorsmentioning

confidence: 99%

“…In previous work [16] we developed a wrapper that implements parameterized loss of separation scenarios between two aircraft for AutoResolver. In contrast to having trajectories as inputs, which would make it impossible for test-case generation tools to produce realistic trajectories, these scenarios expose parameters such as aircraft velocity and heading.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Test-case generation for runtime analysis and vice versa: verification of aircraft separation assurance

Dimjašević

Giannakopoulou

2015

Proceedings of the 2015 International Symposium on Software Testing and Analysis

Self Cite

View full text Add to dashboard Cite

This paper addresses the problem of specifying properties of aircraft separation assurance software, and verifying these properties at runtime. In particular, we target AutoResolver, a large, complex air-traffic control system that predicts and resolves aircraft loss of separation. In previous work, we developed a light-weight testing environment for AutoResolver. Our work contributed a wrapper around AutoResolver, which enabled the automated generation and fast execution of hundreds of thousands of tests. The focus of the work presented here is in specifying requirements for AutoResolver, in ensuring the generation of test cases that cover these requirements, and in developing a runtime infrastructure for automatically checking the requirements. Such infrastructure must be completely transparent to the AutoResolver code base. Our work combines test-case generation and runtime verification in innovative ways in order to address these challenges. The paper includes a detailed evaluation and discussion of our verification effort.

show abstract

A Little Language for Testing

Groce

Pinto

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Taming test inputs for separation assurance

Cited by 14 publications

References 29 publications

Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions

Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions

Test-case generation for runtime analysis and vice versa: verification of aircraft separation assurance

A Little Language for Testing

Contact Info

Product

Resources

About