Unfold/Fold transformations of concurrent processes

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

Volumn 1140, Issue , 1996, Pages 167-181

  De Francesco, Nicoletta ^a   Santone, Antonella ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; OBJECT ORIENTED PROGRAMMING;

CONCURRENT CALCULI; CONCURRENT LANGUAGES; CONCURRENT PROCESS; CONCURRENT PROGRAM; DARLINGTON; LOGIC LANGUAGES; PROGRAM TRANSFORMATION TECHNIQUES; PROGRAM TRANSFORMATIONS;

COMPUTATIONAL LINGUISTICS;

EID: 84957614268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_84     Document Type: Conference Paper

References (29)

1. T. Bolognesi, M. Caneve. A tool for the analysis of Lotos specifications. In K. Turner (ed.) Formal description techniques, pp. 201-216. Amsterdam: North- Holland 1989.
2. T. Bolognesi, S. Smolka. Fundamental results for the verification of observational equivalence: a survey. In Proc. IFIP WG 6.1 7th Conference on Protocol Specification, Testing and Verification. Amsterdam: North-Holland 1987.
3. A. Bossi and N. Cosso. Basic Transformation operations which preserve Computer Answer Substitutions of Logic Programs. Bulletin of the EATCS, n.54, October 1994, pp.207-223.
4. A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment. Bulletin of the EATCS, n.54, October 1994, pp.207-223.
5. R.M. Burstall, J. Darlington. A Transformation System for Developing Recursive Programs. J. ACM 24(1): pp. 44-67 (1977).
6. S. Christensen, Y. Hirshfeld and F. Moller. Bisimulation is Decidable for all Basic Parallel Processes. In Proceedings of CONCUR'93, number 715 in Lecture Notes in Computer Science, pp. 143-157. Springer-Verlag, 1993.
7. R. Cleaveland, J. Parrow, B. Steffen. The concurrency workbench: operating instructions. Tech. Notes Sussex University, 1988.
8. R. Cleaveland, J. Parrow, B. Steffen. Model Checking and Abstraction. The Concurrency Workbench. Proceedings of Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science 407, Springer-Verlag, 1990, pp. 24-37.
9. S.K. Debray. Unfold/Fold Transformations and Loop Optimization of Logic Programs. In Proceedings of SIGPLAN '88, Conference on Programming Language Design and Implementation. Atlanta, Georgia, SIGPLAN Not. 23(7): pp. 297-307 (1988).
10. N. De Fvancesco, P. Inverardi. Proving Finiteness of CCS Processes by Nonstandard Semantics. Acta informatica, vol.31, n. 1, 1994, pp. 55-80.
11. N. De Francesco, A. Sant one. A Program Transformations Methodology for CCS. In Proceedings of the Fifth Italian Conference of Theoretical Computer Science, Ravello, Italy, November 1995.
12. N. De Francesco, A. Santone. Transforming Concurrent Processes. Internal Report IR-2/94, Dipartimento di Ingegneria dell'lnformazione, Univ. of Pisa.
13. R. De Simone, D. Vergamini. Aboard AUTO. INRIA Technical Report 111, 1989.
14. J. Fernandez.: Aldebaran. Un system de verification par reduction de processus communicantes. Ph.D. Thesis, Université de Grenoble, 1988.
15. P.A. Gardner and J.C. Shepherdson. Unfold/Fold Transformations of Logic Programs. in Computational Proofs: Essays in honour of G. Robinson (1991).
16. J.F. Groote, F.W. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In M. S. Paterson (ed.) Automata, languages and programming. Proceedings (Lect. Notes Comput. Sci., vol 443, pp. 626-638) Berlin, Heildelberg, New York: Springer 1990.
17. P.C. Kanellakis, S.A. Smolka. CCS Expressions, finite state processes and three problems of equivalence. Inf. Comput. 86 (1990).
18. T. Kawamura and T. Kanamori. Preservation of stronger equivalence in unfold/fold logic program transformation. In Theoretical Computer Science, vol. 75, pp. 139-156 (1990).
19. L. Kott. About Transformation System. A Theoretical Study, 3ème Colloque International sur la Programmation, Dunod, Paris, 1978, pp. 232-247.
20. Catalogue of LOTOS Correctness Preserving Transformations. ESPIT Project, Final Deliverable, April 1992.
21. E. Madelaine, D. Vergamini. Finiteness conditions and structural construction of automata for all process algebras. In Proceedings, 2nd Workshop on Computer- Aided Verification. DIMACS Technical report 90-31, June 1990.
22. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
23. A. Pettorossi, M. Proietti. The Loop Absorption and The Generalization Strategies for the Development of Logic Programs and Partial Deduction. Journal of Logic Programming 1993, 16, pp. 123-161.
24. A. Pettorossi, M. Proietti. Rules and Strategies for Program Transformation. In State-of-the-Art. Report on Formal Program Development, Rio de Janeiro, Brazil. Lecture Notes in Computer Science 755, Springer, New York, 1993, pp. 263-304.
25. A. Pettorossi, M. Proietti. Transformation of Logic Programs: Foundations and Techniques. In J. Logic Programming 1994, 19,20: pp.261-320.
26. A. Takeuchi. Affinity between Meta Interpreters and Partial Evaluation. In H.J. Kugler (ed.), Proceedings of Information Processing '86. North-Holland, Amsterdam, 1986, pp. 279-282.
27. H. Tamaki, T. Sato. Unfold/Fold Transformation of Logic Programs. In:S.- Å. Tämlund (ed.), Proceedings of the 2nd International Conference on Logic Programming, Uppsala, Sweden, 1984, pp.127-138.
28. D. Taubner. Finite representations of CCS and TCSP programs by automata and Petri nets. Lecture Notes in Computer Science, vol. 369. Berlin, Heidelberg, New York: Springer 1989.
29. G. Veltink. The PSF toolkit. Computer Networks and ISDN Systems, North Holland, 25, pp. 875-898 (1993).