Sciweavers

10715 search results - page 1 / 2143
» From Tests to Proofs
Sort
View
TLCA
1993
Springer
13 years 8 months ago
Program Extraction from Normalization Proofs
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
Ulrich Berger
JAR
2010
98views more  JAR 2010»
12 years 11 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
TSE
2010
110views more  TSE 2010»
13 years 3 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
TAP
2007
Springer
92views Hardware» more  TAP 2007»
13 years 11 months ago
Generating Unit Tests from Formal Proofs
We present a new automatic test generation method for JAVA CARD based on attempts at formal verification of the implementation under test (IUT). Self-contained unit tests in JUnit...
Christian Engel, Reiner Hähnle
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
13 years 11 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko