A Front-End Generator for Verification Tools

This paper describes the Process Algebra Compiler (PAC), a front-end generator for process-algebra-based verification tools. Given descriptions of a process algebra's concrete and abstract syntax and semantics as structural operational rules, the PAC produces syntactic routines and functions for computing the semantics of programs in the algebra. Using this tool greatly simplifies the task of adapting verification tools to the analysis of systems described in different languages; it may therefore be used to achieve source-level compatibility between different verification tools. Although the initial verification tools targeted by the PAC are MAUTO and the Concurrency Workbench, the structure of the PAC caters for the support of other tools as well.

[1]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Eric Madelaine,et al.  Finiteness Conditions and Structural Construction of Automata for All Process Algebras , 1990, CAV.

[4]  C.A. Vissers,et al.  Formal description techniques , 1983, Proceedings of the IEEE.

[5]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[6]  R. Cleaveland,et al.  Eecient On-the-fly Model Checking for Ctl , 1995 .

[7]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[8]  Eric Madelaine,et al.  Specification and Verification of a Sliding Window Protocol in LOTOS , 1991, FORTE.

[9]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[10]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..

[11]  Girish Bhat,et al.  Efficient on-the-fly model checking for CTL , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[12]  Robert de Simone,et al.  Process Calculi, from Theory to Practice: Verification Tools , 1989, Automatic Verification Methods for Finite State Systems.

[13]  Tommaso Bolognesi,et al.  Squiggles - A Tool for the Analysis of LOTOS Specifications , 1988, FORTE.

[14]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[15]  Jean-Claude Fernandez.  Ald Ebaran: a Tool for Veriication of Communicating Processes , 1989 .

[16]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[17]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[18]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[19]  Gilles Kahn,et al.  Natural Semantics , 1987, STACS.

[20]  Rance Cleaveland,et al.  Priorities in process algebras , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[21]  E. Madelaine.  Verification Tools from the CONCUR project , 1992 .

[22]  Rance Cleaveland,et al.  Analysing Concurrent Systems Using the Concurrency Workbench , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

[23]  Edwin Alan Harcourt.  The formal specification of instruction set processors and the derivation of instruction schedulers , 1995 .