Sciweavers

407 search results - page 24 / 82
» Automatic Correctness Proofs for Logic Program Transformatio...
Sort
View
PADL
2009
Springer
14 years 8 months ago
Declarative Network Verification
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg So...
FM
2003
Springer
107views Formal Methods» more  FM 2003»
14 years 26 days ago
A Formal Framework for Modular Synchronous System Design
We present the formal framework for a novel approach for specifying and automatically implementing systems such as digital circuits and network protocols. The goal is to reduce the...
Maria-Cristina V. Marinescu, Martin C. Rinard
CADE
2008
Springer
14 years 8 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
Hasan Amjad, Richard Bornat
POPL
2012
ACM
12 years 3 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
APLAS
2011
ACM
12 years 7 months ago
Constructing List Homomorphisms from Proofs
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
Yun-Yan Chi, Shin-Cheng Mu