Results 1  10
of
22
Algebraic Process Verification
 Handbook of Process Algebra, chapter 17
"... This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. ..."
Abstract

Cited by 62 (16 self)
 Add to MetaCart
This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras.
Reachability analysis of probabilistic systems by successive refinements
 Proc. 1st Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Veri (PAPM/PROBMIV'01), volume 2165 of LNCS
, 2001
"... Abstract. We report on a novel development to model check quantitative reachability properties on Markov decision processes together with its prototype implementation. The innovation of the technique is that the analysis is performed on an abstraction of the model under analysis. Such an abstraction ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
Abstract. We report on a novel development to model check quantitative reachability properties on Markov decision processes together with its prototype implementation. The innovation of the technique is that the analysis is performed on an abstraction of the model under analysis. Such an abstraction is significantly smaller than the original model and may safely refute or accept the required property. Otherwise, the abstraction is refined and the process repeated. As the numerical analysis necessary to determine the validity of the property is more costly than the refinement process, the technique profits from applying such numerical analysis on smaller state spaces.
The Bounded Retransmission Protocol must be on time!
 THIRD INT. WORKSHOP ON TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS'97), LNCS 1217
, 1997
"... This paper concerns the transfer of files via a lossy communication channel. It formally specifies this file transfer service in a propertyoriented way and investigates  using two different techniques  whether a given bounded retransmission protocol conforms to this service. This protocol is ba ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
This paper concerns the transfer of files via a lossy communication channel. It formally specifies this file transfer service in a propertyoriented way and investigates  using two different techniques  whether a given bounded retransmission protocol conforms to this service. This protocol is based on the wellknown alternating bit protocol but allows for a bounded number of retransmissions of a chunk, i.e., part of a file, only. So, eventual delivery is not guaranteed and the protocol may abort the file transfer. We investigate to what extent realtime aspects are important to guarantee the protocol's correctness and use Spin and
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
 In TACAS'99. LNCS 1579
, 1999
"... We consider the problem of verifying automatically infinitestate systems that are systems of finite machines that communicate by exchanging messages through unbounded lossy fifo channels. In a previous work [1], we proposed an algorithmic approach based on constructing a symbolic representation ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
We consider the problem of verifying automatically infinitestate systems that are systems of finite machines that communicate by exchanging messages through unbounded lossy fifo channels. In a previous work [1], we proposed an algorithmic approach based on constructing a symbolic representation of the set of reachable configurations of a system by means of a class of regular expressions (SREs). The construction of such a representation consists of an iterative computation with an acceleration technique which enhance the chance of convergence. This technique is based on the analysis of the effect of iterating control loops. In the work we present here, we experiment our approach and show how it can be effectively applied. For that, we developed a tool prototype based on the results in [1]. Using this tool, we provide a fully automatic verification of (the parameterized version of) the Bounded Retransmission Protocol, for arbitrary values of the size of the transmitted files, and the allowed number of retransmissions. ? Contact author. 1 1
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
 Formal Methods in System Design
, 2004
"... We consider symbolic onthefly verification methods for systems of finitestate machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protoco ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
We consider symbolic onthefly verification methods for systems of finitestate machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class of downward closed languages that arise in the analysis of such protocols. We give methods for (i) computing inclusion between SREs, (ii) an SRE representing the set of states reachable by executing a single transition in a system, and (iii) an SRE representing the set of states reachable by an arbitrary number of executions of a control loop of a program. All these operations are rather simple and can be carried out in polynomial time. With these techniques, one can straightforwardly construct an algorithm which explores the set of reachable states of a protocol, in order t...
Formalizing Process Algebraic Verifications in the Calculus of Constructions
"... This paper reports on the first steps towards the formal verification of correctness proofs of reallife protocols in process algebra. We show that proofs can be verified, and partly constructed, by a general purpose proof checker. The process algebra we use is µCRL, ACP augmented with data, wh ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
This paper reports on the first steps towards the formal verification of correctness proofs of reallife protocols in process algebra. We show that proofs can be verified, and partly constructed, by a general purpose proof checker. The process algebra we use is µCRL, ACP augmented with data, which is small enough to make the verification feasible, and at the same time expressive enough for the specification of reallife protocols. The proof checker we use is Coq, which is based on the Calculus of Constructions, an extension of simply typed lambda calculus. The focus is on the translation of the proof theory of µCRL and µCRLspecifications to Coq. As a case study, we verified the Alternating Bit Protocol.
Verification of InfiniteState Systems by Combining Abstraction and Reachability Analysis
"... ion and Reachability Analysis ? Parosh Aziz Abdulla 1 Aurore Annichini 2 Saddek Bensalem 2 Ahmed Bouajjani 2 Peter Habermehl 3 Yassine Lakhnech 4 1 Dept. of Computer Systems, P.O. Box 325, 75105 Uppsala, Sweden. 2 Verimag, Centre Equation, 2 av. de Vignate, 38610 Gi`eres, France. 3 ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
ion and Reachability Analysis ? Parosh Aziz Abdulla 1 Aurore Annichini 2 Saddek Bensalem 2 Ahmed Bouajjani 2 Peter Habermehl 3 Yassine Lakhnech 4 1 Dept. of Computer Systems, P.O. Box 325, 75105 Uppsala, Sweden. 2 Verimag, Centre Equation, 2 av. de Vignate, 38610 Gi`eres, France. 3 Liafa  Case 7014, 2 place Jussieu, 75251 Paris Cedex 05, France. 4 Institut fur Informatik und Praktishe Mathematik, ChristianAlbrechtsUniversitat zu Kiel, Preußerstr. 19, 24105 Kiel, Germany. Abstract. We address the problem of verifying systems operating on different types of variables ranging over infinite domains. We consider in particular systems modeled by means of extended automata communicating through unbounded fifo channels. We develop a general methodology for analyzing such systems based on combining automatic generation of abstract models (not necessarily finitestate) with symbolic reachability analysis. Reachability analysis procedures allow to verify automatically prope...
XTL: A MetaLanguage and Tool for Temporal Logic ModelChecking
, 1998
"... We present a temporal logic modelchecking environment based on a new language called Xtl (eXecutable Temporal Language). Xtl is a functional programming language designed to allow a compact description of various temporal logic operators, which are evaluated over a Labelled Transition System (Lt ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We present a temporal logic modelchecking environment based on a new language called Xtl (eXecutable Temporal Language). Xtl is a functional programming language designed to allow a compact description of various temporal logic operators, which are evaluated over a Labelled Transition System (Lts). Xtl offers primitives to access the data values (possibly) contained in the states and labels of the Lts, as well as to explore the transition relation. The temporal logic operators are implemented by means of iteration expressions computing sets of states and sets of transitions. Various useful modal and temporal logics like Hml, Ctl, Ltac and Actl, have been implemented in Xtl, and several industrial casestudies, such as the Brp protocol designed by Philips, the Ieee1394 serial bus standardized by Ieee, and the Cfs protocol developed by Bull and Inria, have been successfully validated using the Xtl modelchecker. 1 Introduction The last years have witnessed an increasing ap...
Local ModelChecking of an AlternationFree ValueBased Modal MuCalculus
 In Workshop on Veri Model Checking, and Abstract Interpretation (VMCAI
, 1998
"... Programs written in valuepassing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we define a valuebased alternationfree modal calculus buil ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Programs written in valuepassing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we define a valuebased alternationfree modal calculus built from typed variables, patternmatching modalities, and parameterised fixed point operators. The verification of a temporal formula over a (finite) Lts is reduced to the (partial) resolution of a Parameterised Boolean Equation System (Pbes). We propose a resolution method for Pbess that leads to a local modelchecking algorithm, which could also be applied in the framework of abstract interpretation.
Formal Description and Analysis of a Bounded Retransmission Protocol
 UNIVERSITY OF MARIBOR
, 1996
"... This paper reports about the formal specification and verification of a Bounded Retransmission Protocol (Brp) used by Philips in one of its products. We started with the descriptions of the Brp service (i.e., external behaviour) and protocol written in the µCrl language by Groote and van de Pol. Aft ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
This paper reports about the formal specification and verification of a Bounded Retransmission Protocol (Brp) used by Philips in one of its products. We started with the descriptions of the Brp service (i.e., external behaviour) and protocol written in the µCrl language by Groote and van de Pol. After translating them in the Lotos language, we performed verifications by modelchecking using the Cadp (Caesar/Aldébaran) toolbox. The models of the Lotos descriptions were generated using the Caesar compiler (by putting bounds on the data domains) and checked to be branching equivalent using the Aldébaran tool. Alternately, we formulated in the Actl temporal logic a set of safety and liveness properties for the Brp protocol and checked them on the corresponding model using our Xtl generic modelchecker.