Alberto Pettorossi

176 papers A* 3A 2B 12C 24Journal 75Unranked 54
YearRankTypeTitle / Venue / Authors
2026 J jnl
Constrained Assumption-Based Argumentation Frameworks.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti, Francesca Toni
2025 J jnl
Catamorphic Abstractions for Constrained Horn Clause Satisfiability.
Theory Pract. Log. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2024 C conf
A Historical Perspective on Program Transformation and Recent Developments (Invited Contribution).
PEPM
Alberto Pettorossi, Maurizio Proietti, Fabio Fioravanti, Emanuele De Angelis
2024 J jnl
Catamorphic Abstractions for Constrained Horn Clause Satisfiability.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2023 C conf
Constrained Horn Clauses Satisfiability via Catamorphic Abstractions.
LOPSTR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2023 C conf
Multiple Query Satisfiability of Constrained Horn Clauses.
PADL
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2022 J jnl
Analysis and Transformation of Constrained Horn Clauses for Program Verification.
Theory Pract. Log. Program.
Emanuele De Angelis, Fabio Fioravanti, John P. Gallagher, Manuel V. Hermenegildo, Alberto Pettorossi, Maurizio Proietti
2022 — conf
Contract Strengthening through Constrained Horn Clause Verification.
HCVS/VPT@ETAPS
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2022 J jnl
Multiple Query Satisfiability of Constrained Horn Clauses.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2022 J jnl
Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach.
J. Log. Comput.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2022 J jnl
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2022 J jnl
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses.
Theory Pract. Log. Program.
Emanuele De Angelis, Maurizio Proietti, Fabio Fioravanti, Alberto Pettorossi
2021 J jnl
Analysis and Transformation of Constrained Horn Clauses for Program Verification.
CoRR
Emanuele De Angelis, Fabio Fioravanti, John P. Gallagher, Manuel V. Hermenegildo, Alberto Pettorossi, Maurizio Proietti
2021 J jnl
Satisfiability of Constrained Horn Clauses on Algebraic Data Types: A Transformation-based Approach.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2021 — book
Techniques for Searching, Parsing, and Matching
Alberto Pettorossi
2020 — conf
A Historical Account of My Early Research Interests.
VPT/HCVS@ETAPS
Alberto Pettorossi
2020 J jnl
Preface.
Fundam. Informaticae
Manuel V. Hermenegildo, Pedro López-García, Alberto Pettorossi, Maurizio Proietti
2020 — conf
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates.
IJCAR (1)
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2020 J jnl
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2019 — conf
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study.
VPT@Programming
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2019 — conf
Property-Based Test Case Generators for Free.
TAP@FM
Emanuele De Angelis, Fabio Fioravanti, Adrián Palacios, Alberto Pettorossi, Maurizio Proietti
2019 — conf
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification.
CILC
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2019 — conf
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification.
HCVS/PERR@ETAPS
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2019 J jnl
Semantics and Controllability of Time-Aware Business Processes.
Fundam. Informaticae
Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti
2019 J jnl
Solving Horn Clauses on Inductive Data Types Without Induction - ERRATUM.
Theory Pract. Log. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2018 — conf
Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs.
HCVS
Emanuele De Angelis, Fabio Fioravanti, Adrián Palacios, Alberto Pettorossi, Maurizio Proietti
2018 J jnl
Predicate Pairing for program verification.
Theory Pract. Log. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2018 J jnl
Preface.
Fundam. Informaticae
Camillo Fiorentini, Alberto Momigliano, Alberto Pettorossi
2018 J jnl
Preface.
Fundam. Informaticae
Marco Maratea, Viviana Mascardi, Davide Ancona, Alberto Pettorossi
2018 J jnl
Solving Horn Clauses on Inductive Data Types Without Induction.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2018 J jnl
Solving Horn Clauses on Inductive Data Types Without Induction.
Theory Pract. Log. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2017 J jnl
Enhancing Predicate Pairing with Abstraction for Relational Verification.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2017 J jnl
Predicate Pairing for Program Verification.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2017 C conf
Predicate Pairing with Abstraction for Relational Verification.
LOPSTR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2017 J jnl
Preface.
Fundam. Informaticae
Laura Giordano, Valentina Gliozzi, Alberto Pettorossi, Gian Luca Pozzato
2017 J jnl
Program Verification using Constraint Handling Rules and Array Constraint Generalizations.
Fundam. Informaticae
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2017 J jnl
Regularity of non context-free languages over a singleton terminal alphabet.
CoRR
Alberto Pettorossi, Maurizio Proietti
2017 J jnl
Semantics-based generation of verification conditions via program specialization.
Sci. Comput. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2017 B conf
Verifying Controllability of Time-Aware Business Processes.
RuleML+RR
Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti
2016 B conf
Relational Verification Through Horn Clause Transformation.
SAS
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2016 — conf
Removing Unnecessary Variables from Horn Clause Verification Conditions.
HCVS@ETAPS
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2016 C conf
Verification of Time-Aware Business Processes Using Constrained Horn Clauses.
LOPSTR
Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti
2016 J jnl
Verification of Time-Aware Business Processes using Constrained Horn Clauses.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti
2016 — conf
Verifying Relational Program Properties by Transforming Constrained Horn clauses.
CILC
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2015 J jnl
A Rule-based Verification Strategy for Array Manipulating Programs.
Fundam. Informaticae
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2015 — ed.
Proceedings of the Third International Workshop on Verification and Program Transformation, VPT@ETAPS 2015, London, United Kingdom, 11th April 2015.
VPT@ETAPS
Alexei Lisitsa, Andrei P. Nemytykh, Alberto Pettorossi
2015 J jnl
Proving Correctness of Imperative Programs by Linearizing Constrained Horn Clauses.
CoRR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2015 J jnl
Proving correctness of imperative programs by linearizing constrained Horn clauses.
Theory Pract. Log. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2015 C conf
Semantics-based generation of verification conditions by program specialization.
PPDP
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2014 — conf
Program Verification using Constraint Handling Rules and Array Constraint Generalizations.
VPT@CAV
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2014 — conf
Program Verification using Constraint Handling Rules and Array Constraint Generalizations.
CILC
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2014 J jnl
Program verification via iterated specialization.
Sci. Comput. Program.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2014 A conf
VeriMAP: A Tool for Verifying Programs through Transformations.
TACAS
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2014 B conf
Verifying Array Programs by Transforming Verification Conditions.
VMCAI
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2013 J jnl
Controlling Polyvariance for Specialization-based Verification.
Fundam. Informaticae
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2013 J jnl
Generalization strategies for the verification of infinite state systems.
Theory Pract. Log. Program.
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2013 J jnl
Preface.
Fundam. Informaticae
Fabio Fioravanti, Alberto Pettorossi, Gianfranco Rossi
2013 — conf
Program Transformation for Program Verification.
VPT@CAV
Alberto Pettorossi, Maurizio Proietti
2013 J jnl
Proving Theorems by Program Transformation.
Fundam. Informaticae
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2013 — conf
Verification of Imperative Programs by Constraint Logic Program Transformation.
Festschrift for Dave Schmidt
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2013 — conf
Verification of Imperative Programs by Transforming Constraint Logic Programs.
CILC
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2013 — conf
Verification of Imperative Programs through Transformation of Constraint Logic Programs.
VPT@CAV
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2013 C conf
Verifying programs via iterated specialization.
PEPM
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2012 J jnl
Constraint-based correctness proofs for logic program transformations.
Formal Aspects Comput.
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2012 J jnl
Improving Reachability Analysis of Infinite State Systems by Specialization.
Fundam. Informaticae
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2012 — conf
Software Model Checking by Program Specialization.
CILC
Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti, Alberto Pettorossi
2012 C conf
Specialization with Constrained Generalization for Software Model Checking.
LOPSTR
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2012 J jnl
Synthesizing Concurrent Programs Using Answer Set Programming.
Fundam. Informaticae
Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti
2011 — conf
Controlling Polyvariance for Specialization-based Verification.
CILC
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2011 J jnl
Generalization Strategies for the Verification of Infinite State Systems
CoRR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2011 — conf
Improving Reachability Analysis of Infinite State Systems by Specialization.
RP
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2011 J jnl
Program transformation for development, verification, and synthesis of programs.
Intelligenza Artificiale
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2011 J jnl
RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion.
Fundam. Informaticae
Marco Gavanelli, Toni Mancini, Alberto Pettorossi
2011 — conf
Synthesizing Concurrent Programs using Answer Set Programming.
CILC
Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti
2011 C conf
Using Real Relaxations during Program Specialization.
LOPSTR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 — conf
A Transformation Strategy for Verifying Logic Programs on Infinite Lists.
CILC
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 — conf
Generalization Strategies for the Verification of Infinite State Systems.
CILC
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 J jnl
Preface.
Fundam. Informaticae
Marco Gavanelli, Fabrizio Riguzzi, Alberto Pettorossi
2010 C conf
Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation.
LOPSTR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 — ch.
The Transformational Approach to Program Development.
25 Years GULP
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 J jnl
Transformations of Logic Programs on Infinite Lists
CoRR
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 J jnl
Transformations of logic programs on infinite lists.
Theory Pract. Log. Program.
Alberto Pettorossi, Valerio Senni, Maurizio Proietti
2009 J jnl
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs.
Fundam. Informaticae
Valerio Senni, Alberto Pettorossi, Maurizio Proietti
2009 C conf
Deciding Full Branching Time Logic by Program Transformation.
LOPSTR
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2008 B conf
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs.
ICLP
Valerio Senni, Alberto Pettorossi, Maurizio Proietti
2008 — conf
Program Transformation for Development, Verification, and Synthesis of Software.
Il Milione
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2008 J jnl
Totally correct logic program transformations via well-founded annotations.
High. Order Symb. Comput.
Alberto Pettorossi, Maurizio Proietti
2008 J jnl
Totally correct logic program transformations via well-founded annotations.
High. Order Symb. Comput.
Alberto Pettorossi, Maurizio Proietti
2007 B conf
Automatic Correctness Proofs for Logic Program Transformations.
ICLP
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2006 J jnl
Preface: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2.
Fundam. Informaticae
Alberto Pettorossi, Maurizio Proietti
2006 B conf
Proving Properties of Constraint Logic Programs by Eliminating Existential Variables.
ICLP
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2005 J jnl
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism.
High. Order Symb. Comput.
Alberto Pettorossi, Maurizio Proietti, Sophie Renault
2005 J jnl
Editorial.
High. Order Symb. Comput.
Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
2005 J jnl
Program Transformation: Theoretical Foundations and Basic Techniques. Part 1.
Fundam. Informaticae
Alberto Pettorossi, Maurizio Proietti
2005 — conf
Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs.
Transformation Techniques in Software Engineering
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2005 C conf
Transformational Verification of Parameterized Protocols Using Array Formulas.
LOPSTR
Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2004 C conf
A theory of totally correct logic program transformations.
PEPM
Alberto Pettorossi, Maurizio Proietti
2004 — conf
Automatic Proofs of Protocols via Program Transformation.
MSRAS
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2004 J jnl
Transformation Rules for Locally Stratified Constraint Logic Programs
CoRR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2004 — ch.
Transformation Rules for Locally Stratified Constraint Logic Programs.
Program Development in Computational Logic
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2004 J jnl
Transformations of logic programs with goals as arguments.
Theory Pract. Log. Program.
Alberto Pettorossi, Maurizio Proietti
2003 J jnl
Combining Logic Programs and Monadic Second Order Logics by Program Transformation
CoRR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2003 J jnl
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
CoRR
Alberto Pettorossi, Maurizio Proietti, Sophie Renault
2003 J jnl
Editorial: Special Issue Dedicated to Bob Paige.
High. Order Symb. Comput.
Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
2003 J jnl
Transformations of Logic Programs with Goals as Arguments
CoRR
Alberto Pettorossi, Maurizio Proietti
2002 C conf
Combining Logic Programs and Monadic Second Order Logics by Program Transformation.
LOPSTR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2002 — conf
Program Derivation = Rules + Strategies.
Computational Logic: Logic Programming and Beyond
Alberto Pettorossi, Maurizio Proietti
2002 — conf
Specialization with Clause Splitting for Deriving Deterministic Constraint Logic Programs.
APPIA-GULP-PRODE
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2002 J jnl
The List Introduction Strategy for the Derivation of Logic Programs.
Formal Aspects Comput.
Alberto Pettorossi, Maurizio Proietti
2001 C ed.
Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers
LOPSTR
Alberto Pettorossi
2001 C conf
Verification of Sets of Infinite State Processes Using Program Transformation.
LOPSTR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2000 — conf
Automated Strategies for Specializing Constraint Logic Programs.
LOPSTR (LNCS 2042: Selected Papers)
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2000 C conf
Automated strategies for specializing constraint logic programs.
LOPSTR
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2000 — conf
Perfect Model Checking via Unfold/Fold Transformations.
Computational Logic
Alberto Pettorossi, Maurizio Proietti
1999 — conf
Rules and Strategies for Contextual Specialization of Constraint Logic Programs.
WOID@ICLP
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
1999 J jnl
Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs.
J. Log. Program.
Alberto Pettorossi, Maurizio Proietti
1999 C conf
Transformation Rules for Logic Programs with Goals as Arguments.
LOPSTR
Alberto Pettorossi, Maurizio Proietti
1999 B conf
Transforming Inductive Definitions.
ICLP
Maurizio Proietti, Alberto Pettorossi
1998 J jnl
Program Specialization via Algorithmic Unfold/Fold Transformations.
ACM Comput. Surv.
Alberto Pettorossi, Maurizio Proietti
1997 J jnl
Future Directions in Program Transformation.
ACM SIGPLAN Notices
Alberto Pettorossi, Maurizio Proietti
1997 — conf
Program derivation via list introduction.
Algorithmic Languages and Calculi
Alberto Pettorossi, Maurizio Proietti
1997 A* conf
Reducing Nondeterminism while Specializing Logic Programs.
POPL
Alberto Pettorossi, Maurizio Proietti, Sophie Renault
1996 — conf
A Comparative Revisitation of Some Program Transformation Techniques.
Dagstuhl Seminar on Partial Evaluation
Alberto Pettorossi, Maurizio Proietti
1996 — conf
A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties.
Dagstuhl Seminar on Partial Evaluation
Alberto Pettorossi, Maurizio Proietti
1996 J jnl
Developing correct and efficient logic programs by transformation.
Knowl. Eng. Rev.
Alberto Pettorossi, Maurizio Proietti
1996 C conf
Enhancing Partial Deduction via Unfold/Fold Rules.
LOPSTR
Alberto Pettorossi, Maurizio Proietti, Sophie Renault
1996 J jnl
Future Directions in Program Transformation.
ACM Comput. Surv.
Alberto Pettorossi, Maurizio Proietti
1996 — conf
How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract).
JICSLP
Alberto Pettorossi, Maurizio Proietti, Sophie Renault
1996 J jnl
Rules and Strategies for Transforming Functional and Logic Programs.
ACM Comput. Surv.
Alberto Pettorossi, Maurizio Proietti
1995 — conf
Correctness of Logic Program Transformations Based on Existential Termination.
ILPS
Kung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti
1995 J jnl
Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs.
Theor. Comput. Sci.
Maurizio Proietti, Alberto Pettorossi
1994 B conf
Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables.
ICLP
Maurizio Proietti, Alberto Pettorossi
1994 — conf
Total correctness of a goal replacement rule based on the unfold/fold proof method.
GULP-PRODE (1)
Maurizio Proietti, Alberto Pettorossi
1994 J jnl
Transformation of Logic Programs: Foundations and Techniques.
J. Log. Program.
Alberto Pettorossi, Maurizio Proietti
1993 J jnl
An Abstract Strategy for Transforming Logic Programs.
Fundam. Informaticae
Maurizio Proietti, Alberto Pettorossi
1993 — conf
Completeness of some Transformation Strategies for Avoiding Unncecessary Logical Variables.
GULP
Maurizio Proietti, Alberto Pettorossi
1993 — conf
Rules and Strategies for Program Transformation.
Formal Program Development
Alberto Pettorossi, Maurizio Proietti
1993 C conf
Synthesis of Programs from Unfold/Fold Proofs.
LOPSTR
Maurizio Proietti, Alberto Pettorossi
1993 J jnl
The Loop Absorption and the Generalization Strategies for the Development of Logic Programs and Partial Deduction.
J. Log. Program.
Maurizio Proietti, Alberto Pettorossi
1992 C conf
Best-first Strategies for Incremental Transformations of Logic Programs.
LOPSTR
Maurizio Proietti, Alberto Pettorossi
1992 — ed.
Meta-Programming in Logic, 3rd International Workshop, META-92, Uppsala, Sweden, June 10-12, 1992, Proceedings
META
Alberto Pettorossi
1991 C conf
An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract).
LOPSTR
Maurizio Proietti, Alberto Pettorossi
1991 C conf
Semantics Preserving Transformation Rules for Prolog.
PEPM
Maurizio Proietti, Alberto Pettorossi
1991 — conf
Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs.
PLILP
Maurizio Proietti, Alberto Pettorossi
1990 — conf
Observers, Experiments and Agents: a Comprehensive Approach to Parallelism.
Semantics of Systems of Concurrent Processes
Stefano Kasangian, Anna Labella, Alberto Pettorossi
1990 A conf
Synthesis of Eureka Predicates for Developing Logic Programs.
ESOP
Maurizio Proietti, Alberto Pettorossi
1989 B conf
Decidability Results and Characterization of Strategies for the Development of Logic Programs.
ICLP
Alberto Pettorossi, Maurizio Proietti
1989 J jnl
The Power of the Lambda Abstraction Strategy for Program Derivation.
J. Inf. Process. Cybern.
Alberto Pettorossi, Andrzej Skowron
1987 J jnl
Derivation of Efficient Programs for Computing Sequences of Actions.
Theor. Comput. Sci.
Alberto Pettorossi
1987 — conf
Enriched Categories for Local and Interaction Calculi.
Category Theory and Computer Science
Stefano Kasangian, Anna Labella, Alberto Pettorossi
1987 — conf
Higher Order Generalization in Program Derivation.
TAPSOFT, Vol.2
Alberto Pettorossi, Andrzej Skowron
1987 C conf
On Learning with Imperfect Teachers.
ISMIS
Alberto Pettorossi, Zbigniew W. Ras, Maria Zemankova
1987 — conf
Program Development Using Lambda Abstraction.
FSTTCS
Alberto Pettorossi
1986 A* conf
Factual Knowledge For Developing Concurrent Programs.
AAAI
Andrzej Skowron, Alberto Pettorossi
1986 — conf
Transformation Strategies for Deriving On Line Programs.
CAAP
Alberto Pettorossi
1986 — conf
Universal Models in Categories for Process Synchronization.
Mathematical Models for the Semantics of Parallelism
Anna Labella, Alberto Pettorossi
1986 B conf
Using Facts for Improving the Parallel Execution of Functional Programs.
ICPP
Alberto Pettorossi, Andrzej Skowron
1985 J jnl
A Note on Cohen's "Eliminating Redundant Recursive Calls".
ACM Trans. Program. Lang. Syst.
Alberto Pettorossi
1985 — conf
Categorical Models of Process Cooperation.
CTCS
Anna Labella, Alberto Pettorossi
1985 J jnl
Towers of Hanoi Problems: Deriving Iterative Solutions by Program Transformations.
BIT
Alberto Pettorossi
1984 — conf
A Powerful Strategy for Deriving Efficient Programs by Transformation.
LISP and Functional Programming
Alberto Pettorossi
1984 — conf
A methodology for improving parallel programs by adding communications.
Symposium on Computation Theory
Alberto Pettorossi, Andrzej Skowron
1984 J jnl
Higher-order communications for concurrent programming.
Parallel Comput.
Alberto Pettorossi, Andrzej Skowron
1984 — —
Methodologies for transformations and memoing in applicative languages.
Alberto Pettorossi
1982 — conf
Communicating agents for applicative concurrent programming.
Symposium on Programming
Alberto Pettorossi, Andrzej Skowron
1982 J jnl
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique.
Acta Informatica
Alberto Pettorossi, Rod M. Burstall
1981 J jnl
A property which guarantees termination in weak combinatory logic and subtree replacement systems.
Notre Dame J. Formal Log.
Alberto Pettorossi
1981 — conf
A transformational approach for developing parallel programs.
CONPAR
Alberto Pettorossi
1981 — conf
An Approach to Communications and Parallelism in Applicative Languages.
ICFPC
Alberto Pettorossi
1981 A* conf
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems.
ICALP
Alberto Pettorossi
1980 J jnl
Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication Method.
Inf. Process. Lett.
Alberto Pettorossi
1980 — conf
Synthesis of subtree rewriting systems behaviour by solving equations.
CLAAP
Alberto Pettorossi
1980 — conf
Towards a theory of parallelism and communications for increasing efficiency in applicative languages.
Logic of Programs
Alberto Pettorossi
1979 B conf
On the definition of hierarchies of infinite sequential computations.
FCT
Alberto Pettorossi
1978 B conf
Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract).
MFCS
Alberto Pettorossi
1975 — conf
On subrecursiveness in weak combinatory logic.
Lambda-Calculus and Computer Science Theory
Carlo Batini, Alberto Pettorossi