Publications of Alberto Pettorossi

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Pettorossi A., in the category Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 155)


2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | 1988 | 1987 | 1986 | 1985 | 1984 | 1983 | 1982 | 1981 | 1980

2020  [top]
  • Emanuele De Angelis, Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates, in the Proceedings of International Joint Conference on Automated Reasoning IJCAR 2020, Lecture Notes in Computer Science, 12166, 2020
  • Alberto Pettorossi: A Historical Account of My Early Research Interests, Electronic Proceedings in Theoretical Computer Science, Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, http://dx.doi.org/10.4204/EPTCS.320.1, 2020

2019  [top]

2018  [top]

2017  [top]

2016  [top]

2015  [top]

2014  [top]

2013  [top]

2012  [top]

2011  [top]

2010  [top]
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Senni V.: Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, in the Proceedings of 20th International Symposium on Logic-Based Synthesis and Transformation (LOPSTR 2010), July 23-25, 2010, Hagenberg, Austria, RISC-Linz Report Series No. 10-14., Alpuente M ed., 2010
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Senni V.: Generalization Strategies for the Verification of Infinite State Systems, in the Proceedings of 25th Italian Conference on Computational Logic (CILC'10), Leone N., Faber W. eds., CEUR-WS, 598, 2010
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: Transformations of Logic Programs on Infinite Lists, Theory and Practice of Logic Programming 10, 383-399, 2010
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: Deciding Full Branching Time Logic by Program Transformation, in: 19th International Symposium on Logic-Based Synthesis and Transformation (LOPSTR '09), Revised Selected Papers, De Schreye D. ed., Lecture Notes in Computer Science, 6037, Springer, 5-21, 2010
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: A Transformation Strategy for Verifying Logic Programs on Infinite Lists, in the Proceedings of 25th Italian Conference on Computational Logic (CILC'10), Leone N., Faber W. eds., CEUR-WS, 598, 2010
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: The Transformational Approach to Program Development, in: A 25 Year Perspective on Logic Programming, Pontelli E., Dovier A. eds., Lecture Notes in Computer Science, 6125, Springer, 112-135, 2010

2009  [top]
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: Deciding Full Branching Time Logic by Program Transformation, in the Proceedings of 19th International Symposium on Logic Program Synthesis and Transformation (LOPSTR 2009), De Schreye D., Quaresma P. eds., 2009
  • Senni V., Alberto Pettorossi, Maurizio Proietti: A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs, Fundamenta Informaticae 96 (3), 373-393, 2009

2008  [top]
  • Alberto Pettorossi, Maurizio Proietti: Totally Correct Logic Program Transformations Via Well-Founded Annotations, Higher-Order and Symbolic Computation 21, 193-235, 2008
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism, Henglein F., Danvy O., Pettorossi A., Mairson H. eds., Automatic Program Development, Springer Heidelberg, 130-177, 2008
  • Senni V., Maurizio Proietti, Alberto Pettorossi: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs, in the Proceedings of 24th International Conference on Logic Programming, Garcia de la Banda M., Pontelli E. eds., Lecture Notes in Computer Science, 5366, pp. 284-300, 2008

2007  [top]
  • Jacovitti G., Alberto Pettorossi, Consolo R., Senni V.: Information Science and Technology for the New Century, in: Quaderni Sefir no. 7, Senni V., Pettorossi A., Jacovitti G., Consolo R. eds., 2007
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: Automatic Correctness Proofs for Logic Program Transformations, in the Proceedings of 23rd International Conference on Logic Programming (ICLP '07), Niemela I., Dahl V. eds., Lecture Notes in Computer Science, 4670, pp. 364-379, Springer, 2007

2006  [top]
  • Alberto Pettorossi, Maurizio Proietti: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2., Fundamenta Informaticae 69, i-iii, 2006
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables, in: Proceedings of the 22nd International Conference on Logic Programming (ICLP '06), Etalle S., Truszczynski M. eds., Lecture Notes in Computer Science, 4079, Springer-Verlag, 179-195, 2006

2005  [top]
  • Danvy O., Henglein F., Mairson H.G., Alberto Pettorossi: Editorial for the Special Issue Dedicated to Bob Paige, Higher-Order and Symbolic Computation 18 (1-2), 5-6, 2005
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Automatic Proofs of Protocols via Program Transformation., in: Monitoring, Security, and Rescue Techniques in Multiagent Systems, Advances in Soft Computing Series, Skowron A., Dunin-Keplicz B., Jankowski A., Szczuka M. eds., Advances in Soft Computing, 99-116, 2005
  • Alberto Pettorossi, Maurizio Proietti: Program Transformation: Theoretical Foundations and Basic Techniques. Part 1, Fundamenta Informaticae 66, i-iii, 2005
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism, Higher-Order and Symbolic Computation 18 (1-2), 121-210, 2005
  • Alberto Pettorossi, Maurizio Proietti, Senni V.: Transformational Verification of Parameterized Protocols Using Array Formulas., in the Proceedings of 15th International Symposium on Logic Based Program Synthesis and Transformation (LOPSTR 2005), Imperial College, London, UK, September 7-9, Hill P.M ed., Lecture Notes in Computer Science, 2005

2004  [top]
  • Alberto Pettorossi, Maurizio Proietti: A theory of totally correct logic program transformations, in the Proceedings of 2004 ACM-SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM-SIGPLAN, 2004
  • Alberto Pettorossi, Maurizio Proietti: Totally correct logic program transformations using well-founded annotations, in the Proceedings of Italian Conference on Computational Logic, Rossi G.F., Panegai E. eds., Quaderni del Dipartimento di Matematica - Università degli Studi di Parma, 2004
  • Alberto Pettorossi, Maurizio Proietti: Transformations of logic programs with goals as arguments, Theory and Practice of Logic Programming 4, 495-537, 2004
  • Alberto Pettorossi, Maurizio Proietti, Fioravanti F.: Transformation rules for locally stratified constraint logic programs, in: Program Development in Computational Logic, Bruynooghe M., Lau K.-K. eds., Lecture Notes in Computer Science, 3049, Springer Heidelberg, 291-339, 2004

2003  [top]
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Combining Logic Programs and Monadic Second Order Logics by Program Transformation, in: 12th International Symposium on Logic-based Program Develpment and Transformation, Leuschel M. ed., Lecture Notes in Computer Science, 2664, 160-181, 2003

2002  [top]
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Verification of Sets of Infinite State Systems Using Program Transformation, in: Logic Based Program Synthesis and Transformation, Pettorossi A. ed., Lecture Notes in Computer Science, 2372, 111-128, 2002
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Specialization with Clause Splitting for Deriving Deterministic Constraint Logic Programs, in the Proceedings of SMC'02, 6 - 9 October, 2002, Hammamet, Tunisia, IEEE International Conference on Systems, Man, and Cybernetics, 2002
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Combining Logic Programs and Monadic Second Order Logics by Program Transformation, in the Proceedings of Proceedings of LOPSTR'02, Twelfth International Workshop on Logic-based Program Development and Transformation, 17-20 Sept. 2002, Madrid, Spain, Bueno F., Leuschel M. eds., 2002
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: A Specialization Technique For Deriving Deterministic Constraint Logic Programs and Its Application to Pattern Matching, in the Proceedings of AGP'02, 2002 Joint Conference on Declarative Programming, 16 - 18 September 2002, Madrid, Spain, Moreno-Navarro J.J., Marino-Carballo J. eds., 2002
  • Alberto Pettorossi, Maurizio Proietti: The List Introduction Strategy for the Derivation of Logic Programs, Formal Aspects of Computing 13, 233-251, 2002
  • Alberto Pettorossi, Maurizio Proietti: Program Derivation = Rules + Strategies, Lecture Notes in Artificial Intelligence, 2407, 273-309, 2002

2001  [top]
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Automated Strategies for Specializing Constraint Logic Programs, Lecture Notes in Computer Science, 2042, Springer-Verlag, 124-146, 2001
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Verifying CTL Properties of Infinite State Systems by Specializing Constraint Logic Programs, in the Proceedings of ACM-Sigplan International Workshop on Verification and Computational Logic, VCL'2001, Florence, Italy, September 4, 2001, pp. 85-96., 2001
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Verifcation of Sets of Infinite State Systems Using Program Transformation, in the Proceedings of Eleventh International Workshop on Logic-based Program Synthesis and Transformation, 2001

2000  [top]
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Contextual Specialization of Constraint Logic Programs, Theoretical Computer Science, Electronic Notes 30 (2), 2000
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Automated Strategies for Specializing Constraint Logic Programs, in the Proceedings of LOPSTR'2000, Logic-based Program Synthesis and Transformation, London, UK, 24-28 July, Lau K.-K. ed., 2000
  • Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Logic Programs with Goals as Arguments, in the Proceedings of Logic-based Program Synthesis and Transformation, LOPSTR '99, Venezia, Italy, Bossi A. ed., Lecture Notes in Computer Science, 1817, 2000
  • Alberto Pettorossi, Maurizio Proietti: Perfect Model Checking via Unfold/Fold Transformations, in the Proceedings of First International Conference on Computational Logic, CL'2000, London, 24-28 July, 2000, Lloyd J.W., others eds., Lecture Notes in Artificial Intelligence, 1861, Springer, 613-628, 2000

1999  [top]
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Contextual Specialization of Constraint Logic Programs, in the Proceedings of ICLP'99 Workshop on Optimization and Implementation of Declarative Programming Languages, WOID '99, Las Cruces University, New Mexico, USA, December 2--3, Leuschel M. ed., 1999
  • Alberto Pettorossi, Maurizio Proietti: Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs, Journal of Logic Programming 41, 197-230, 1999
  • Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Logic Programs with Goals as Arguments, in the Proceedings of LOPSTR '99, Logic-based Program Synthesis and Transformation, Bossi A. ed., 1999
  • Maurizio Proietti, Alberto Pettorossi: Transforming Inductive Definitions, in the Proceedings of 1999 International Conference on Logic Programming, De Schreye D. ed., Logic Programming Series, 1999

1998  [top]

1997  [top]
  • Alberto Pettorossi, Maurizio Proietti: Future Directions in Program Transformation, in the Proceedings of Workshop on Strategic Directions in Computing Research, MIT, Cambridge, USA, SIGPLAN Notices, 32/1, ACM Press, 99-102, 1997
  • Alberto Pettorossi, Maurizio Proietti: Program Derivation via List Introduction, in the Proceedings of IFIP TC2 Working Conference on Algorithmic Languages and Calculi, Le Bischenberg, France, Bird R., Meertens L.G.L.T. eds., Chapman \& Hall, 296-323, 1997
  • Alberto Pettorossi, Maurizio Proietti: Flexible Continuations in Logic Programs via Unfold/Fold Transformations and Goal Generalization, in the Proceedings of 2nd ACM SIGPLAN Workshop on Continuations, ENS, Paris, France, Danvy O. ed., BRICS Notes Series, N6-93-13, 1997
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Enhancing Partial Deduction via Unfold/Fold Rules, in the Proceedings of Logic Program Synthesis and Transformation, 6th International Workshop, Stockholm, Sweden, Gallagher J. ed., Lecture Notes in Computer Science, 1207, Springer-Verlag, 147-168, 1997
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Reducing Nondeterminism while Specializing Logic Programs, in the Proceedings of 24th ACM Symposium on Principles of Programming Languages, La Sorbonne, Paris, France, SIGPLAN Notices, 1997

1996  [top]
  • Alberto Pettorossi, Maurizio Proietti: A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties, in the Proceedings of Dagstuhl Seminar on Partial Evaluation, Thiemann P., Danvy O., Glück R. eds., Lecture Notes in Computer Science, 1110, 1996
  • Alberto Pettorossi, Maurizio Proietti: A Comparative Revisitation of Some Program Transformation Techniques, in the Proceedings of Dagstuhl Seminar on Partial Evaluation., Thiemann P., Danvy O., Glück R. eds., Lecture Notes in Computer Science, 1110, 1996
  • Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Transforming Functional and Logic Programs, ACM Computing Surveys 28 (2), 360-414, 1996
  • Alberto Pettorossi, Maurizio Proietti: Developing Correct and Efficient Logic Programs by Transformation, Knowledge Engineering Review 11 (4), 347-360, 1996
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification, in the Proceedings of Joint International Conference and Symposium on Logic Programming, Bonn, Germany, Maher M. ed., Logic Programming Series, 1996
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Enhancing Partial Deduction via Unfold/Fold Rules, in the Proceedings of Logic Program Synthesis and Transformation, Proceedings LOPSTR '96, Stockholm, Sweden., Gallagher J. ed., 101-112, 1996

1995  [top]
  • Lau K.-K., Ornaghi M., Alberto Pettorossi, Maurizio Proietti: Correctness of Logic Program Transformation Based on Existential Termination, in the Proceedings of 1995 International Logic Programming Symposium (ILPS '95), Lloyd J.W. ed., Logic Programming Series, 1995
  • Maurizio Proietti, Alberto Pettorossi: Unfolding-Definition-Folding, in this Order, for Avoiding Unnecessary Variables in Logic Programs, Theoretical Computer Science 142 (1), 89-124, 1995

1994  [top]
  • Alberto Pettorossi, Maurizio Proietti: Transformation of Logic Programs: Foundations and Techniques, Journal of Logic Programming 19--20, 261-320, 1994
  • Maurizio Proietti, Alberto Pettorossi: Synthesis of Programs from Unfold/Fold Proofs, in the Proceedings of Logic Program Synthesis and Transformation, LOPSTR '93, Louvain-la-Neuve, Belgium, Deville Y. ed., Workshops in Computing, 1994
  • Maurizio Proietti, Alberto Pettorossi: Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables, in the Proceedings of Eleventh International Conference on Logic Programming (ICLP '94), S. Margherita Ligure, Italy, June 13--18, Van Hentenryck P. ed., Logic Programming Series, 1994

1993  [top]
  • Alberto Pettorossi, Pietropoli E., Maurizio Proietti: The Use of the Tupling Strategy in the Development of Parallel Programs, in: Parallel Algorithm Derivation and Program Transformation, Paige R., Reif J., Wachter R. eds., Kluwer Academic Publishers, 111-151, 1993
  • Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Program Transformation, in: Formal Program Development, IFIP TC2/WG2.1 State-of-the-Art Report, Schuman S., Möller B., Partsch H. eds., Lecture Notes in Computer Science, 755, Springer-Verlag, 263-304, 1993
  • Maurizio Proietti, Alberto Pettorossi: Best-First Strategies for Incremental Transformation of Logic Programs, in the Proceedings of Logic Program Synthesis and Transformation, Manchester 1992, Clement T.P., Lau K.-K. eds., Workshops in Computing, 1993
  • Maurizio Proietti, Alberto Pettorossi: An Abstract Strategy for Transforming Logic Programs, Fundamenta Informaticae 18 (2--4), 267-282, 1993
  • Maurizio Proietti, Alberto Pettorossi: The Loop Absorption and the Generalization Strategies for the Development of Logic Programs and Partial Deduction, Journal of Logic Programming 16 (1--2), 123-161, 1993
  • Maurizio Proietti, Alberto Pettorossi: Best-First Strategies for Incremental Transformation of Logic Programs, in the Proceedings of Logic Program Synthesis and Transformation, LOPSTR '92, Manchester, U.K., Lau K.-K., Clement T.P. eds., Springer-Verlag, 82-98, 1993

1992  [top]
  • Maurizio Proietti, Alberto Pettorossi: An Automatic Transformation Strategy for Avoiding Unnecessary Variables in Logic Programs, in the Proceedings of Logic Program Synthesis and Transformation, Manchester 1991, Lau K.-K., Clement T.P. eds., Workshops in Computing, 1992

1991  [top]
  • Maurizio Proietti, Alberto Pettorossi: Unfolding-Definition-Folding, in this Order, for Avoiding Unnecessary Variables in Logic Programs, in: Third International Symposium on Programming Language Implementation and Logic Programming, PLILP '91, Maluszynski J., Wirsing M. eds., Lecture Notes in Computer Science, 528, Springer-Verlag, 347-358, 1991
  • Maurizio Proietti, Alberto Pettorossi: Semantics Preserving Transformation Rules for Prolog, in the Proceedings of ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '91, SIGPLAN Notices, pp. 274-285, 1991

1990  [top]
  • Kasangian S., Labella A., Alberto Pettorossi: Observers, Experements, and Agents: A Comprehensive Approach to Parallelism, in the Proceedings of Summer School, La Roche-Posay, France, Lecture Notes in Computer Science, 469, Springer-Verlag, 375-407, 1990
  • Kasangian S., Labella A., Alberto Pettorossi: Observers, Experiments, and Agents: A Comprehensive Approach to Parallelism, in the Proceedings of Summer School, La Roche-Posay, France, Lecture Notes in Computer Science, 469, Springer-Verlag, 375-407, 1990
  • Maurizio Proietti, Alberto Pettorossi: Synthesis of Eureka Predicates for Developing Logic Programs, in the Proceedings of Third European Symposium on Programming, ESOP '90, Jones N. ed., Lecture Notes in Computer Science, 432, 1990
  • Maurizio Proietti, Alberto Pettorossi: Construction of Efficient Logic Programs by Loop Absorption and Generalization, in the Proceedings of Second International Workshop on Metaprogramming in Logic, Meta '90, Bruynooghe M. ed., 57-81, 1990

1989  [top]
  • Alberto Pettorossi, Maurizio Proietti: Decidability Results and Characterization of Strategies for the Development of Logic Programs, in the Proceedings of Sixth International Conference on Logic Programming, Levi G., Martelli M. eds., Logic Programming Series, 1989
  • Alberto Pettorossi, Skowron A.: The Lambda Abstraction Strategy for Program Derivation, Fundamenta Informaticae 12 (4), 541-561, 1989

1988  [top]
  • Alberto Pettorossi, Maurizio Proietti: Importing and Exporting Information in Program Development, in the Proceedings of IFIP TC2 Working Conference on Partial and Mixed Computation, Björner D., Ershov A.P. eds., North Holland, 405-426, 1988

1987  [top]
  • Kasangian S., Labella A., Alberto Pettorossi: Enriched Categories for Local and Interaction Calculi, in the Proceedings of Summer Conference on Category Theory and Computer Science, Pitt D.H., Poigné A., Rydeheard D.E. eds., Lecture Notes in Computer Science, 283, Springer-Verlag, 57-70, 1987
  • Labella A., Alberto Pettorossi: Universal Models in Categories for Process Synchronization, in the Proceedings of Advanced School on Mathematical Models for the Semantics of Parallelism, Lecture Notes in Computer Science, 280, Springer-Verlag, 183-198, 1987
  • Labella A., Alberto Pettorossi: Categories For Modelling Communicating Processes, Computers and Artificial Intelligence 6 (3), 279-296, 1987
  • Alberto Pettorossi: Derivation of Programs which Traverse Their Input Data Only Once, in the Proceedings of Advanced School on Programming Methodologies, Cioni G., Salwicki A. eds., Academic Prees, 165-184, 1987
  • Alberto Pettorossi: Derivation of Efficient Programs For Computing Sequences of Actions, Theoretical Computer Science 53, 151-167, 1987
  • Alberto Pettorossi, Ras Z.W., Zemankova M.: On Learning with Two Imperfect Teachers, in the Proceedings of Expert Systems: Theory and Applications, IASTED Conference, 1987
  • Alberto Pettorossi, Skowron A.: Higher Order Generalization in Program Derivation, in the Proceedings of International Joint Conference on Theory and Practice of Software Development, Lecture Notes in Computer Science, 250, Springer-Verlag, 182-196, 1987
  • Alberto Pettorossi, Skowron A.: The Parallel Evaluation of Functional Programs, in the Proceedings of Advanced International Summer School and Conference on 'Mathematical Logic and Its Applications' in honor of the 80th anniversary of Kurt Gödel's birth, Skordev D.G. ed., Plenum Press, 149-165, 1987

1986  [top]
  • Chen K.H., Doroszewski J., Alberto Pettorossi, Ras Z.W., Skowron A.: Mathematical Foundations of an Expert System for Medical Diagnosis, in the Proceedings of First International Conference on Artificial Intelligence and Its Impacts in Biology and Medicine, I.A. BIOMED 1986, 87-92, 1986
  • Alberto Pettorossi: Strategical Derivation of On-Line Programs, in the Proceedings of IFIP W.G. 2.1 TC2 Working Conference on Program Specification and Transformation, Meertens L.G.L.T. ed., North Holland, 73-88, 1986
  • Alberto Pettorossi, Skowron A.: Theories for Verifying Communicating Agents Behaviour in Recursive Equations Programs, in the Proceedings of Twentieth Annual Conference on Information Sciences and Systems, Dickinson B. ed., Princeton University, 828-833, 1986

1985  [top]
  • Labella A., Alberto Pettorossi: Categorical Models of Process Cooperation, in the Proceedings of Workshop on Category Theory and Computer Programming, Lecture Notes in Computer Science, 240, Springer-Verlag, 282-298, 1985
  • Labella A., Alberto Pettorossi: Categorical Models for Handshaking Communications, Fundamenta Informaticae 8 (3/4), 321-357, 1985
  • Alberto Pettorossi: A Note on Cohen's 'Eliminating Redundant Recursive Calls', ACM Transactions on Programming Languages and Systems 7 (4), 1985
  • Alberto Pettorossi: Towers of Hanoi problems: deriving iterative solutions by program transformation, Bit 25, 327-334, 1985
  • Alberto Pettorossi, Skowron A.: A Methodology for Improving Parallel Programs by Adding Communications, in the Proceedings of Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 208, Springer-Verlag, 228-250, 1985
  • Alberto Pettorossi, Skowron A.: A System for Developing Distributed Communicating Programs, in the Proceedings of International Conference 'Parallel Computing 85', Feilmeier , Joubert , Schendel eds., North Holland, 241-246, 1985

1984  [top]
  • Alberto Pettorossi: An Algorithm for Saving Memory in Recursive Programs Using Destructive Annotations, in: Computer Program Synthesis Methodologies, Biermann , Guiho , Kodratoff eds., Macmillan Co. New York, 289-303, 1984
  • Alberto Pettorossi: A powerful strategy for deriving efficient programs by transformation, in the Proceedings of ACM Symposium on Lisp and Functional Programming, ACM Press, 273-281, 1984
  • Alberto Pettorossi, Skowron A.: Higher Order Communications for Concurrent Programming, Parallel Computing 1 (3/4), 331-336, 1984

1983  [top]
  • Labella A., Alberto Pettorossi: Categories for Handshaking Communications, in the Proceedings of Colloquia Mathematica Societatis Janos Bolyai 42. Algebra, Combinatorics and Logic in Computer Science, 555-582, 1983
  • Alberto Pettorossi: Towards a Theory of Parallelism and Communications for Increasing Efficiency in Applicative Languages, in the Proceedings of 1980 Conference on Logic of Programs and Their Applications, Salwicki A. ed., Lecture Notes in Computer Science, 148, Springer-Verlag, 224-249, 1983

1982  [top]
  • Krempa J., Alberto Pettorossi, Skowron A.: F-computable Numbers, in the Proceedings of Symposium on Mathematical Foundations of Computer Science, Humboldt Universität Berlin, 24-39, 1982
  • Alberto Pettorossi: Tree Rewriting Systems, Combinatory Logic, and Type Free Languages, Fundamenta Informaticae 5 (3/4), 279-299, 1982
  • Alberto Pettorossi, Burstall R.M.: Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique, Acta Informatica 18, 181-206, 1982
  • Alberto Pettorossi, Skowron A.: Some Contributions of Mathematics to Recent Developments of Theoretical Computer Science, in the Proceedings of 2nd World Conference on Mathematics at the Service of Man, 588-595, 1982
  • Alberto Pettorossi, Skowron A.: Communicating Agents for Applicative Concurrent Programming, in the Proceedings of 5th International Symposium on Programming, Dezani-Ciancaglini , Montanari U. eds., Lecture Notes in Computer Science, 137, Springer-Verlag, 305-322, 1982

1981  [top]
  • Alberto Pettorossi: Comparing and Putting Together Recursive Path Orderings, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems, in the Proceedings of ICALP '81, Lecture Notes in Computer Science, 115, Springer-Verlag, 432-447, 1981
  • Alberto Pettorossi: An Approach to Communications and Parallelism in Applicative Languages, in the Proceedings of International Colloquium on Formalization of Programming Concepts, Diaz J., Ramos I. eds., Lecture Notes in Computer Science, 107, Springer-Verlag, 432-446, 1981
  • Alberto Pettorossi: A Property which Guarantees Termination in Weak Combinatory Logic and Subtree Replacement Systems, Notre Dame Journal of Logic 22, 344-356, 1981

1980  [top]
  • Alberto Pettorossi: Derivation of an $\cal O(k^2\log n)$ algorithm for computing order-k Fibonacci numbers from the $\cal O(k^3 \log n)$ matrix multiplication method, Information Processing Letters 11 (4/5), 172-179, 1980
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -