Specification of an access control system with a formalism combining CCS and CASL

Salaün, Gwen; Allemand, Michel; Attiogbé, Christian

doi:10.1109/ipdps.2002.1016624

Cited by 4 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several works have dealt with the combination of these languages; some well-known results are LOTOS [1], PSF [5], and CRL [2]. In a similar direction, we have proposed a formalism which combines CCS with CASL [11]. We extend this kind of formal combination to enable the specifier to be free to choose his/her specification languages.…”

Section: Introductionmentioning

confidence: 99%

A method to combine any process algebra with an algebraic specification language: the π-calculus example

Salaün

Allemand

Attiogbé

Proceedings 26th Annual International Computer Software and Applications

Self Cite

View full text Add to dashboard Cite

We introduce in [10] the formal foundations to make a generic combination of one process algebra and one algebraic specification language possible. Furthermore, to strengthen the contribution of this work, a concrete illustration about an orders invoicing case study is detailed in [9]. In this paper, we especially focus on the addition of other languages; indeed in the initial work, we only consider a restricted number of process algebras: CCS, CSP, ACP, basic LOTOS. Therefore, we aim at formalizing the way to extend the previous combination. To achieve this goal, we present a method to enhance the syntax and semantics of the formal kernel introduced in [10]. These guidelines are illustrated with the -Calculus.

show abstract

Section: Introductionmentioning

confidence: 99%