Results 1 
5 of
5
Combining Theorem Proving and Model Checking through Symbolic Analysis
 In CONCUR 2000: Concurrency Theory, number 1877 in Lecture
, 2000
"... Automated verification of concurrent systems is hindered by the fact that the state spaces are either infinite or too large for model checking, and the case analysis usually defeats theorem proving. Combinations of the two techniques have been tried with varying degrees of success. We argue for a sp ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
Automated verification of concurrent systems is hindered by the fact that the state spaces are either infinite or too large for model checking, and the case analysis usually defeats theorem proving. Combinations of the two techniques have been tried with varying degrees of success. We argue for a specific combination where theorem proving is used to reduce verification problems to finitestate form, and model checking is used to explore properties of these reductions. This decomposition of the verification task forms the basis of the Symbolic Analysis Laboratory (SAL), a framework for combining different analysis tools for transition systems via a common intermediate language. We demonstrate how symbolic analysis can be an effective methodology for combining deduction and exploration.
Verifying a Distributed Database Lookup Manager Written in Erlang
, 1999
"... We describe a casestudy in which formal methods were used to verify an important responsiveness property of a distributed database system which is used heavily at Ericsson in a number of recent products. One of the aims of the project was to verify the actual running code which is written in ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
We describe a casestudy in which formal methods were used to verify an important responsiveness property of a distributed database system which is used heavily at Ericsson in a number of recent products. One of the aims of the project was to verify the actual running code which is written in the distributed functional language Erlang. In a joint project between SICS and Ericsson we have over the past few years been developing a tableaubased verication tool for Erlang of considerable scope. In particular, we are capable of addressing  on the level of running program code  systems with unbounded behaviour along the many dimensions in which this happens in "real" programs, involving datatypes, recursive control structures, error handling and recovery, initialisation, and dynamic process creation. The database lookup manager considered here contains most of these features, giving rise to innite state behaviour which is not very adequately handled using model checking o...
On the Structure of Inductive Reasoning: Circular and TreeShaped Proofs in the µCalculus
 IN PROCEEDINGS OF FOSSACS 2003
, 2003
"... In this paper we study induction in the context of the firstorder µcalculus with explicit approximations. We present and compare two Gentzenstyle proof systems each using a different type of induction. The first is ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
In this paper we study induction in the context of the firstorder µcalculus with explicit approximations. We present and compare two Gentzenstyle proof systems each using a different type of induction. The first is
A Note on Global Induction Mechanisms in a µCalculus with Explicit Approximations
, 1999
"... We investigate a Gentzenstyle proof system for the firstorder µcalculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge conditio ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We investigate a Gentzenstyle proof system for the firstorder µcalculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the wellfoundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantical condition. We give an automatatheoretic reformulation of this condition which is more suitable for practical proofs. For a detailed
A Tool for Verifying Software Written in Erlang
, 2000
"... The present paper presents an overview of the main results of the ASTEC project Verification of Erlang Programs, focusing in particular on the Erlang verification tool. This is a theoremproving tool which assists in obtaining proofs that Erlang applications satisfy their correctness requirements fo ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The present paper presents an overview of the main results of the ASTEC project Verification of Erlang Programs, focusing in particular on the Erlang verification tool. This is a theoremproving tool which assists in obtaining proofs that Erlang applications satisfy their correctness requirements formulated in a specification logic. We give a summary of the verification framework as supported by the tool, discuss reasoning principles essential for successful verification such as inductive and compositional reasoning, and an efficient treatment of sideeffectfree code. The experiences of applying the verification tool in an industrial case study are summarised, and an approach for supporting verification in the presence of program libraries is outlined. The verification tool is essentially a classical proof assistant, or theoremproving tool, requiring users to intervene in the proof process at crucial steps such as stating program invariants. However, the tool offers considerable support for au...