default search action
Alberto Pettorossi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c93]Alberto Pettorossi, Maurizio Proietti, Fabio Fioravanti, Emanuele De Angelis:
A Historical Perspective on Program Transformation and Recent Developments (Invited Contribution). PEPM 2024: 16-38 - [i19]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Catamorphic Abstractions for Constrained Horn Clause Satisfiability. CoRR abs/2408.06988 (2024) - 2023
- [c92]Emanuele De Angelis
, Fabio Fioravanti
Constrained Horn Clauses Satisfiability via Catamorphic Abstractions. LOPSTR 2023: 39-57 - [c91]Emanuele De Angelis
Multiple Query Satisfiability of Constrained Horn Clauses. PADL 2023: 125-143 - 2022
- [j55]Emanuele De Angelis
Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach. J. Log. Comput. 32(2): 402-442 (2022) - [j54]Emanuele De Angelis
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses. Theory Pract. Log. Program. 22(4): 555-572 (2022) - [j53]Emanuele De Angelis
Analysis and Transformation of Constrained Horn Clauses for Program Verification. Theory Pract. Log. Program. 22(6): 974-1042 (2022) - [c90]Emanuele De Angelis, Fabio Fioravanti
Contract Strengthening through Constrained Horn Clause Verification. HCVS/VPT@ETAPS 2022: 23-34 - [i18]Emanuele De Angelis, Fabio Fioravanti
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses. CoRR abs/2205.06236 (2022) - [i17]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Multiple Query Satisfiability of Constrained Horn Clauses. CoRR abs/2211.15207 (2022) - 2021
- [b2]Alberto Pettorossi:
Techniques for Searching, Parsing, and Matching. Springer 2021, ISBN 978-3-030-63188-8, pp. 1-310 - [i16]Emanuele De Angelis, Fabio Fioravanti, John P. Gallagher, Manuel V. Hermenegildo, Alberto Pettorossi, Maurizio Proietti:
Analysis and Transformation of Constrained Horn Clauses for Program Verification. CoRR abs/2108.00739 (2021) - [i15]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Satisfiability of Constrained Horn Clauses on Algebraic Data Types: A Transformation-based Approach. CoRR abs/2111.11819 (2021) - 2020
- [j52]Manuel V. Hermenegildo, Pedro López-García
Preface. Fundam. Informaticae 177(3-4) (2020) - [c89]Emanuele De Angelis
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates. IJCAR (1) 2020: 83-102 - [c88]Alberto Pettorossi:
A Historical Account of My Early Research Interests. VPT/HCVS@ETAPS 2020: 1-28 - [i14]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates. CoRR abs/2004.07749 (2020)
2010 – 2019
- 2019
- [j51]Emanuele De Angelis
Semantics and Controllability of Time-Aware Business Processes. Fundam. Informaticae 165(3-4): 205-244 (2019) - [j50]Emanuele De Angelis, Fabio Fioravanti
Solving Horn Clauses on Inductive Data Types Without Induction - ERRATUM. Theory Pract. Log. Program. 19(4): 629 (2019) - [c87]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification. CILC 2019 - [c86]Emanuele De Angelis
Property-Based Test Case Generators for Free. TAP@FM 2019: 186-206 - [c85]Emanuele De Angelis
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study. VPT@Programming 2019: 4-18 - [c84]Emanuele De Angelis
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification. HCVS/PERR@ETAPS 2019: 48-75 - 2018
- [j49]Marco Maratea, Viviana Mascardi, Davide Ancona, Alberto Pettorossi:
Preface. Fundam. Informaticae 159(1-2): v-vi (2018) - [j48]Camillo Fiorentini
Preface. Fundam. Informaticae 161(1-2): v-vii (2018) - [j47]Emanuele De Angelis
Predicate Pairing for program verification. Theory Pract. Log. Program. 18(2): 126-166 (2018) - [j46]Emanuele De Angelis
Solving Horn Clauses on Inductive Data Types Without Induction. Theory Pract. Log. Program. 18(3-4): 452-469 (2018) - [c83]Emanuele De Angelis
Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs. HCVS 2018: 19-26 - [i13]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Solving Horn Clauses on Inductive Data Types Without Induction. CoRR abs/1804.09007 (2018) - 2017
- [j45]Emanuele De Angelis
Program Verification using Constraint Handling Rules and Array Constraint Generalizations. Fundam. Informaticae 150(1): 73-117 (2017) - [j44]Laura Giordano
Preface. Fundam. Informaticae 150(1): v-vi (2017) - [j43]Emanuele De Angelis
Semantics-based generation of verification conditions via program specialization. Sci. Comput. Program. 147: 78-108 (2017) - [c82]Emanuele De Angelis
Predicate Pairing with Abstraction for Relational Verification. LOPSTR 2017: 289-305 - [c81]Emanuele De Angelis
Verifying Controllability of Time-Aware Business Processes. RuleML+RR 2017: 103-118 - [i12]Alberto Pettorossi, Maurizio Proietti:
Regularity of non context-free languages over a singleton terminal alphabet. CoRR abs/1705.09695 (2017) - [i11]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Predicate Pairing for Program Verification. CoRR abs/1708.01473 (2017) - [i10]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Enhancing Predicate Pairing with Abstraction for Relational Verification. CoRR abs/1709.04809 (2017) - 2016
- [c80]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verifying Relational Program Properties by Transforming Constrained Horn clauses. CILC 2016: 69-85 - [c79]Emanuele De Angelis
Verification of Time-Aware Business Processes Using Constrained Horn Clauses. LOPSTR 2016: 38-55 - [c78]Emanuele De Angelis
Relational Verification Through Horn Clause Transformation. SAS 2016: 147-169 - [c77]Emanuele De Angelis
Removing Unnecessary Variables from Horn Clause Verification Conditions. HCVS@ETAPS 2016: 49-55 - [i9]Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti:
Verification of Time-Aware Business Processes using Constrained Horn Clauses. CoRR abs/1608.02807 (2016) - 2015
- [j42]Emanuele De Angelis
A Rule-based Verification Strategy for Array Manipulating Programs. Fundam. Informaticae 140(3-4): 329-355 (2015) - [j41]Emanuele De Angelis
Proving correctness of imperative programs by linearizing constrained Horn clauses. Theory Pract. Log. Program. 15(4-5): 635-650 (2015) - [c76]Emanuele De Angelis
Semantics-based generation of verification conditions by program specialization. PPDP 2015: 91-102 - [e3]Alexei Lisitsa, Andrei P. Nemytykh, Alberto Pettorossi
Proceedings of the Third International Workshop on Verification and Program Transformation, VPT@ETAPS 2015, London, United Kingdom, 11th April 2015. EPTCS 199, 2015 [contents] - [i8]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Proving Correctness of Imperative Programs by Linearizing Constrained Horn Clauses. CoRR abs/1507.05877 (2015) - 2014
- [j40]Emanuele De Angelis
Program verification via iterated specialization. Sci. Comput. Program. 95: 149-175 (2014) - [c75]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Program Verification using Constraint Handling Rules and Array Constraint Generalizations. VPT@CAV 2014: 3-18 - [c74]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Program Verification using Constraint Handling Rules and Array Constraint Generalizations. CILC 2014: 114-131 - [c73]Emanuele De Angelis
VeriMAP: A Tool for Verifying Programs through Transformations. TACAS 2014: 568-574 - [c72]Emanuele De Angelis
Verifying Array Programs by Transforming Verification Conditions. VMCAI 2014: 182-202 - 2013
- [j39]Fabio Fioravanti
Controlling Polyvariance for Specialization-based Verification. Fundam. Informaticae 124(4): 483-502 (2013) - [j38]Fabio Fioravanti
Preface. Fundam. Informaticae 124(4): i-ii (2013) - [j37]Fabio Fioravanti
Proving Theorems by Program Transformation. Fundam. Informaticae 127(1-4): 115-134 (2013) - [j36]Fabio Fioravanti
Generalization strategies for the verification of infinite state systems. Theory Pract. Log. Program. 13(2): 175-199 (2013) - [c71]Alberto Pettorossi, Maurizio Proietti:
Program Transformation for Program Verification. VPT@CAV 2013: 13-14 - [c70]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Imperative Programs through Transformation of Constraint Logic Programs. VPT@CAV 2013: 30-41 - [c69]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Imperative Programs by Transforming Constraint Logic Programs. CILC 2013: 83-98 - [c68]Emanuele De Angelis
Verifying programs via iterated specialization. PEPM 2013: 43-52 - [c67]Emanuele De Angelis
Verification of Imperative Programs by Constraint Logic Program Transformation. Festschrift for Dave Schmidt 2013: 186-210 - 2012
- [j35]Alberto Pettorossi
Constraint-based correctness proofs for logic program transformations. Formal Aspects Comput. 24(4-6): 569-594 (2012) - [j34]Fabio Fioravanti
Improving Reachability Analysis of Infinite State Systems by Specialization. Fundam. Informaticae 119(3-4): 281-300 (2012) - [j33]Emanuele De Angelis
Synthesizing Concurrent Programs Using Answer Set Programming. Fundam. Informaticae 120(3-4): 205-229 (2012) - [c66]Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti, Alberto Pettorossi:
Software Model Checking by Program Specialization. CILC 2012: 89-103 - [c65]Emanuele De Angelis
Specialization with Constrained Generalization for Software Model Checking. LOPSTR 2012: 51-70 - 2011
- [j32]Marco Gavanelli
RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Fundam. Informaticae 107(2-3) (2011) - [j31]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Program transformation for development, verification, and synthesis of programs. Intelligenza Artificiale 5(1): 119-125 (2011) - [c64]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Controlling Polyvariance for Specialization-based Verification. CILC 2011: 179-197 - [c63]Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti:
Synthesizing Concurrent Programs using Answer Set Programming. CILC 2011: 245-259 - [c62]Fabio Fioravanti
Using Real Relaxations during Program Specialization. LOPSTR 2011: 106-122 - [c61]Fabio Fioravanti
Improving Reachability Analysis of Infinite State Systems by Specialization. RP 2011: 165-179 - [i7]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Generalization Strategies for the Verification of Infinite State Systems. CoRR abs/1110.0999 (2011) - 2010
- [j30]Marco Gavanelli
Preface. Fundam. Informaticae 105(1-2) (2010) - [j29]Alberto Pettorossi
Transformations of logic programs on infinite lists. Theory Pract. Log. Program. 10(4-6): 383-399 (2010) - [c60]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Generalization Strategies for the Verification of Infinite State Systems. CILC 2010 - [c59]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
A Transformation Strategy for Verifying Logic Programs on Infinite Lists. CILC 2010 - [c58]Fabio Fioravanti
Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation. LOPSTR 2010: 164-183 - [p2]Alberto Pettorossi
The Transformational Approach to Program Development. 25 Years GULP 2010: 112-135 - [i6]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Transformations of Logic Programs on Infinite Lists. CoRR abs/1007.4157 (2010)
2000 – 2009
- 2009
- [j28]Valerio Senni
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs. Fundam. Informaticae 96(3): 373-393 (2009) - [c57]Alberto Pettorossi
Deciding Full Branching Time Logic by Program Transformation. LOPSTR 2009: 5-21 - 2008
- [j27]Alberto Pettorossi
Totally correct logic program transformations via well-founded annotations. High. Order Symb. Comput. 21(1-2): 193-234 (2008) - [j26]Alberto Pettorossi
Totally correct logic program transformations via well-founded annotations. High. Order Symb. Comput. 21(1-2): 235 (2008) - [c56]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Program Transformation for Development, Verification, and Synthesis of Software. Il Milione 2008 - [c55]Valerio Senni
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs. ICLP 2008: 284-300 - 2007
- [c54]Alberto Pettorossi, Maurizio Proietti, Valerio Senni
Automatic Correctness Proofs for Logic Program Transformations. ICLP 2007: 364-379 - 2006
- [j25]Alberto Pettorossi, Maurizio Proietti:
Preface: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2. Fundam. Informaticae 69(1-2) (2006) - [c53]Alberto Pettorossi, Maurizio Proietti, Valerio Senni
Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. ICLP 2006: 179-195 - 2005
- [j24]Alberto Pettorossi, Maurizio Proietti:
Program Transformation: Theoretical Foundations and Basic Techniques. Part 1. Fundam. Informaticae 66(4) (2005) - [j23]Olivier Danvy
Editorial. High. Order Symb. Comput. 18(1-2): 5-6 (2005) - [j22]Alberto Pettorossi
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism. High. Order Symb. Comput. 18(1-2): 121-210 (2005) - [c52]Alberto Pettorossi
Transformational Verification of Parameterized Protocols Using Array Formulas. LOPSTR 2005: 23-43 - [i5]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs. Transformation Techniques in Software Engineering 2005 - 2004
- [j21]Alberto Pettorossi
Transformations of logic programs with goals as arguments. Theory Pract. Log. Program. 4(4): 495-537 (2004) - [c51]Fabio Fioravanti
Automatic Proofs of Protocols via Program Transformation. MSRAS 2004: 99-116 - [c50]Alberto Pettorossi, Maurizio Proietti:
A theory of totally correct logic program transformations. PEPM 2004: 159-168 - [p1]Fabio Fioravanti
Transformation Rules for Locally Stratified Constraint Logic Programs. Program Development in Computational Logic 2004: 291-339 - [i4]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Transformation Rules for Locally Stratified Constraint Logic Programs. CoRR cs.PL/0402048 (2004) - 2003
- [j20]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi:
Editorial: Special Issue Dedicated to Bob Paige. High. Order Symb. Comput. 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
- [j19]Alberto Pettorossi
The List Introduction Strategy for the Derivation of Logic Programs. Formal Aspects Comput. 13(3-5): 233-251 (2002) - [c49]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Specialization with Clause Splitting for Deriving Deterministic Constraint Logic Programs. APPIA-GULP-PRODE 2002: 241-257 - [c48]Alberto Pettorossi, Maurizio Proietti:
Program Derivation = Rules + Strategies. Computational Logic: Logic Programming and Beyond 2002: 273-309 - [c47]Fabio Fioravanti
Combining Logic Programs and Monadic Second Order Logics by Program Transformation. LOPSTR 2002: 160-181 - 2001
- [c46]Fabio Fioravanti
Verification of Sets of Infinite State Processes Using Program Transformation. LOPSTR 2001: 111-128 - [e2]Alberto Pettorossi:
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 [contents] - 2000
- [c45]Alberto Pettorossi, Maurizio Proietti:
Perfect Model Checking via Unfold/Fold Transformations. Computational Logic 2000: 613-628 - [c44]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Automated strategies for specializing constraint logic programs. LOPSTR 2000 - [c43]Fabio Fioravanti
Automated Strategies for Specializing Constraint Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 125-146
1990 – 1999
- 1999
- [j18]Alberto Pettorossi
Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs. J. Log. Program. 41(2-3): 197-230 (1999) - [c42]Maurizio Proietti, Alberto Pettorossi:
Transforming Inductive Definitions. ICLP 1999: 486-499 - [c41]Alberto Pettorossi, Maurizio Proietti:
Transformation Rules for Logic Programs with Goals as Arguments. LOPSTR 1999: 176-195 - [c40]Fabio Fioravanti
Rules and Strategies for Contextual Specialization of Constraint Logic Programs. WOID@ICLP 1999: 129-144 - 1998
- [j17]Alberto Pettorossi
Program Specialization via Algorithmic Unfold/Fold Transformations. ACM Comput. Surv. 30(3es): 6 (1998) - 1997
- [j16]Alberto Pettorossi
Future Directions in Program Transformation. ACM 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
- [j15]Alberto Pettorossi, Maurizio Proietti:
Rules and Strategies for Transforming Functional and Logic Programs. ACM Comput. Surv. 28(2): 360-414 (1996) - [j14]Alberto Pettorossi
Future Directions in Program Transformation. ACM Comput. Surv. 28(4es): 171 (1996) - [j13]Alberto Pettorossi, Maurizio Proietti:
Developing correct and efficient logic programs by transformation. Knowl. Eng. Rev. 11(4): 347-360 (1996) - [c37]Alberto Pettorossi
A Comparative Revisitation of Some Program Transformation Techniques. Dagstuhl Seminar on Partial Evaluation 1996: 355-385 - [c36]Alberto Pettorossi
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
- [j12]Maurizio Proietti
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
- [j11]Alberto Pettorossi
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
- [j10]Maurizio Proietti, Alberto Pettorossi:
An Abstract Strategy for Transforming Logic Programs. Fundam. Informaticae 18: 267-286 (1993) - [j9]Maurizio Proietti
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:
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 [contents] - 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
- [j8]Alberto Pettorossi, Andrzej Skowron:
The Power of the Lambda Abstraction Strategy for Program Derivation. J. Inf. Process. Cybern. 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
- [j7]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]Alberto Pettorossi
Program Development Using Lambda Abstraction. FSTTCS 1987: 420-434 - [c18]Alberto Pettorossi, Zbigniew W. Ras, Maria Zemankova:
On Learning with Imperfect Teachers. ISMIS 1987: 256-263 - [c17]Alberto Pettorossi
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]Alberto Pettorossi
Transformation Strategies for Deriving On Line Programs. CAAP 1986: 127-141 - [c13]Alberto Pettorossi, Andrzej Skowron:
Using Facts for Improving the Parallel Execution of Functional Programs. ICPP 1986: 616-623 - 1985
- [j6]Alberto Pettorossi
Towers of Hanoi Problems: Deriving Iterative Solutions by Program Transformations. BIT 25(2): 327-334 (1985) - [j5]Alberto Pettorossi:
A Note on Cohen's "Eliminating Redundant Recursive Calls". ACM Trans. Program. Lang. Syst. 7(4): 680-685 (1985) - [c12]Anna Labella, Alberto Pettorossi
Categorical Models of Process Cooperation. CTCS 1985: 282-298 - 1984
- [b1]Alberto Pettorossi:
Methodologies for transformations and memoing in applicative languages. University of Edinburgh, UK, 1984 - [j4]Alberto Pettorossi
Higher-order communications for concurrent programming. Parallel Comput. 1(3-4): 331-336 (1984) - [c11]Alberto Pettorossi:
A Powerful Strategy for Deriving Efficient Programs by Transformation. LISP and Functional Programming 1984: 273-281 - [c10]Alberto Pettorossi
A methodology for improving parallel programs by adding communications. Symposium on Computation Theory 1984: 228-250 - 1982
- [j3]Alberto Pettorossi
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. Acta Informatica 18: 181-206 (1982) - [c9]Alberto Pettorossi
Communicating agents for applicative concurrent programming. Symposium on Programming 1982: 305-322 - 1981
- [j2]Alberto Pettorossi
A property which guarantees termination in weak combinatory logic and subtree replacement systems. Notre Dame J. Formal Log. 22(4): 344-356 (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
[c93] [i19] [c92] [c91] [j55] [j54] [j53] [c90] [i18] [i17] [i16] [i15] [c89] [i14] [j51] [j50] [c87] [c86] [c85] [c84] [j47] [j46] [c83] [i13] [j45] [j43] [c82] [c81] [i11] [i10] [c80] [c79] [c78] [c77] [i9] [j42] [j41] [c76] [i8] [j40] [c75] [c74] [c73] [c72] [c70] [c69] [c68] [c67] [j33] [c66] [c65] [c63]
[c93] [i19] [c92] [c91] [j55] [j54] [j53] [c90] [i18] [i17] [i16] [i15] [c89] [i14] [j51] [j50] [c87] [c86] [c85] [c84] [j47] [j46] [c83] [i13] [j45] [j43] [c82] [c81] [i11] [i10] [c80] [c79] [c78] [c77] [i9] [j42] [j41] [c76] [i8] [j40] [c75] [c74] [c73] [c72] [j39] [j38] [j37] [j36] [c70] [c69] [c68] [c67] [j34] [c66] [c65] [j31] [c64] [c62] [c61] [i7] [c60] [c58] [c51] [p1] [i4] [i2] [c49] [c47] [c46] [c44] [c43] [c40]
[c93] [i19] [c92] [c91] [j55] [j54] [j53] [c90] [i18] [i17] [i16] [i15] [j52] [c89] [i14] [j51] [j50] [c87] [c86] [c85] [c84] [j47] [j46] [c83] [i13] [j45] [j43] [c82] [c81] [i12] [i11] [i10] [c80] [c79] [c78] [c77] [i9] [j42] [j41] [c76] [i8] [j40] [c75] [c74] [c73] [c72] [j39] [j37] [j36] [c71] [c70] [c69] [c68] [c67] [j35] [j34] [j33] [c66] [c65] [j31] [c64] [c63] [c62] [c61] [i7] [j29] [c60] [c59] [c58] [p2] [i6] [j28] [c57] [j27] [j26] [c56] [c55] [c54] [j25] [c53] [j24] [j22] [c52] [i5] [j21] [c51] [c50] [p1] [i4] [i3] [i2] [i1] [j19] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [j18] [c42] [c41] [c40] [j17] [j16] [c39] [c38] [j15] [j14] [j13] [c37] [c36] [c35] [c34] [j12] [c33] [j11] [c32] [c31] [j10] [j9] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c21]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: