Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alberto Pettorossi
2010 – today
- 2013
[j36]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Controlling Polyvariance for Specialization-based Verification. Fundam. Inform. 124(4): 483-502 (2013)- [j35]Fabio Fioravanti, Alberto Pettorossi, Gianfranco Rossi: Preface. Fundam. Inform. 124(4): i-ii (2013)
- [j34]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Generalization strategies for the verification of infinite state systems. TPLP 13(2): 175-199 (2013)
- [c66]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Verifying programs via iterated specialization. PEPM 2013: 43-52
- 2012
- [j33]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Constraint-based correctness proofs for logic program transformations. Formal Asp. Comput. 24(4-6): 569-594 (2012)
- [j32]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Improving Reachability Analysis of Infinite State Systems by Specialization. Fundam. Inform. 119(3-4): 281-300 (2012)
- [j31]Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti: Synthesizing Concurrent Programs Using Answer Set Programming. Fundam. Inform. 120(3-4): 205-229 (2012)
- [c65]Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti, Alberto Pettorossi: Software Model Checking by Program Specialization. CILC 2012: 89-103
- [c64]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Specialization with Constrained Generalization for Software Model Checking. LOPSTR 2012: 51-70
- 2011
- [j30]Marco Gavanelli, Toni Mancini, Alberto Pettorossi: RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Fundam. Inform. 107(2-3) (2011)
- [j29]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Program transformation for development, verification, and synthesis of programs. Intelligenza Artificiale 5(1): 119-125 (2011)
- [c63]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Controlling Polyvariance for Specialization-based Verification. CILC 2011: 179-197
- [c62]Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti: Synthesizing Concurrent Programs using Answer Set Programming. CILC 2011: 245-259
- [c61]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Using Real Relaxations during Program Specialization. LOPSTR 2011: 106-122
- [c60]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Improving Reachability Analysis of Infinite State Systems by Specialization. RP 2011: 165-179
- [i6]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Generalization Strategies for the Verification of Infinite State Systems. CoRR abs/1110.0999 (2011)
- 2010
- [j28]
- [j27]Alberto Pettorossi, Valerio Senni, Maurizio Proietti: Transformations of logic programs on infinite lists. TPLP 10(4-6): 383-399 (2010)
- [c59]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: The Transformational Approach to Program Development. 25 Years GULP 2010: 112-135
- [c58]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Generalization Strategies for the Verification of Infinite State Systems. CILC 2010
- [c57]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: A Transformation Strategy for Verifying Logic Programs on Infinite Lists. CILC 2010
- [c56]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation. LOPSTR 2010: 164-183
- [i5]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Transformations of Logic Programs on Infinite Lists. CoRR abs/1007.4157 (2010)
2000 – 2009
- 2009
- [j26]Valerio Senni, Alberto Pettorossi, Maurizio Proietti: A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs. Fundam. Inform. 96(3): 373-393 (2009)
- [c55]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Deciding Full Branching Time Logic by Program Transformation. LOPSTR 2009: 5-21
- 2008
- [j25]Alberto Pettorossi, Maurizio Proietti: Totally correct logic program transformations via well-founded annotations. Higher-Order and Symbolic Computation 21(1-2): 193-234 (2008)
- [j24]Alberto Pettorossi, Maurizio Proietti: Totally correct logic program transformations via well-founded annotations. Higher-Order and Symbolic Computation 21(1-2): 235 (2008)
- [c54]Valerio Senni, Alberto Pettorossi, Maurizio Proietti: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs. ICLP 2008: 284-300
- 2007
- [c53]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Automatic Correctness Proofs for Logic Program Transformations. ICLP 2007: 364-379
- 2006
- [j23]Alberto Pettorossi, Maurizio Proietti: Preface: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2. Fundam. Inform. 69(1-2) (2006)
- [c52]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. ICLP 2006: 179-195
- 2005
- [j22]Alberto Pettorossi, Maurizio Proietti: Program Transformation: Theoretical Foundations and Basic Techniques. Part 1. Fundam. Inform. 66(4) (2005)
- [j21]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi: Editorial. Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005)
- [j20]Alberto Pettorossi, Maurizio Proietti, Sophie Renault: Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism. Higher-Order and Symbolic Computation 18(1-2): 121-210 (2005)
- [c51]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs. Transformation Techniques in Software Engineering 2005
- [c50]Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Transformational Verification of Parameterized Protocols Using Array Formulas. LOPSTR 2005: 23-43
- 2004
- [j19]Alberto Pettorossi, Maurizio Proietti: Transformations of logic programs with goals as arguments. TPLP 4(4): 495-537 (2004)
- [c49]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Locally Stratified Constraint Logic Programs. Program Development in Computational Logic 2004: 291-339
- [c48]Alberto Pettorossi, Maurizio Proietti: A theory of totally correct logic program transformations. PEPM 2004: 159-168
- [i4]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Locally Stratified Constraint Logic Programs. CoRR cs.PL/0402048 (2004)
- 2003
- [j18]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi: Editorial: Special Issue Dedicated to Bob Paige. Higher-Order and Symbolic Computation 16(1-2): 5-6 (2003)
- [i3]Alberto Pettorossi, Maurizio Proietti: Transformations of Logic Programs with Goals as Arguments. CoRR cs.PL/0307022 (2003)
- [i2]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Combining Logic Programs and Monadic Second Order Logics by Program Transformation. CoRR cs.PL/0311043 (2003)
- [i1]Alberto Pettorossi, Maurizio Proietti, Sophie Renault: Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism. CoRR cs.PL/0311044 (2003)
- 2002
- [j17]Alberto Pettorossi, Maurizio Proietti: The List Introduction Strategy for the Derivation of Logic Programs. Formal Asp. Comput. 13(3-5): 233-251 (2002)
- [c47]Alberto Pettorossi, Maurizio Proietti: Program Derivation = Rules + Strategies. Computational Logic: Logic Programming and Beyond 2002: 273-309
- [c46]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Combining Logic Programs and Monadic Second Order Logics by Program Transformation. LOPSTR 2002: 160-181
- 2001
- [c45]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Verification of Sets of Infinite State Processes Using Program Transformation. LOPSTR 2001: 111-128
- [e2]Alberto Pettorossi (Ed.): Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers. Lecture Notes in Computer Science 2372, Springer 2001, ISBN 3-540-43915-3
- 2000
- [c44]Alberto Pettorossi, Maurizio Proietti: Perfect Model Checking via Unfold/Fold Transformations. Computational Logic 2000: 613-628
- [c43]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Automated strategies for specializing constraint logic programs. LOPSTR 2000
- [c42]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Automated Strategies for Specializing Constraint Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 125-146
1990 – 1999
- 1999
- [j16]Alberto Pettorossi, Maurizio Proietti: Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs. J. Log. Program. 41(2-3): 197-230 (1999)
- [j15]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Contextual Specialization of Constraint Logic Programs. Electr. Notes Theor. Comput. Sci. 30(2): 129-144 (1999)
- [c41]
- [c40]Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Logic Programs with Goals as Arguments. LOPSTR 1999: 176-195
- 1998
- [j14]Alberto Pettorossi, Maurizio Proietti: Program Specialization via Algorithmic Unfold/Fold Transformations. ACM Comput. Surv. 30(3es): 6 (1998)
- 1997
- [j13]Alberto Pettorossi, Maurizio Proietti: Future Directions in Program Transformation. SIGPLAN Notices 32(1): 99-102 (1997)
- [c39]Alberto Pettorossi, Maurizio Proietti: Program derivation via list introduction. Algorithmic Languages and Calculi 1997: 296-323
- [c38]Alberto Pettorossi, Maurizio Proietti, Sophie Renault: Reducing Nondeterminism while Specializing Logic Programs. POPL 1997: 414-427
- 1996
- [j12]Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Transforming Functional and Logic Programs. ACM Comput. Surv. 28(2): 360-414 (1996)
- [j11]Alberto Pettorossi, Maurizio Proietti: Future Directions in Program Transformation. ACM Comput. Surv. 28(4es): 171 (1996)
- [c37]Alberto Pettorossi, Maurizio Proietti: A Comparative Revisitation of Some Program Transformation Techniques. Dagstuhl Seminar on Partial Evaluation 1996: 355-385
- [c36]Alberto Pettorossi, Maurizio Proietti: A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties. Dagstuhl Seminar on Partial Evaluation 1996: 386-408
- [c35]Alberto Pettorossi, Maurizio Proietti, Sophie Renault: How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract). JICSLP 1996: 539
- [c34]Alberto Pettorossi, Maurizio Proietti, Sophie Renault: Enhancing Partial Deduction via Unfold/Fold Rules. LOPSTR 1996: 146-168
- 1995
- [j10]Maurizio Proietti, Alberto Pettorossi: Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. Theor. Comput. Sci. 142(1): 89-124 (1995)
- [c33]Kung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti: Correctness of Logic Program Transformations Based on Existential Termination. ILPS 1995: 480-494
- 1994
- [j9]Alberto Pettorossi, Maurizio Proietti: Transformation of Logic Programs: Foundations and Techniques. J. Log. Program. 19/20: 261-320 (1994)
- [c32]Maurizio Proietti, Alberto Pettorossi: Total correctness of a goal replacement rule based on the unfold/fold proof method. GULP-PRODE (1) 1994: 203-217
- [c31]Maurizio Proietti, Alberto Pettorossi: Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables. ICLP 1994: 714-729
- 1993
- [j8]Maurizio Proietti, Alberto Pettorossi: An Abstract Strategy for Transforming Logic Programs. Fundam. Inform. 18: 267-286 (1993)
- [j7]Maurizio Proietti, Alberto Pettorossi: The Loop Absorption and the Generalization Strategies for the Development of Logic Programs and Partial Deduction. J. Log. Program. 16(1): 123-161 (1993)
- [c30]Maurizio Proietti, Alberto Pettorossi: Completeness of some Transformation Strategies for Avoiding Unncecessary Logical Variables. GULP 1993: 601-616
- [c29]Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Program Transformation. Formal Program Development 1993: 263-304
- [c28]Maurizio Proietti, Alberto Pettorossi: Synthesis of Programs from Unfold/Fold Proofs. LOPSTR 1993: 141-158
- 1992
- [c27]Maurizio Proietti, Alberto Pettorossi: Best-first Strategies for Incremental Transformations of Logic Programs. LOPSTR 1992: 82-98
- [e1]Alberto Pettorossi (Ed.): Meta-Programming in Logic, 3rd International Workshop, META-92, Uppsala, Sweden, June 10-12, 1992, Proceedings. Lecture Notes in Computer Science 649, Springer 1992, ISBN 3-540-56282-6
- 1991
- [c26]Maurizio Proietti, Alberto Pettorossi: An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract). LOPSTR 1991: 126-128
- [c25]Maurizio Proietti, Alberto Pettorossi: Semantics Preserving Transformation Rules for Prolog. PEPM 1991: 274-284
- [c24]Maurizio Proietti, Alberto Pettorossi: Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. PLILP 1991: 347-358
- 1990
- [c23]Maurizio Proietti, Alberto Pettorossi: Synthesis of Eureka Predicates for Developing Logic Programs. ESOP 1990: 306-325
- [c22]Stefano Kasangian, Anna Labella, Alberto Pettorossi: Observers, Experiments and Agents: a Comprehensive Approach to Parallelism. Semantics of Systems of Concurrent Processes 1990: 375-406
1980 – 1989
- 1989
- [j6]Alberto Pettorossi, Andrzej Skowron: The Power of the Lambda Abstraction Strategy for Program Derivation. Elektronische Informationsverarbeitung und Kybernetik 25(5/6): 263-281 (1989)
- [c21]Alberto Pettorossi, Maurizio Proietti: Decidability Results and Characterization of Strategies for the Development of Logic Programs. ICLP 1989: 539-553
- 1987
- [j5]Alberto Pettorossi: Derivation of Efficient Programs for Computing Sequences of Actions. Theor. Comput. Sci. 53: 151-167 (1987)
- [c20]Stefano Kasangian, Anna Labella, Alberto Pettorossi: Enriched Categories for Local and Interaction Calculi. Category Theory and Computer Science 1987: 57-70
- [c19]
- [c18]Alberto Pettorossi, Zbigniew W. Ras, Maria Zemankova: On Learning with Imperfect Teachers. ISMIS 1987: 256-263
- [c17]Alberto Pettorossi, Andrzej Skowron: Higher Order Generalization in Program Derivation. TAPSOFT, Vol.2 1987: 182-196
- 1986
- [c16]Andrzej Skowron, Alberto Pettorossi: Factual Knowledge For Developing Concurrent Programs. AAAI 1986: 26-31
- [c15]Anna Labella, Alberto Pettorossi: Universal Models in Categories for Process Synchronization. Mathematical Models for the Semantics of Parallelism 1986: 183-198
- [c14]
- [c13]Alberto Pettorossi, Andrzej Skowron: Using Facts for Improving the Parallel Execution of Functional Programs. ICPP 1986: 616-623
- 1985
- [j4]Alberto Pettorossi: Towers of Hanoi Problems: Deriving Iterative Solutions by Program Transformations. BIT 25(2): 327-334 (1985)
- [j3]Alberto Pettorossi: A Note on Cohen's "Eliminating Redundant Recursive Calls". ACM Trans. Program. Lang. Syst. 7(4): 680-685 (1985)
- [c12]
- 1984
- [c11]Alberto Pettorossi: A Powerful Strategy for Deriving Efficient Programs by Transformation. LISP and Functional Programming 1984: 273-281
- [c10]Alberto Pettorossi, Andrzej Skowron: A methodology for improving parallel programs by adding communications. Symposium on Computation Theory 1984: 228-250
- 1982
- [j2]Alberto Pettorossi, Rod M. Burstall: Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. Acta Inf. 18: 181-206 (1982)
- [c9]Alberto Pettorossi, Andrzej Skowron: Communicating agents for applicative concurrent programming. Symposium on Programming 1982: 305-322
- 1981
- [c8]Alberto Pettorossi: A transformational approach for developing parallel programs. CONPAR 1981: 245-258
- [c7]Alberto Pettorossi: Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems. ICALP 1981: 432-447
- [c6]Alberto Pettorossi: An Approach to Communications and Parallelism in Applicative Languages. ICFPC 1981: 432-446
- 1980
- [j1]Alberto Pettorossi: 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. 11(4/5): 172-179 (1980)
- [c5]Alberto Pettorossi: Synthesis of subtree rewriting systems behaviour by solving equations. CLAAP 1980: 63-74
- [c4]Alberto Pettorossi: Towards a theory of parallelism and communications for increasing efficiency in applicative languages. Logic of Programs 1980: 224-249
1970 – 1979
- 1979
- [c3]Alberto Pettorossi: On the definition of hierarchies of infinite sequential computations. FCT 1979: 335-341
- 1978
- [c2]Alberto Pettorossi: Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract). MFCS 1978: 416-425
- 1975
- [c1]Carlo Batini, Alberto Pettorossi: On subrecursiveness in weak combinatory logic. Lambda-Calculus and Computer Science Theory 1975: 297-311
Coauthor Index
[j36] [j34] [c66] [j33] [j32] [j31] [c65] [c64] [j29] [c63] [c62] [c61] [c60] [i6] [j27] [c59] [c58] [c57] [c56] [i5] [j26] [c55] [j25] [j24] [c54] [c53] [j23] [c52] [j22] [j20] [c51] [c50] [j19] [c49] [c48] [i4] [i3] [i2] [i1] [j17] [c47] [c46] [c45] [c44] [c43] [c42] [j16] [j15] [c41] [c40] [j14] [j13] [c39] [c38] [j12] [j11] [c37] [c36] [c35] [c34] [j10] [c33] [j9] [c32] [c31] [j8] [j7] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c21]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:11 CEST by the dblp team