dblp.uni-trier.dewww.uni-trier.de

Alberto Pettorossi Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
84EEValerio Senni, Alberto Pettorossi, Maurizio Proietti: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs. ICLP 2008: 284-300
83EEAlberto Pettorossi, Maurizio Proietti: Totally correct logic program transformations via well-founded annotations. Higher-Order and Symbolic Computation 21(1-2): 193-234 (2008)
82EEAlberto Pettorossi, Maurizio Proietti: Totally correct logic program transformations via well-founded annotations. Higher-Order and Symbolic Computation 21(1-2): 235 (2008)
2007
81EEAlberto Pettorossi, Maurizio Proietti, Valerio Senni: Automatic Correctness Proofs for Logic Program Transformations. ICLP 2007: 364-379
2006
80EEAlberto Pettorossi, Maurizio Proietti, Valerio Senni: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. ICLP 2006: 179-195
79EEAlberto Pettorossi, Maurizio Proietti: Preface: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2. Fundam. Inform. 69(1-2): (2006)
2005
78EEAlberto Pettorossi, Maurizio Proietti, Valerio Senni: Transformational Verification of Parameterized Protocols Using Array Formulas. LOPSTR 2005: 23-43
77EEAlberto Pettorossi, Maurizio Proietti, Valerio Senni: Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs. Transformation Techniques in Software Engineering 2005
76EEAlberto Pettorossi, Maurizio Proietti: Program Transformation: Theoretical Foundations and Basic Techniques. Part 1. Fundam. Inform. 66(4): (2005)
75EEAlberto 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)
74EEOlivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi: Editorial. Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005)
2004
73EEAlberto Pettorossi, Maurizio Proietti: A theory of totally correct logic program transformations. PEPM 2004: 159-168
72EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Locally Stratified Constraint Logic Programs. Program Development in Computational Logic 2004: 291-339
71EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Locally Stratified Constraint Logic Programs CoRR cs.PL/0402048: (2004)
70 Alberto Pettorossi, Maurizio Proietti: Transformations of logic programs with goals as arguments. TPLP 4(4): 495-537 (2004)
2003
69EEAlberto Pettorossi, Maurizio Proietti: Transformations of Logic Programs with Goals as Arguments CoRR cs.PL/0307022: (2003)
68EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Combining Logic Programs and Monadic Second Order Logics by Program Transformation CoRR cs.PL/0311043: (2003)
67EEAlberto Pettorossi, Maurizio Proietti, Sophie Renault: Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism CoRR cs.PL/0311044: (2003)
66EEOlivier 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)
2002
65EEAlberto Pettorossi, Maurizio Proietti: Program Derivation = Rules + Strategies. Computational Logic: Logic Programming and Beyond 2002: 273-309
64EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Combining Logic Programs and Monadic Second Order Logics by Program Transformation. LOPSTR 2002: 160-181
63EEAlberto Pettorossi, Maurizio Proietti: The List Introduction Strategy for the Derivation of Logic Programs. Formal Asp. Comput. 13(3-5): 233-251 (2002)
2001
62 Alberto Pettorossi: Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers Springer 2001
61EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Verification of Sets of Infinite State Processes Using Program Transformation. LOPSTR 2001: 111-128
2000
60EEAlberto Pettorossi, Maurizio Proietti: Perfect Model Checking via Unfold/Fold Transformations. Computational Logic 2000: 613-628
59EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Automated strategies for specializing constraint logic programs. LOPSTR 2000
58EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Automated Strategies for Specializing Constraint Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 125-146
1999
57 Maurizio Proietti, Alberto Pettorossi: Transforming Inductive Definitions. ICLP 1999: 486-499
56 Alberto Pettorossi, Maurizio Proietti: Transformation Rules for Logic Programs with Goals as Arguments. LOPSTR 1999: 176-195
55EEFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Contextual Specialization of Constraint Logic Programs. Electr. Notes Theor. Comput. Sci. 30(2): (1999)
54 Alberto Pettorossi, Maurizio Proietti: Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs. J. Log. Program. 41(2-3): 197-230 (1999)
1998
53EEAlberto Pettorossi, Maurizio Proietti: Program Specialization via Algorithmic Unfold/Fold Transformations. ACM Comput. Surv. 30(3es): 6 (1998)
1997
52 Alberto Pettorossi, Maurizio Proietti: Program derivation via list introduction. Algorithmic Languages and Calculi 1997: 296-323
51EEAlberto Pettorossi, Maurizio Proietti, Sophie Renault: Reducing Nondeterminism while Specializing Logic Programs. POPL 1997: 414-427
50 Alberto Pettorossi, Maurizio Proietti: Future Directions in Program Transformation. SIGPLAN Notices 32(1): 99-102 (1997)
1996
49 Alberto Pettorossi, Maurizio Proietti: A Comparative Revisitation of Some Program Transformation Techniques. Dagstuhl Seminar on Partial Evaluation 1996: 355-385
48 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
47 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
46 Alberto Pettorossi, Maurizio Proietti, Sophie Renault: Enhancing Partial Deduction via Unfold/Fold Rules. LOPSTR 1996: 146-168
45 Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Transforming Functional and Logic Programs. ACM Comput. Surv. 28(2): 360-414 (1996)
44 Alberto Pettorossi, Maurizio Proietti: Future Directions in Program Transformation. ACM Comput. Surv. 28(4es): 171 (1996)
1995
43 Kung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti: Correctness of Logic Program Transformations Based on Existential Termination. ILPS 1995: 480-494
42EEMaurizio Proietti, Alberto Pettorossi: Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. Theor. Comput. Sci. 142(1): 89-124 (1995)
1994
41 Maurizio Proietti, Alberto Pettorossi: Total correctness of a goal replacement rule based on the unfold/fold proof method. GULP-PRODE (1) 1994: 203-217
40 Maurizio Proietti, Alberto Pettorossi: Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables. ICLP 1994: 714-729
39 Alberto Pettorossi, Maurizio Proietti: Transformation of Logic Programs: Foundations and Techniques. J. Log. Program. 19/20: 261-320 (1994)
1993
38 Alberto Pettorossi, Maurizio Proietti: Rules and Strategies for Program Transformation. Formal Program Development 1993: 263-304
37 Maurizio Proietti, Alberto Pettorossi: Completeness of some Transformation Strategies for Avoiding Unncecessary Logical Variables. GULP 1993: 601-616
36 Maurizio Proietti, Alberto Pettorossi: Synthesis of Programs from Unfold/Fold Proofs. LOPSTR 1993: 141-158
35 Maurizio Proietti, Alberto Pettorossi: An Abstract Strategy for Transforming Logic Programs. Fundam. Inform. 18: 267-286 (1993)
34 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)
1992
33 Alberto Pettorossi: Meta-Programming in Logic, 3rd International Workshop, META-92, Uppsala, Sweden, June 10-12, 1992, Proceedings Springer 1992
32 Maurizio Proietti, Alberto Pettorossi: Best-first Strategies for Incremental Transformations of Logic Programs. LOPSTR 1992: 82-98
1991
31 Maurizio Proietti, Alberto Pettorossi: An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract). LOPSTR 1991: 126-128
30 Maurizio Proietti, Alberto Pettorossi: Semantics Preserving Transformation Rules for Prolog. PEPM 1991: 274-284
29EEMaurizio Proietti, Alberto Pettorossi: Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. PLILP 1991: 347-358
1990
28EEMaurizio Proietti, Alberto Pettorossi: Synthesis of Eureka Predicates for Developing Logic Programs. ESOP 1990: 306-325
27EEStefano Kasangian, Anna Labella, Alberto Pettorossi: Observers, Experiments and Agents: a Comprehensive Approach to Parallelism. Semantics of Systems of Concurrent Processes 1990: 375-406
1989
26 Alberto Pettorossi, Maurizio Proietti: Decidability Results and Characterization of Strategies for the Development of Logic Programs. ICLP 1989: 539-553
25 Alberto Pettorossi, Andrzej Skowron: The Power of the Lambda Abstraction Strategy for Program Derivation. Elektronische Informationsverarbeitung und Kybernetik 25(5/6): 263-281 (1989)
1987
24 Stefano Kasangian, Anna Labella, Alberto Pettorossi: Enriched Categories for Local and Interaction Calculi. Category Theory and Computer Science 1987: 57-70
23EEAlberto Pettorossi: Program Development Using Lambda Abstraction. FSTTCS 1987: 420-434
22 Alberto Pettorossi, Zbigniew W. Ras, Maria Zemankova: On Learning with Imperfect Teachers. ISMIS 1987: 256-263
21EEAlberto Pettorossi, Andrzej Skowron: Higher Order Generalization in Program Derivation. TAPSOFT, Vol.2 1987: 182-196
20 Alberto Pettorossi: Derivation of Efficient Programs for Computing Sequences of Actions. Theor. Comput. Sci. 53: 151-167 (1987)
1986
19 Andrzej Skowron, Alberto Pettorossi: Factual Knowledge For Developing Concurrent Programs. AAAI 1986: 26-31
18EEAlberto Pettorossi: Transformation Strategies for Deriving On Line Programs. CAAP 1986: 127-141
17 Alberto Pettorossi, Andrzej Skowron: Using Facts for Improving the Parallel Execution of Functional Programs. ICPP 1986: 616-623
16 Anna Labella, Alberto Pettorossi: Universal Models in Categories for Process Synchronization. Mathematical Models for the Semantics of Parallelism 1986: 183-198
1985
15 Anna Labella, Alberto Pettorossi: Categorical Models of Process Cooperation. CTCS 1985: 282-298
14EEAlberto Pettorossi: A Note on Cohen's "Eliminating Redundant Recursive Calls". ACM Trans. Program. Lang. Syst. 7(4): 680-685 (1985)
13 Alberto Pettorossi: Towers of Hanoi Problems: Deriving Iterative Solutions by Program Transformations. BIT 25(2): 327-334 (1985)
1984
12 Alberto Pettorossi: A Powerful Strategy for Deriving Efficient Programs by Transformation. LISP and Functional Programming 1984: 273-281
1982
11 Alberto Pettorossi, Andrzej Skowron: Communicating agents for applicative concurrent programming. Symposium on Programming 1982: 305-322
10 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)
1981
9EEAlberto Pettorossi: A transformational approach for developing parallel programs. CONPAR 1981: 245-258
8EEAlberto 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
7 Alberto Pettorossi: An Approach to Communications and Parallelism in Applicative Languages. ICFPC 1981: 432-446
1980
6 Alberto Pettorossi: Synthesis of subtree rewriting systems behaviour by solving equations. CLAAP 1980: 63-74
5 Alberto Pettorossi: Towards a theory of parallelism and communications for increasing efficiency in applicative languages. Logic of Programs 1980: 224-249
4 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)
1979
3 Alberto Pettorossi: On the definition of hierarchies of infinite sequential computations. FCT 1979: 335-341
1978
2EEAlberto Pettorossi: Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract). MFCS 1978: 416-425
1975
1 Carlo Batini, Alberto Pettorossi: On subrecursiveness in weak combinatory logic. Lambda-Calculus and Computer Science Theory 1975: 297-311

Coauthor Index

1Carlo Batini [1]
2Rod M. Burstall [10]
3Olivier Danvy [66] [74]
4Fabio Fioravanti [55] [58] [59] [61] [64] [68] [71] [72]
5Fritz Henglein [66] [74]
6Stefano Kasangian [24] [27]
7Anna Labella [15] [16] [24] [27]
8Kung-Kiu Lau [43]
9Harry G. Mairson [66] [74]
10Mario Ornaghi [43]
11Maurizio Proietti [26] [28] [29] [30] [31] [32] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [63] [64] [65] [67] [68] [69] [70] [71] [72] [73] [75] [76] [77] [78] [79] [80] [81] [82] [83] [84]
12Zbigniew W. Ras [22]
13Sophie Renault [46] [47] [51] [67] [75]
14Valerio Senni [77] [78] [80] [81] [84]
15Andrzej Skowron [11] [17] [19] [21] [25]
16Maria Zemankova [22]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)