A front-end generator for verification tools

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1019, Issue , 1995, Pages 153-173

  Cleaveland, Rance ^a   Madelaine, Eric ^b   Sims, Steve ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b 1NRIA ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SYNTACTICS;

ABSTRACT SYNTAX; FRONT END; PROCESS ALGEBRAS; SOURCE LEVEL; VERIFICATION TOOLS;

ALGEBRA;

EID: 84957803919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60630-0_8     Document Type: Conference Paper

References (22)

1. D. Austry and G. Boudol. Algébre de processus et synchronisation. Theoretical Computer Science, 30:91-131, 1984.
2. J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. Technical Report 93/05, Eindhoven University of Technology, 1994.
3. G. Bhat, R. Cleaveland, and O. Grumberg. Efficient on-the-fly model checking for CTL*. In Tenth Annual Symposium on Logic in ComputerScience (LICS '95), San Diego, July 1995. IEEE Computer Society Press.
4. B. Bloom, S. Istrail, and A. Meyer. Bisimulation can't be traced. In Fifteenth Annual ACM Symposium on Principles of Programming Languages (PoPL '88), pages 229-239, San Diego, January 1988. IEEE Computer Society Press.
5. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. In P.H.J.van Eijk, C.A.Vissers, and M.Diaz, editors, The Formal Description Technique LOTOS, pages 23-76. North- Holland, 1989.
6. G. Boudol, V. Roy, R. de Simone, and D. Vergamini. Process calculi, from theory to practice: Verification tools. Rapport de Recherche RR1098, INRIA, October 1989.
7. R. Cleaveland. Analyzing concurrent systems using the Concurrency Workbench. In P.E. Lauer, editor, Functional Programming, Concurrency, Simulation and Automated Reasoning, volume 693 of Lecture Notes in Computer Science, pages 129-144. Springer-Verlag, 1993.
8. R. Cleaveland and M.C.B. Hennessy. Testing equivalence as a bisimulation equivalence. In Proceedings of the Workshop on Automatic Verification Methods,for Finite-State Systems, pages 11-23. Springer- Verlag, 1989.
9. R. Cleaveland and M.C.B. Hennessy. Priorities in process algebra. Information and Computation, 87(1/2):58-77, July/August 1990.
10. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.
11. J.C. Fernandez. Aldébaran: A tool for verification of communicating processes. Technical Report Spectre-c 14, LGI-IMAG, Grenoble, 1989.
12. J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 2(100):202-260, 1992.
13. G. Kahn. Natural semantics. Technical Report RR.601, INKIA, 1987.
14. K.G. Larsen, J.C. Godskesen, and M. Zeeberg. TAV, tools for automatic verification, user manual. Technical Report R 89-19, Dep t of Mathematics and Computer Science, Alborg university, 1989.
15. K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In M.S. Paterson, editor, Automata, Languages and Programming (ICALP '90), volume 443 of Lecture Notes in Computer Science, pages 526-539, Warwick, England, July 1990. Springer- Verlag.
16. E. Madelaine, R. de Simone, and D. Vergamini. ECRINS, user manual, 1988. Technical Documentation.
17. E. Madelaine and D. Vergamini. Finiteness conditions and structural construction of automata for all process algebras. In R. Kurshan, editor, proceedings of Workshop on Computer Aided Verification, New- Brunswick, June 1990. AMS-DIMACS.
18. E. Madelaine and D. Vergamini. Specification and verification of a sliding window protocol in LOTOS. In K. R. Parker and G. A. Rose, editors, Formal Description Techniques, IV, volume C-2 of IFIP Transactions, Sydney, December 1991. North-Holland.
19. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
20. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, University of Aarhus, September 1981.
21. V. Roy and R. de Simone. Auto and autograph. In R. Kurshan, editor, proceedings of Workshop on Computer Aided Verification, New- Brunswick, June 1990. AMS-DIMACS.
22. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. In B. Jonsson and J. Parrow, editors, Proceedings CONCUR 93, Uppsala, Sweden, volume 836 of Lectures Notes in Computer Science, pages 433-448. Springer- Verlag, 1994.