Results 1 
9 of
9
From μCRL to mCRL2  Motivation and Outline
, 2006
"... We sketch the language mCRL2, the successor of μCRL, which is a process algebra with data, devised in 1990 to model and study the behaviour of interacting programs and systems. The language is improved in several respects guided by the experience obtained from numerous applications where realistic s ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
We sketch the language mCRL2, the successor of μCRL, which is a process algebra with data, devised in 1990 to model and study the behaviour of interacting programs and systems. The language is improved in several respects guided by the experience obtained from numerous applications where realistic systems have been modelled and analysed. Just as with μCRL, the leading principle is to provide a minimal set of primitives that allow effective specifications, that conform to standard mathematics and that allow datatypes have been enhanced with higherorder constructs and standard data types, ranging from booleans, numbers and lists to sets, bags and higherorder function types. In the second place multiactions have been introduced to allow a seamless integration with Petri nets. In the last place communication is made local to enable compositionality.
Modelchecking processes with data
 In Science of Computer Programming
, 2005
"... We propose a procedure for automatically verifying properties (expressed in an extension of the modal µcalculus) over processes with data, specified in µCRL. We first briefly review existing work, such as the theory of µCRL and we discuss the logic, called first order modal µcalculus in more detai ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
(Show Context)
We propose a procedure for automatically verifying properties (expressed in an extension of the modal µcalculus) over processes with data, specified in µCRL. We first briefly review existing work, such as the theory of µCRL and we discuss the logic, called first order modal µcalculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several lemmata that are at the basis of the soundness of our decision procedure. We discuss our findings on three nontrivial applications for a prototype implementation of this procedure. The results show that our prototype can deal with quite complex and interesting properties and systems, showing the efficacy of the approach.
Generalizing DPLL and satisfiability for equalities
 Inf. Comput
, 2007
"... Abstract. We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifierfree firstorder logic. Sufficient properties are identified for proving soundness, termination and completeness of GDPLL. We show how the original DPLL proc ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifierfree firstorder logic. Sufficient properties are identified for proving soundness, termination and completeness of GDPLL. We show how the original DPLL procedure is an instance. Subsequently the GDPLL instances for equality logic, and the logic of equality over infinite ground term algebras are presented. Based on this, we implemented a decision procedure for abstract datatypes. We provide some benchmarks.
A Proof System and a Decision Procedure for Equality Logic
, 2003
"... Abstract. We give an approach for deciding satisfiability of equality logic formulas (ESAT) in conjunctive normal form. Central in our approach is a single proof rule called equality resolution (ER). For this single rule we prove soundness and completeness. Based on this rule we propose a complete ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We give an approach for deciding satisfiability of equality logic formulas (ESAT) in conjunctive normal form. Central in our approach is a single proof rule called equality resolution (ER). For this single rule we prove soundness and completeness. Based on this rule we propose a complete procedure for ESAT and prove its correctness. Applying our procedure on a variation of the pigeon hole formula yields a polynomial complexity contrary to earlier approaches to ESAT. Parts of the theory we developed for proving completeness of the proof rule and the algorithm are of interest in itself: we give techniques for removing clauses preserving unsatisfiability, and we give a general theorem globalizing a local commutation criterion for different proof systems.
A Checker For Modal Formulas For Processes With Data
 Proceedings of FMCO 2003, volume 3188 of LNCS
, 2002
"... We propose an algorithm for the automatic verification of firstorder modal calculus formulae on infinite state, datadependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is wellstudied. In this paper, we extend on this solution, such th ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
We propose an algorithm for the automatic verification of firstorder modal calculus formulae on infinite state, datadependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is wellstudied. In this paper, we extend on this solution, such that we can deal with infinite state, datadependent processes. We provide a transformation from the model checking problem to first order boolean equation systems. Moreover, we present an algorithm to solve these equation systems and discuss the capabilities of the algorithm, implemented in a prototype. We also present the application of our prototype tool to several wellknown infinite state processes from the literature. This prototype has also been successfully applied in proving properties of systems that we could not deal with using other available tools.
Transforming Equality Logic to Propositional Logic
 4th International Workshop on First Order Theorem Proving (FTP ’03
, 2003
"... We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality substitution as a new approach combining desirable properties of e ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality substitution as a new approach combining desirable properties of earlier methods, we prove its correctness and show its applicability by experiments.
Decision Procedures for Equality Logic with Uninterpreted Functions
"... Abstract. The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced. Since it is based on the DPLL method, the procedure can adopt its heuristics. Therefore the procedure can be ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced. Since it is based on the DPLL method, the procedure can adopt its heuristics. Therefore the procedure can be used as a basis for efficient implementations of satisfiability checkers for EUF. A part of the introduced method is a technique for reducing the size of formulas, which can also be used as a preprocessing step in other approaches for checking satisfiability of EUF formulas.
Solving satisfiability of ground term algebras using DPLL and unification
 In Workshop on Unification
, 2004
"... Abstract. Abstract datatypes can be viewed as sorted ground term algebras. Unification can be used to solve conjunctions of equations. We give a new algorithm to extend this to the full quantifier free fragment, i.e. including formulas with disjunction and negation. The algorithm is based on unifica ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Abstract datatypes can be viewed as sorted ground term algebras. Unification can be used to solve conjunctions of equations. We give a new algorithm to extend this to the full quantifier free fragment, i.e. including formulas with disjunction and negation. The algorithm is based on unification (to deal with equality) and DPLL (to deal with propositional logic). In this paper we present our algorithm as an instance of a generalized DPLL algorithm. We prove soundness and completeness of the class of generalized DPLL algorithms, in particular for the algorithm for ground term algebras.