Sciweavers

79 search results - page 11 / 16
» Structural Abstraction of Software Verification Conditions
Sort
View
FSEN
2007
Springer
13 years 11 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
CADE
2007
Springer
14 years 7 months ago
A Termination Checker for Isabelle Hoare Logic
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
Jia Meng, Lawrence C. Paulson, Gerwin Klein
SIGADA
2005
Springer
14 years 27 days ago
Experiences using SPARK in an undergraduate CS course
This paper describes experiences garnered while teaching a course on high integrity software using SPARK to a mix of junior and senior level undergraduates. The paper describes th...
Anthony S. Ruocco
POPL
2000
ACM
13 years 11 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
VMCAI
2007
Springer
14 years 1 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif