Sciweavers

509 search results - page 33 / 102
» On the completeness of compositional reasoning methods
Sort
View
LPAR
2004
Springer
14 years 2 months ago
The Inverse Method for the Logic of Bunched Implications
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...
FMOODS
2003
13 years 10 months ago
A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts
This paper outlines a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculu...
Cees Pierik, Frank S. de Boer
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 6 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 8 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
TABLEAUX
2009
Springer
14 years 3 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky