CADP a protocol validation and verification toolbox

Fernandez, Jean-Claude; Garavel, Hubert; Kerbrat, Alain; Mounier, Laurent; Mateescu, Radu; Sighireanu, Mihaela

doi:10.1007/3-540-61474-5_97

Cited by 224 publications

(162 citation statements)

References 3 publications

Supporting

Mentioning

160

Contrasting

Unclassified

Order By: Relevance

“…A set of APIs is provided by the IF exploration platform, which allows implementation of user-specific exploration. Through these APIs, CADP [12], a tool for validation of LTS models and TGV [13], for test case generation using on-the-fly technique can be connected to the IF toolset.…”

Section: If Toolsetmentioning

confidence: 99%

Modeling, Validation, and Verification of PCEP Using the IF Language

Hwang¹,

Lallali²,

Cavalli³

et al. 2009

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. In this paper, we present the modeling, validation, and verification of an industrial protocol for constraint-based path computation, called PCEP. From the PCEP specification defined by IETF, we divide the functionalities of PCEP into two parts: application and protocol. The protocol part of PCEP is then described in the IF language which is based on communicating timed automata. A number of basic requirements are identified from the PCEP specification and then described as properties in the IF language. Based on these properties, the validation and verification of the formal specification are carried out using the IF toolset. Test cases are generated by using an automatic test generation tool, called TestGen-IF, which uses partial state space exploration guided by test purposes. As a result of the modeling, validation, and verification, some errors and ambiguities are found in the PCEP specification. Also a number of test cases are obtained which will be used for testing implementations.

show abstract

Section: If Toolsetmentioning

confidence: 99%

Modeling, Validation, and Verification of PCEP Using the IF Language

Hwang¹,

Lallali²,

Cavalli³

et al. 2009

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

show abstract

“…We use Lotos [14] and its associated CADP [9] toolbox to experiment on the composability checking. We encode the Kmelia components into Lotos processes which are the input of the CADP tools.…”

Section: Formal Verification With Lotos/cadpmentioning

confidence: 99%

Checking Component Composability

Attiogbé

André

Ardourel

2006

Software Composition

View full text Add to dashboard Cite

Abstract. Component-Based Software Engineering (CBSE) is one of the approaches to master the development of large scale software. In this setting, the verification concern is still a challenge. The current work addresses the composability of components and their services. A component model (Kmelia) is introduced; an associated formalism, simple but expressive is introduced; it describes the services as extended LTSs and their structuring as components. The composability of components is defined on the basis of the composability of services. To ensure the correctness of component composition, we check that an assembly is possible via the checking of the composability of the linked services, and their behavioural compatibility. In order to mechanize our approach, the services and the components are translated into the Lotos formalism. Finally the Lotos CADP toolbox is used to perform experiments.

show abstract

“…The µCRL toolset [3] is used to generate a state space from the µCRL translation. Obviously, the state space generated for a client-server system with this client process is larger than the one where the client cannot crash.…”

Section: Translating Fault-tolerant Systems To µCrlmentioning

confidence: 99%

Verification of Language Based Fault-Tolerance

Earle

Fredlund

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we target the verification of fault tolerant aspects of distributed applications written in the Erlang programming language. Erlang programmers mostly work with ready-made language components. Our approach to verification of fault tolerance is to verify systems built using a central component of most Erlang software, a generic server component with fault tolerance handling.To verify such Erlang programs we automatically translate them into processes of the µCRL process algebra, generate their state spaces, and use a model checker to determine whether they satisfy correctness properties specified in the µ-calculus.The key observation of this paper is that, due to the usage of these higher-level design patterns, the state space generated from a Erlang program, even with failures occurring, is relatively small, and can be generated automatically.

show abstract

CADP a protocol validation and verification toolbox

Cited by 224 publications

References 3 publications

Modeling, Validation, and Verification of PCEP Using the IF Language

Modeling, Validation, and Verification of PCEP Using the IF Language

Checking Component Composability

Verification of Language Based Fault-Tolerance

Contact Info

Product

Resources

About