Sciweavers

608 search results - page 15 / 122
» Tests, Proofs and Refinements
Sort
View
CASSIS
2005
Springer
14 years 1 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
JAR
2008
95views more  JAR 2008»
13 years 7 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
Marc Bezem, Dimitri Hendriks
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Refactoring in maintenance and development of Z specifications
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
Susan Stepney, Fiona Polack, Ian Toyn
CAV
1998
Springer
147views Hardware» more  CAV 1998»
13 years 12 months ago
Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. This demonstrates that f...
Kenneth L. McMillan
POPL
2008
ACM
14 years 8 months ago
A theory of contracts for web services
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
Giuseppe Castagna, Nils Gesbert, Luca Padovani