Sciweavers

2501 search results - page 5 / 501
» Obligations and Their Interaction with Programs
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
13 years 11 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent
ASM
2008
ASM
13 years 9 months ago
Model Based Refinement and the Tools of Tomorrow
The ingredients of typical model based development via refinement are re-examined, and some well known frameworks are reviewed in that light, drawing out commonalities and differen...
Richard Banach
CADE
2004
Springer
14 years 7 months ago
Using Automated Theorem Provers to Certify Auto-generated Aerospace Software
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...
Bernd Fischer 0002, Ewen Denney, Johann Schumann
IJAIT
2006
106views more  IJAIT 2006»
13 years 7 months ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
Ewen Denney, Bernd Fischer 0002, Johann Schumann