Sciweavers

4814 search results - page 36 / 963
» Combining abstract interpreters
Sort
View
CASCON
2001
115views Education» more  CASCON 2001»
13 years 11 months ago
Lightweight reasoning about program correctness
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
Marsha Chechik, Wei Ding
VMCAI
2009
Springer
14 years 4 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
ACSD
2006
IEEE
76views Hardware» more  ACSD 2006»
14 years 1 months ago
Specification and Verification of Dynamic Communication Systems
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
Jörg Bauer, Ina Schaefer, Tobe Toben, Bernd W...
FCS
2008
13 years 11 months ago
Why Brouwer Was Justified in his Objection to Hilbert's Unqualified Interpretation of Quantification
Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
Bhupinder Singh Anand
LOPSTR
2004
Springer
14 years 3 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...