Sciweavers

Share
10 search results - page 1 / 2
» Test Data Generation for Programs with Quantified First-Orde...
Sort
View
PTS
2010
175views Hardware» more  PTS 2010»
8 years 9 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
CORR
2004
Springer
176views Education» more  CORR 2004»
8 years 11 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
DAGSTUHL
2004
9 years 15 days ago
Testing with Functions as Specifications
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...
Pieter W. M. Koopman
ENTCS
2008
106views more  ENTCS 2008»
8 years 11 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
9 years 3 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
books