Proofs from tests

Beckman, Nels E.; Nori, Aditya V.; Rajamani, Sriram K.; Simmons, Robert J.

doi:10.1145/1390630.1390634

Cited by 103 publications

(77 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each unit test, PEX uses dynamic test generation techniques to compute input values that exercise all statements and assertions in the program. (3) Yogi is a tool that combines testing and static analysis (as in [28] to check properties of Windows device drivers [29]). …”

Section: Combination Of Static and Dynamic Analysesmentioning

confidence: 99%

PINCETTE - Validating Changes and Upgrades in Networked Software

Chockler

Denaro

Ling

et al. 2013

2013 17th European Conference on Software Maintenance and Reengineering

View full text Add to dashboard Cite

Networked control systems ensure today's dependability of essential infrastructure such as water, electricity and transportation. Over a life cycle of tens of years, maintenance upgrades of the software running these control systems must not introduce new software errors or otherwise break existing functionality. The EU FP7 project PINCETTE addresses this challenge by employing a combination of static and dynamic software verification tools. The changes between versions are used both as guidance for improving efficiency of software verification, and also to define new notions of correctness. We report on current progress and initial validation results by our industrial partners.

show abstract

Section: Combination Of Static and Dynamic Analysesmentioning

confidence: 99%

PINCETTE - Validating Changes and Upgrades in Networked Software

Chockler

Denaro

Ling

et al. 2013

2013 17th European Conference on Software Maintenance and Reengineering

View full text Add to dashboard Cite

show abstract

“…A detailed description of Yogi's algorithms can be found in [9,4,8]. Here, we give an overview of the algorithm with just enough detail to allow us to describe the optimizations, which are the subject of this paper.…”

Section: Overviewmentioning

confidence: 99%

“…We first presented Synergy [9] which is the core algorithm, but it worked only for single-procedure C programs without pointers. Next, we discovered a new way to deal with pointers using the Dash algorithm [4]. More recently, we have added a way to perform interprocedural analysis such that information is reused from both tests and proofs using the Smash algorithm [8].…”

Section: Introductionmentioning

confidence: 99%

An empirical study of optimizations in YOGI

Nori

Rajamani

2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1

Self Cite

View full text Add to dashboard Cite

Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that several optimizations are part of folklore in the communities that develop these tools, no rigorous evaluation of these optimizations has been done before. We describe and evaluate several engineering optimizations implemented in the Yogi property checking tool, including techniques to pick an initial abstraction, heuristics to pick predicates for refinement, optimizations for interprocedural analysis, and optimizations for testing. We believe that our empirical evaluation gives the verification community useful information about which optimizations they could implement in their tools, and what gains they can realistically expect from these optimizations.

show abstract

“…Spec# [25] infers loops invariants by using abstract interpretation and infers VCs, even in the presence of dynamic allocated objects on the heap. More recently, Dash [2] exploits lightweight symbolic execution techniques and a single call to a theorem prover to show that a given property is satisfied on several paths of the implementation. Euclide implements its own automated constraint solving procedures while Caduceus, Spec# and Dash exploit existing interactive proof assistants and automated theorem provers.…”

Section: Related Workmentioning

confidence: 99%

Euclide: A Constraint-Based Testing Framework for Critical C Programs

Gotlieb

2009

2009 International Conference on Software Testing Verification and Validation

View full text Add to dashboard Cite

Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment form, constraint propagation, integer linear relaxation and search-based test data generation), it addresses three distinct applications in a single framework: structural test data generation, counter-example generation and partial program proving. This paper presents the main capabilities of the tool and relates an experience we had when verifying safety properties for a well-known critical C component of the TCAS (Traffic Collision Avoidance System). Thanks to Euclide, we found an unrevealed counter-example to a given anti-collision property.

show abstract

Proofs from tests

Cited by 103 publications

References 20 publications

PINCETTE - Validating Changes and Upgrades in Networked Software

PINCETTE - Validating Changes and Upgrades in Networked Software

An empirical study of optimizations in YOGI

Euclide: A Constraint-Based Testing Framework for Critical C Programs

Contact Info

Product

Resources

About