CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes

Garavel, Hubert; Lang, Frédéric; Mateescu, Radu; Serwe, Wendelin

doi:10.1007/978-3-642-19835-9_33

Cited by 119 publications

(122 citation statements)

References 33 publications

Supporting

Mentioning

121

Contrasting

Unclassified

Order By: Relevance

“…Among the behavioral model used for the verification by these tools, the one closest to BIP is the pNets [33] model used for the verification of GCM models in CADP [34]. We leave for future work a study of the connection between BIP and GCM, which would allow applying the verification tools from the BIP tool-set to GCM models.…”

Section: Related Workmentioning

confidence: 99%

Exogenous coordination of concurrent software components with JavaBIP

et al. 2017

View full text Add to dashboard Cite

SUMMARYA strong separation of concerns is necessary in order to make the design of domain-specific functional components independent from cross-cutting concerns, such as concurrent access to the shared resources of the execution platform. Native coordination mechanisms, such as locks and monitors, allow developers to address these issues. However, such solutions are not modular, they are complex to design, debug and maintain. We present the JavaBIP framework that allows developers to think on a higher level of abstraction and clearly separate the functional and coordination aspects of the system behavior. It implements the principles of the BIP component framework rooted in rigorous operational semantics. It allows the coordination of existing concurrent software components in an exogenous manner, relying exclusively on annotations, component APIs and external specification files. We introduce the annotation and specification syntax of JavaBIP and illustrate its use on realistic examples; present the architecture of our implementation, which is modular and easily extensible; provide and discuss performance evaluation results.

show abstract

Section: Related Workmentioning

confidence: 99%

Exogenous coordination of concurrent software components with JavaBIP

et al. 2017

View full text Add to dashboard Cite

show abstract

“…Our approach is supported by several tools: (i) we reuse the Itaca toolbox [6] for synthesising synchronous adapters, and (ii) we rely on process algebra en-codings and reuse equivalence checking techniques available in the CADP verification toolbox [11] for checking synchronizability.…”

Section: Asynchronous Adaptationmentioning

confidence: 99%

Adaptation of Asynchronously Communicating Software

Canal

Salaün

2014

Service-Oriented Computing

View full text Add to dashboard Cite

Abstract. Software adaptation techniques aim at generating new components called adapters, which make a set of services work correctly together by compensating for existing mismatch. Most approaches assume that services interact synchronously using rendez-vous communication.In this paper, we focus on asynchronous communication, where services interact exchanging messages via buffers. We overview a method for automatically generating adapters in such asynchronous environments.

show abstract

“…Our intruder model is based upon the one of Cederquist and Dashti [9], who analysed µCRL [15] models of fair exchange protocols against µ-calculus expressions [16] of liveness properties constrained by fairness using CADP [17]. While the properties against which Cederquist and Dashti analysed their models are not refinement-closed, our liveness properties shall be.…”

Section: An Intruder Model In Csp For Verifying Livenessmentioning

confidence: 99%

Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols

Williams

Ruiter

Fokkink

2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

Abstract. Motivated by Murray's work on the limits of refinement testing for CSP, we propose the use of ProB to check liveness properties under assumptions of strong and weak event fairness, whose refinement-closures cannot generally be expressed as refinement checks for FDR. Such properties are necessary for the analysis of fair exchange protocols in CSP, which assume at least some messages are sent over a resilient channel. As the properties we check are refinement-closed, we retain CSP's theory of refinement, enabling subsequent step-wise refinement of the CSP model. Moreover, we improve upon existing CSP models of fair exchange protocols by proposing a revised intruder model inspired by the one of Cederquist and Dashti. Our intruder model is stronger as we use a weaker fairness constraint.

show abstract

CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes

Cited by 119 publications

References 33 publications

Exogenous coordination of concurrent software components with JavaBIP

Exogenous coordination of concurrent software components with JavaBIP

Adaptation of Asynchronously Communicating Software

Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols

Contact Info

Product

Resources

About