A formal framework for the analysis of recursive-parallel programs

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

Volumn 1277, Issue , 1997, Pages 45-59

  Kushnarenko, O ^a   Schnoebelen, Ph ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Automated verification of programs; Infinite state systems; Semantics of concurrency

Indexed keywords

SEMANTICS;

ABSTRACT PROGRAMS; AUTOMATED VERIFICATION; FORMAL FRAMEWORK; IMPERATIVE PROGRAMS; INFINITE STATE SYSTEMS; OPERATIONAL MODEL; PARALLEL PROCESS; RECURSIVE-PARALLEL PROGRAMS;

PROGRAM TRANSLATORS;

EID: 0005740801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63371-5_6     Document Type: Conference Paper

References (13)

1. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
2. J. A. Bergstra and J. W. Klop. Process theory based on bisimulation semantics. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, pages 50-122. Springer-Verlag, 1989.
3. J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge Univ. Press, 1990.
4. J. Esparza. More infinite results. In Proc. Int. Workshop Verification of Infinite State Systems, Pisa, pages 4-20, August 1996.
5. O. Kouchnarenko. Sémantique des programmes récursifs-parallèles et mét'h-odes pour leur analyse. These de Doctorat, Univ. Joseph Fourier-Grenoble I, France, February 1997.
6. J. B. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc., 95:210-225, 1960.
7. O. Kouchnarenko and Ph. Schnoebelen. A model for recursive-parallel programs. In Proc. Int. Workshop Verification of Infinite State Systems, Pisa, pages 127-138, August 1996.
8. O. Kouchnarenko and Ph. Schnoebelen. Modèles formels pour les programmes récursifs-parallèles. In Proc. RENPAR'8, Bordeaux, pages 85-88, May 1996.
9. F. Moller. Infinite results. In Proc. CONCUR'96, Pisa, Italy, LNCS 1119, pages 195-216. Springer-Verlag, August 1996.
10. Y. Mamatov, V. Vasilchikov, S. Volchenkov, and V. Kurchidis. Multiprocessor computer system with dynamic parallelism. Technical Report 7160, VINITI, Moscow, Russia, September 1988.
11. P. Schnoebelen. On the analysis of RP schemes. Unpublished notes, November 1996.
12. V. Vasilchikov, V. Emielyn, V. Kurchidis, and Y. Mamatov. Recursive-parallel programming and work in RPMSHELL. IPVT RAN, Iaroslavl, Russia, 1994.
13. D. J. Walker. Bisimulations and divergence. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, July 1988.