Sciweavers

547 search results - page 23 / 110
» On Automated Program Construction and Verification
Sort
View
CADE
2003
Springer
14 years 7 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
KBSE
1998
IEEE
13 years 11 months ago
Automated Software Test Data Generation for Complex Programs
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
Christoph C. Michael, Gary McGraw
DAC
2002
ACM
14 years 8 months ago
Hole analysis for functional coverage data
One of the main goals of coverage tools is to provide the user with informative presentation of coverage information. Specifically, information on large, cohesive sets of uncovere...
Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
CADE
2008
Springer
14 years 7 months ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic