Process algebra in PVS

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

Volumn 1579, Issue , 1999, Pages 270-284

  Basten, Twan ^a   Hooman, Jozef ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

CONCRETE APPLICATIONS; DATA TYPE; EQUIVALENCE RELATIONS; INDUCTION PRINCIPLES; MECHANICAL SUPPORT; PROCESS ALGEBRAS; VERIFICATION SYSTEMS;

CONCRETES;

EID: 84948958953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49059-0_19     Document Type: Conference Paper

References (17)

1. G. J. Akkerman and J. C. M. Baeten. Term rewriting analysis in process algebra. CWI Quarterly, 4(4): 257-267, 1991.
2. J. C. M. Baeten and C. Verhoef. Concrete process algebra. In S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 4, Semantic Modelling, pages 149-268. Oxford University Press, Oxford, UK, 1995.
3. J. C. M. Baeten and W. P. Weijland. Process Algebra. Prentice-Hall, 1990.
4. J. A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37(4): 241-258, 1994.
5. M. A. Bezem, R. N. Bol, and J. F. Groote. Formalizing process algebraic verifications in the calculus of constructions. Formal Aspects of Computing, 9(1): 1-48, 1997.
6. A. Camilleri. A Higher Order Logic mechanization of the CSP failure-divergence semantics. In Proc. IV Higher Order Workshop, pages 123-150. Workshops in Computing, Springer-Verlag, 1991.
7. A. Camilleri, P. Inverardi, and M. Nesi. Combining interaction and automation in process algebra verification. In TAPSOFT'91, pages 283-296. LNCS 494, Springer-Verlag, 1991.
8. R. Cleaveland, J. Gada, P. Lewis, S. Smolka, O. Sokolsky, and S. Zhang. The Concurrency Factory-practical tools for specification, simulation, verification, and implementation. In Proc. DIMACS Workshop on Specification of Parallel Algorithms, 1994.
9. R. Groenboom, C. Hendriks, I. Polak, J. Terlouw, and J. T. Udding. Algebraic proof assistants in HOL. In Mathematics of Program Construction, pages 304-321. LNCS 947, Springer-Verlag, 1995.
10. J. F. Groote, F. Monin, and J. Springintveld. A computer checked algebraic verification of a distributed summation algorithm. Computing Science Report 97/14, Eindhoven University of Technology, The Netherlands, 1997.
11. H. Korver and A. Sellink. On automating process algebra proofs. In Proc. Symp. on Computer and Information Sciences, ISCIS XI, volume II, pages 815-826, 1996.
12. H. Lin. PAM: A process algebra manipulator. In Proc. Third Workshop on Computer Aided Verification, pages 136-146. LNCS 575, Springer-Verlag, 1991.
13. S. Mauw and G. J. Veltink. A proof assistant for PSF. In Proc. Third Workshop on Computer Aided Verification, pages 158-168. LNCS 575, Springer-Verlag, 1991.
14. T. F. Melham. A mechanized theory of the α-calculus in HOL. Technical Report 244, Computer Laboratory, University of Cambridge, 1992.
15. M. Nesi. Value-passing CCS in HOL. In Proc. 6th Workshop on Higher Order Logic Theorem Proving and Applications, pages 352-365. LNCS 780, Springer-Verlag, 1993.
16. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2): 107-125, 1995.
17. L. C. Paulson. Isabelle: A Generic Theorem Prover. LNCS 828, Springer-Verlag, 1994.