Alberto Pettorossi - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Program transformation for development, verification, and synthesis of programsFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni. ia, 5(1):119-125, 2011. [doi]

2010

2009

Deciding Full Branching Time Logic by Program TransformationAlberto Pettorossi, Maurizio Proietti, Valerio Senni. LOPSTR 2010: 5-21 [doi]

A Folding Rule for Eliminating Existential Variables from Constraint Logic ProgramsValerio Senni, Alberto Pettorossi, Maurizio Proietti. FUIN, 96(3):373-393, 2009. [doi]

2008

Totally correct logic program transformations via well-founded annotationsAlberto Pettorossi, Maurizio Proietti. lisp, 21(1-2):235, 2008. [doi]

Totally correct logic program transformations via well-founded annotationsAlberto Pettorossi, Maurizio Proietti. lisp, 21(1-2):193-234, 2008. [doi]

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic ProgramsValerio Senni, Alberto Pettorossi, Maurizio Proietti. ICLP 2008: 284-300 [doi]

2007

Automatic Correctness Proofs for Logic Program TransformationsAlberto Pettorossi, Maurizio Proietti, Valerio Senni. ICLP 2007: 364-379 [doi]

2006

Preface: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2Alberto Pettorossi, Maurizio Proietti. FUIN, 69(1-2), 2006. [doi]

Proving Properties of Constraint Logic Programs by Eliminating Existential VariablesAlberto Pettorossi, Maurizio Proietti, Valerio Senni. ICLP 2006: 179-195 [doi]

2005

2004

Transformation Rules for Locally Stratified Constraint Logic ProgramsFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. LOPSTR 2004: 291-339 [doi]

A theory of totally correct logic program transformationsAlberto Pettorossi, Maurizio Proietti. PEPM 2004: 159-168 [doi]

Transformations of logic programs with goals as argumentsAlberto Pettorossi, Maurizio Proietti. tplp, 4(4):495-537, 2004.

2003

Editorial: Special Issue Dedicated to Bob PaigeOlivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi. lisp, 16(1-2):5-6, 2003. [doi]

2002

Combining Logic Programs and Monadic Second Order Logics by Program TransformationFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. LOPSTR 2003: 160-181 [doi]

The List Introduction Strategy for the Derivation of Logic ProgramsAlberto Pettorossi, Maurizio Proietti. fac, 13(3-5):233-251, 2002. [doi]

Program Derivation = Rules + StrategiesAlberto Pettorossi, Maurizio Proietti. BIRTHDAY 2002: 273-309 [doi]

2001

Verification of Sets of Infinite State Processes Using Program TransformationFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. LOPSTR 2001: 111-128 [doi]

Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected PapersAlberto Pettorossi, editor, Volume 2372 of Lecture Notes in Computer Science, Springer, 2001.

2000

Automated Strategies for Specializing Constraint Logic ProgramsFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. LOPSTR 2001: 125-146 [doi]

Automated strategies for specializing constraint logic programsFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. LOPSTR 2001: [doi]

Perfect Model Checking via Unfold/Fold TransformationsAlberto Pettorossi, Maurizio Proietti. cl 2000: 613-628 [doi]

1999

Rules and Strategies for Contextual Specialization of Constraint Logic ProgramsFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. TCS, 30(2), 1999. [doi]

Synthesis and Transformation of Logic Programs Using Unfold/Fold ProofsAlberto Pettorossi, Maurizio Proietti. jlp, 41(2-3):197-230, 1999.

Transformation Rules for Logic Programs with Goals as ArgumentsAlberto Pettorossi, Maurizio Proietti. LOPSTR 2000: 176-195

Transforming Inductive DefinitionsMaurizio Proietti, Alberto Pettorossi. ICLP 1999: 486-499

1998

Program Specialization via Algorithmic Unfold/Fold TransformationsAlberto Pettorossi, Maurizio Proietti. ACM Comput. Surv., 30(3es):6, 1998. [doi]

1997

Program derivation via list introductionAlberto Pettorossi, Maurizio Proietti. alc 1997: 296-323

Reducing Nondeterminism while Specializing Logic ProgramsAlberto Pettorossi, Maurizio Proietti, Sophie Renault. POPL 1997: 414-427 [doi]

Future Directions in Program TransformationAlberto Pettorossi, Maurizio Proietti. SIGPLAN, 32(1):99-102, 1997.

1996

How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract)Alberto Pettorossi, Maurizio Proietti, Sophie Renault. ICLP 1996: 539

A Theory of Logic Program Specialization and Generalization for Dealing with Input Data PropertiesAlberto Pettorossi, Maurizio Proietti. dagstuhl 1996: 386-408

A Comparative Revisitation of Some Program Transformation TechniquesAlberto Pettorossi, Maurizio Proietti. dagstuhl 1996: 355-385

Future Directions in Program TransformationAlberto Pettorossi, Maurizio Proietti. ACM Comput. Surv., 28(4es):171, 1996.

Rules and Strategies for Transforming Functional and Logic ProgramsAlberto Pettorossi, Maurizio Proietti. ACM Comput. Surv., 28(2):360-414, 1996.

Enhancing Partial Deduction via Unfold/Fold RulesAlberto Pettorossi, Maurizio Proietti, Sophie Renault. LOPSTR 1997: 146-168

1995

Correctness of Logic Program Transformations Based on Existential TerminationKung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti. slp 1995: 480-494

Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic ProgramsMaurizio Proietti, Alberto Pettorossi. TCS, 142(1):89-124, 1995. [doi]

1994

Transformation of Logic Programs: Foundations and TechniquesAlberto Pettorossi, Maurizio Proietti. jlp, 19/20:261-320, 1994.

Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical VariablesMaurizio Proietti, Alberto Pettorossi. ICLP 1994: 714-729

Total correctness of a goal replacement rule based on the unfold/fold proof methodMaurizio Proietti, Alberto Pettorossi. agp 1994: 203-217

1993

1992

Meta-Programming in Logic, 3rd International Workshop, META-92, Uppsala, Sweden, June 10-12, 1992, ProceedingsAlberto Pettorossi, editor, Volume 649 of Lecture Notes in Computer Science, Springer, 1992.

Best-first Strategies for Incremental Transformations of Logic ProgramsMaurizio Proietti, Alberto Pettorossi. LOPSTR 1992: 82-98

1991

An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract)Maurizio Proietti, Alberto Pettorossi. LOPSTR 1991: 126-128

Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic ProgramsMaurizio Proietti, Alberto Pettorossi. plilp 1991: 347-358

Semantics Preserving Transformation Rules for PrologMaurizio Proietti, Alberto Pettorossi. PEPM 1991: 274-284

1990

Observers, Experiments and Agents: a Comprehensive Approach to ParallelismStefano Kasangian, Anna Labella, Alberto Pettorossi. litp 1990: 375-406

Synthesis of Eureka Predicates for Developing Logic ProgramsMaurizio Proietti, Alberto Pettorossi. ESOP 1990: 306-325

1989

The Power of the Lambda Abstraction Strategy for Program DerivationAlberto Pettorossi, Andrzej Skowron. eik, 25(5/6):263-281, 1989.

Decidability Results and Characterization of Strategies for the Development of Logic ProgramsAlberto Pettorossi, Maurizio Proietti. ICLP 1989: 539-553

1987

1986

Universal Models in Categories for Process SynchronizationAnna Labella, Alberto Pettorossi. ac 1987: 183-198

Transformation Strategies for Deriving On Line ProgramsAlberto Pettorossi. caap 1986: 127-141

Using Facts for Improving the Parallel Execution of Functional ProgramsAlberto Pettorossi, Andrzej Skowron. icpp 1986: 616-623

Factual Knowledge For Developing Concurrent ProgramsAndrzej Skowron, Alberto Pettorossi. AAAI 1986: 26-31

1985

Categorical Models of Process CooperationAnna Labella, Alberto Pettorossi. ctcs 1986: 282-298

A Note on Cohen s Eliminating Redundant Recursive Calls Alberto Pettorossi. TOPLAS, 7(4):680-685, 1985. [doi]

Towers of Hanoi Problems: Deriving Iterative Solutions by Program TransformationsAlberto Pettorossi. bit, 25(2):327-334, 1985.

1984

A Powerful Strategy for Deriving Efficient Programs by TransformationAlberto Pettorossi. lfp 1984: 273-281

A methodology for improving parallel programs by adding communicationsAlberto Pettorossi, Andrzej Skowron. sct 1985: 228-250 [doi]

1982

Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation TechniqueAlberto Pettorossi, Rod M. Burstall. ACTA, 18:181-206, 1982.

Communicating agents for applicative concurrent programmingAlberto Pettorossi, Andrzej Skowron. programm 1982: 305-322

1981

Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting SystemsAlberto Pettorossi. icalp 1981: 432-447

An Approach to Communications and Parallelism in Applicative LanguagesAlberto Pettorossi. icfpc 1981: 432-446

A transformational approach for developing parallel programsAlberto Pettorossi. conpar 1981: 245-258

1980

Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication MethodAlberto Pettorossi. ipl, 11(4/5):172-179, 1980.

Towards a theory of parallelism and communications for increasing efficiency in applicative languagesAlberto Pettorossi. lop 1983: 224-249

Synthesis of subtree rewriting systems behaviour by solving equationsAlberto Pettorossi. caap 1980: 63-74

1979

On the definition of hierarchies of infinite sequential computationsAlberto Pettorossi. fct 1979: 335-341

1978

Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract)Alberto Pettorossi. mfcs 1978: 416-425

1975

On subrecursiveness in weak combinatory logicCarlo Batini, Alberto Pettorossi. lambda 1975: 297-311