{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:55Z","timestamp":1725664975952},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_84","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:20:01Z","timestamp":1330276801000},"page":"167-181","source":"Crossref","is-referenced-by-count":7,"title":["Unfold\/Fold transformations of concurrent processes"],"prefix":"10.1007","author":[{"given":"Nicoletta","family":"Francesco","sequence":"first","affiliation":[]},{"given":"Antonella","family":"Santone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","first-page":"201","volume-title":"Formal description techniques","author":"T. Bolognesi","year":"1989","unstructured":"T. Bolognesi, M. Caneve. A tool for the analysis of Lotos specifications. In K. Turner (ed.) Formal description techniques, pp. 201\u2013216. Amsterdam: North-Holland 1989."},{"key":"12_CR2","volume-title":"Fundamental results for the verification of observational equivalence: a survey","author":"T. Bolognesi","year":"1987","unstructured":"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."},{"key":"12_CR3","first-page":"207","volume":"n.54","author":"A. Bossi","year":"1994","unstructured":"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\u2013223.","journal-title":"Bulletin of the EATCS"},{"key":"12_CR4","first-page":"207","volume":"n.54","author":"A. Bouali","year":"1994","unstructured":"A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment. Bulletin of the EATCS, n.54, October 1994, pp.207\u2013223.","journal-title":"Bulletin of the EATCS"},{"issue":"1","key":"12_CR5","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"R.M. Burstall, J. Darlington. A Transformation System for Developing Recursive Programs. J. ACM 24(1): pp. 44\u201367 (1977).","journal-title":"J. ACM"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013157. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"12_CR7","unstructured":"R. Cleaveland, J. Parrow, B. Steffen. The concurrency workbench: operating instructions. Tech. Notes Sussex University, 1988."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"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\u201337.","DOI":"10.1007\/3-540-52148-8_3"},{"issue":"7","key":"12_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/960116.54020","volume":"23","author":"S.K. Debray","year":"1988","unstructured":"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\u2013307 (1988).","journal-title":"SIGPLAN Not."},{"issue":"n.1","key":"12_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01178922","volume":"31","author":"N. Francesco De","year":"1994","unstructured":"N. De Francesco, P. Inverardi. Proving Finiteness of CCS Processes by Nonstandard Semantics. Acta informatica, vol.31, n.1, 1994, pp. 55\u201380.","journal-title":"Acta informatica"},{"key":"12_CR11","unstructured":"N. De Francesco, A. Santone. A Program Transformations Methodology for CCS. In Proceedings of the Fifth Italian Conference of Theoretical Computer Science, Ravello, Italy, November 1995."},{"key":"12_CR12","unstructured":"N. De Francesco, A. Santone. Transforming Concurrent Processes. Internal Report IR-2\/94, Dipartimento di Ingegneria dell'Informazione, Univ. of Pisa."},{"key":"12_CR13","unstructured":"R. De Simone, D. Vergamini. Aboard AUTO. INRIA Technical Report 111, 1989."},{"key":"12_CR14","unstructured":"J. Fernandez.: Aldebaran. Un system de verification par reduction de processus communicantes. Ph.D. Thesis, Universit\u00e9 de Grenoble, 1988."},{"key":"12_CR15","unstructured":"P.A. Gardner and J.C. Shepherdson. Unfold\/Fold Transformations of Logic Programs, in Computational Proofs: Essays in honour of G. Robinson (1991)."},{"key":"12_CR16","first-page":"626","volume-title":"Lect. Notes Comput. Sci., vol 443","author":"J.F. Groote","year":"1990","unstructured":"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\u2013638) Berlin, Heildelberg, New York: Springer 1990."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, S.A. Smolka. CCS Expressions, finite state processes and three problems of equivalence. Inf. Comput. 86 (1990).","DOI":"10.1016\/0890-5401(90)90025-D"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(90)90065-P","volume":"75","author":"T. Kawamura","year":"1990","unstructured":"T. Kawamura and T. Kanamori. Preservation of stronger equivalence in unfold\/fold logic program transformation. In Theoretical Computer Science, vol. 75, pp. 139\u2013156 (1990).","journal-title":"Theoretical Computer Science"},{"key":"12_CR19","first-page":"232","volume-title":"A Theoretical Study, 3\u00e8me Colloque International sur la Programmation","author":"L. Kott","year":"1978","unstructured":"L. Kott. About Transformation System. A Theoretical Study, 3\u00e8me Colloque International sur la Programmation, Dunod, Paris, 1978, pp. 232\u2013247."},{"key":"12_CR20","unstructured":"Catalogue of LOTOS Correctness Preserving Transformations. ESPIT Project, Final Deliverable, April 1992."},{"key":"12_CR21","unstructured":"E. Madelaine, D. Vergamini. Finiteness conditions and structural construction of automata for all process algebras. In Proceedings, 2nd Workshop on ComputerAided Verification. DIMACS Technical report 90-31, June 1990."},{"key":"12_CR22","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0743-1066(93)90025-C","volume":"16","author":"A. Pettorossi","year":"1993","unstructured":"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\u2013161.","journal-title":"Journal of Logic Programming"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science 755","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-57499-9_23","volume-title":"State-of-the-Art. Report on Formal Program Development, Rio de Janeiro, Brazil","author":"A. Pettorossi","year":"1993","unstructured":"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\u2013304."},{"issue":"20","key":"12_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi, M. Proietti. Transformation of Logic Programs: Foundations and Techniques. In J. Logic Programming 1994, 19, 20: pp.261\u2013320.","journal-title":"J. Logic Programming"},{"key":"12_CR26","first-page":"279","volume-title":"Proceedings of Information Processing '86","author":"A. Takeuchi","year":"1986","unstructured":"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\u2013282."},{"key":"12_CR27","unstructured":"H. Tamaki, T. Sato. Unfold\/Fold Transformation of Logic Programs. In:S.-A. T\u00e4rnlund (ed.), Proceedings of the 2nd International Conference on Logic Programming, Uppsala, Sweden, 1984, pp.127\u2013138."},{"key":"12_CR28","volume-title":"Lecture Notes in Computer Science, vol. 369","author":"D. Taubner","year":"1989","unstructured":"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."},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"G. Veltink. The PSF toolkit. Computer Networks and ISDN Systems, North Holland, 25, pp. 875\u2013898 (1993).","DOI":"10.1016\/0169-7552(93)90053-7"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:10:21Z","timestamp":1605629421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}