Sciweavers

344 search results - page 13 / 69
» Formal Verification of Floating-Point Programs
Sort
View
PTS
2010
175views Hardware» more  PTS 2010»
13 years 5 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
POPL
2009
ACM
14 years 8 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
POPL
2008
ACM
14 years 8 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
IFM
2010
Springer
132views Formal Methods» more  IFM 2010»
13 years 5 months ago
From Operating-System Correctness to Pervasively Verified Applications
Though program verification is known and has been used for decades, the verification of a complete computer system still remains a grand challenge. Part of this challenge is the in...
Matthias Daum, Norbert Schirmer, Mareike Schmidt
CCS
2007
ACM
13 years 11 months ago
Formal correctness of conflict detection for firewalls
We describe the formalization of a correctness proof for a conflict detection algorithm for firewalls in the Coq Proof Assistant. First, we give formal definitions in Coq of a fir...
Venanzio Capretta, Bernard Stepien, Amy P. Felty, ...