default search action
Maurizio Proietti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Maurizio Proietti, Alicia Villanueva:
Preface. Fundam. Informaticae 192(2) (2024) - [c95]Emanuele De Angelis, Maurizio Proietti, Francesca Toni:
Learning Brave Assumption-Based Argumentation Frameworks via ASP. ECAI 2024: 3445-3452 - [c94]Alberto Pettorossi, Maurizio Proietti, Fabio Fioravanti, Emanuele De Angelis:
A Historical Perspective on Program Transformation and Recent Developments (Invited Contribution). PEPM 2024: 16-38 - [e5]Emanuele De Angelis, Maurizio Proietti:
Proceedings of the 39th Italian Conference on Computational Logic, Rome, Italy, June 26-28, 2024. CEUR Workshop Proceedings 3733, CEUR-WS.org 2024 [contents] - [i22]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Catamorphic Abstractions for Constrained Horn Clause Satisfiability. CoRR abs/2408.06988 (2024) - [i21]Emanuele De Angelis, Maurizio Proietti, Francesca Toni:
Learning Brave Assumption-Based Argumentation Frameworks via ASP. CoRR abs/2408.10126 (2024) - 2023
- [j46]Emanuele De Angelis, Guglielmo De Angelis, Alessandro Pellegrini, Maurizio Proietti:
What makes test programs similar in microservices applications? J. Syst. Softw. 201: 111674 (2023) - [c93]Cristina Tirsi, Maurizio Proietti, Francesca Toni:
ABALearn: An Automated Logic-Based Learning System for ABA Frameworks. AI*IA 2023: 3-16 - [c92]Emanuele De Angelis, Guglielmo De Angelis, Maurizio Proietti:
A Classification Study on Testing and Verification of AI-based Systems. AITest 2023: 1-8 - [c91]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Constrained Horn Clauses Satisfiability via Catamorphic Abstractions. LOPSTR 2023: 39-57 - [c90]Maurizio Proietti, Francesca Toni:
A Roadmap for Neuro-argumentative Learning. NeSy 2023: 1-8 - [c89]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Multiple Query Satisfiability of Constrained Horn Clauses. PADL 2023: 125-143 - [c88]Emanuele De Angelis, Maurizio Proietti, Francesca Toni:
ABA Learning via ASP. ICLP 2023: 1-8 - [i20]Maurizio Proietti, Francesca Toni:
Learning Assumption-based Argumentation Frameworks. CoRR abs/2305.15921 (2023) - 2022
- [j45]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach. J. Log. Comput. 32(2): 402-442 (2022) - [j44]Emanuele De Angelis, Maurizio Proietti, Fabio Fioravanti, Alberto Pettorossi:
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses. Theory Pract. Log. Program. 22(4): 555-572 (2022) - [j43]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. Theory Pract. Log. Program. 22(6): 974-1042 (2022) - [c87]Maurizio Proietti, Francesca Toni:
Learning Assumption-Based Argumentation Frameworks. ILP 2022: 100-116 - [c86]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Contract Strengthening through Constrained Horn Clause Verification. HCVS/VPT@ETAPS 2022: 23-34 - [p3]Maurizio Proietti, Francesco Taglino, Fabrizio Smith:
QuBPAL: Querying Business Process Knowledge. Process Querying Methods 2022: 255-284 - [e4]Geoffrey William Hamilton, Temesghen Kahsai, Maurizio Proietti:
Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation, HCVS/VPT@ETAPS 2022, and 10th International Workshop on Verification and Program TransformationMunich, Germany, 3rd April 2022. EPTCS 373, 2022 [contents] - [i19]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses. CoRR abs/2205.06236 (2022) - [i18]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Multiple Query Satisfiability of Constrained Horn Clauses. CoRR abs/2211.15207 (2022) - 2021
- [j42]Paolo Felli, Marco Montali, Maurizio Proietti:
Preface. Fundam. Informaticae 178(4) (2021) - [j41]Alberto Casagrande, Eugenio G. Omodeo, Maurizio Proietti:
Preface. Fundam. Informaticae 181(1) (2021) - [c85]Emanuele De Angelis, Alessandro Pellegrini, Maurizio Proietti:
Automatic Extraction of Behavioral Features for Test Program Similarity Analysis. ISSRE Workshops 2021: 129-136 - [c84]Emanuele De Angelis, Guglielmo De Angelis, Alessandro Pellegrini, Maurizio Proietti:
Inferring Relations Among Test Programs in Microservices Applications. SOSE 2021: 114-123 - [i17]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) - [i16]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
- [j40]Fabio Fioravanti, John P. Gallagher, Maurizio Proietti:
Preface. Fundam. Informaticae 173(4) (2020) - [j39]Manuel V. Hermenegildo, Pedro López-García, Alberto Pettorossi, Maurizio Proietti:
Preface. Fundam. Informaticae 177(3-4) (2020) - [c83]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates. IJCAR (1) 2020: 83-102 - [c82]Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti:
Transformational Verification of Quicksort. VPT/HCVS@ETAPS 2020: 95-109 - [i15]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
- [j38]Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti:
Semantics and Controllability of Time-Aware Business Processes. Fundam. Informaticae 165(3-4): 205-244 (2019) - [j37]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Solving Horn Clauses on Inductive Data Types Without Induction - ERRATUM. Theory Pract. Log. Program. 19(4): 629 (2019) - [c81]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification. CILC 2019 - [c80]Emanuele De Angelis, Fabio Fioravanti, Adrián Palacios, Alberto Pettorossi, Maurizio Proietti:
Property-Based Test Case Generators for Free. TAP@FM 2019: 186-206 - [c79]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study. VPT@Programming 2019: 4-18 - [c78]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification. HCVS/PERR@ETAPS 2019: 48-75 - 2018
- [j36]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Predicate Pairing for program verification. Theory Pract. Log. Program. 18(2): 126-166 (2018) - [j35]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Solving Horn Clauses on Inductive Data Types Without Induction. Theory Pract. Log. Program. 18(3-4): 452-469 (2018) - [c77]Emanuele De Angelis, Fabio Fioravanti, Adrián Palacios, Alberto Pettorossi, Maurizio Proietti:
Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs. HCVS 2018: 19-26 - [i14]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Solving Horn Clauses on Inductive Data Types Without Induction. CoRR abs/1804.09007 (2018) - 2017
- [j34]Maurizio Proietti, Hirohisa Seki, Jim Woodcock:
Editorial. Formal Aspects Comput. 29(1): 1-2 (2017) - [j33]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Program Verification using Constraint Handling Rules and Array Constraint Generalizations. Fundam. Informaticae 150(1): 73-117 (2017) - [j32]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Semantics-based generation of verification conditions via program specialization. Sci. Comput. Program. 147: 78-108 (2017) - [c76]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Predicate Pairing with Abstraction for Relational Verification. LOPSTR 2017: 289-305 - [c75]Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti:
Verifying Controllability of Time-Aware Business Processes. RuleML+RR 2017: 103-118 - [e3]Alexei Lisitsa, Andrei P. Nemytykh, Maurizio Proietti:
Proceedings Fifth International Workshop on Verification and Program Transformation, VPT@ETAPS 2017, Uppsala, Sweden, 29th April 2017. EPTCS 253, 2017 [contents] - [i13]Alberto Pettorossi, Maurizio Proietti:
Regularity of non context-free languages over a singleton terminal alphabet. CoRR abs/1705.09695 (2017) - [i12]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Predicate Pairing for Program Verification. CoRR abs/1708.01473 (2017) - [i11]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Enhancing Predicate Pairing with Abstraction for Relational Verification. CoRR abs/1709.04809 (2017) - 2016
- [c74]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verifying Relational Program Properties by Transforming Constrained Horn clauses. CILC 2016: 69-85 - [c73]Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti:
Verification of Time-Aware Business Processes Using Constrained Horn Clauses. LOPSTR 2016: 38-55 - [c72]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Relational Verification Through Horn Clause Transformation. SAS 2016: 147-169 - [c71]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Removing Unnecessary Variables from Horn Clause Verification Conditions. HCVS@ETAPS 2016: 49-55 - [i10]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
- [j31]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
A Rule-based Verification Strategy for Array Manipulating Programs. Fundam. Informaticae 140(3-4): 329-355 (2015) - [j30]Fabio Fioravanti, Maurizio Proietti, Valerio Senni:
Efficient generation of test data structures using constraint logic programming and program transformation. J. Log. Comput. 25(6): 1263-1283 (2015) - [j29]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Proving correctness of imperative programs by linearizing constrained Horn clauses. Theory Pract. Log. Program. 15(4-5): 635-650 (2015) - [c70]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Semantics-based generation of verification conditions by program specialization. PPDP 2015: 91-102 - [e2]Maurizio Proietti, Hirohisa Seki:
Logic-Based Program Synthesis and Transformation - 24th International Symposium, LOPSTR 2014, Canterbury, UK, September 9-11, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8981, Springer 2015, ISBN 978-3-319-17821-9 [contents] - [i9]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
- [j28]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Program verification via iterated specialization. Sci. Comput. Program. 95: 149-175 (2014) - [c69]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Program Verification using Constraint Handling Rules and Array Constraint Generalizations. VPT@CAV 2014: 3-18 - [c68]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Program Verification using Constraint Handling Rules and Array Constraint Generalizations. CILC 2014: 114-131 - [c67]Fabrizio Smith, Maurizio Proietti:
Reasoning on Data-Aware Business Processes with Constraint Logic. SIMPDA 2014: 60-75 - [c66]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
VeriMAP: A Tool for Verifying Programs through Transformations. TACAS 2014: 568-574 - [c65]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verifying Array Programs by Transforming Verification Conditions. VMCAI 2014: 182-202 - [c64]Emanuele De Angelis, Fabio Fioravanti, Jorge A. Navas, Maurizio Proietti:
Verification of Programs by Combining Iterated Specialization with Interpolation. HCVS 2014: 3-18 - [i8]Fabrizio Smith, Maurizio Proietti:
Ontology-based Representation and Reasoning on Process Models: A Logic Programming Approach. CoRR abs/1410.1776 (2014) - 2013
- [j27]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Controlling Polyvariance for Specialization-based Verification. Fundam. Informaticae 124(4): 483-502 (2013) - [j26]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Proving Theorems by Program Transformation. Fundam. Informaticae 127(1-4): 115-134 (2013) - [j25]Claudia Diamantini, Domenico Potena, Maurizio Proietti, Fabrizio Smith, Emanuele Storti, Francesco Taglino:
A Semantic Framework for Knowledge Management in Virtual Innovation Factories. Int. J. Inf. Syst. Model. Des. 4(4): 70-92 (2013) - [j24]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Generalization strategies for the verification of infinite state systems. Theory Pract. Log. Program. 13(2): 175-199 (2013) - [c63]Alberto Pettorossi, Maurizio Proietti:
Program Transformation for Program Verification. VPT@CAV 2013: 13-14 - [c62]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Imperative Programs through Transformation of Constraint Logic Programs. VPT@CAV 2013: 30-41 - [c61]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Imperative Programs by Transforming Constraint Logic Programs. CILC 2013: 83-98 - [c60]Fabrizio Smith, Dario De Sanctis, Maurizio Proietti:
A Platform for Managing Business Process Knowledge Bases via Logic Programming. CILC 2013: 247-251 - [c59]Fabrizio Smith, Maurizio Proietti:
Rule-based Behavioral Reasoning on Semantic Business Processes. ICAART (2) 2013: 130-143 - [c58]Fabrizio Smith, Maurizio Proietti:
Behavioral Reasoning on Semantic Business Processes in a Rule-Based Framework. ICAART (Revised Selected Papers) 2013: 293-313 - [c57]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verifying programs via iterated specialization. PEPM 2013: 43-52 - [c56]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Imperative Programs by Constraint Logic Program Transformation. Festschrift for Dave Schmidt 2013: 186-210 - 2012
- [j23]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Constraint-based correctness proofs for logic program transformations. Formal Aspects Comput. 24(4-6): 569-594 (2012) - [j22]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Improving Reachability Analysis of Infinite State Systems by Specialization. Fundam. Informaticae 119(3-4): 281-300 (2012) - [j21]Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti:
Synthesizing Concurrent Programs Using Answer Set Programming. Fundam. Informaticae 120(3-4): 205-229 (2012) - [c55]Francesco Taglino, Fabrizio Smith, Maurizio Proietti:
Knowledge-Based Support to Business Innovation. NGEBIS 2012: 37-44 - [c54]Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti, Alberto Pettorossi:
Software Model Checking by Program Specialization. CILC 2012: 89-103 - [c53]Francesco Taglino, Fabrizio Smith, Maurizio Proietti:
A Software Platform for Semantics-based Enterprise Knowledge Management. INVIT 2012: 43-50 - [c52]Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Specialization with Constrained Generalization for Software Model Checking. LOPSTR 2012: 51-70 - 2011
- [j20]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Program transformation for development, verification, and synthesis of programs. Intelligenza Artificiale 5(1): 119-125 (2011) - [c51]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Controlling Polyvariance for Specialization-based Verification. CILC 2011: 179-197 - [c50]Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti:
Synthesizing Concurrent Programs using Answer Set Programming. CILC 2011: 245-259 - [c49]Michele Missikoff, Maurizio Proietti, Fabrizio Smith:
Querying Semantically Enriched Business Processes. DEXA (2) 2011: 294-302 - [c48]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Using Real Relaxations during Program Specialization. LOPSTR 2011: 106-122 - [c47]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Improving Reachability Analysis of Infinite State Systems by Specialization. RP 2011: 165-179 - [c46]Michele Missikoff, Maurizio Proietti, Fabrizio Smith:
Querying Business Processes and Ontologies in a Logic Programming Environment (Extended Abstract). SEBD 2011: 303- - [i7]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Generalization Strategies for the Verification of Infinite State Systems. CoRR abs/1110.0999 (2011) - 2010
- [j19]Alberto Pettorossi, Valerio Senni, Maurizio Proietti:
Transformations of logic programs on infinite lists. Theory Pract. Log. Program. 10(4-6): 383-399 (2010) - [c45]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Generalization Strategies for the Verification of Infinite State Systems. CILC 2010 - [c44]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
A Transformation Strategy for Verifying Logic Programs on Infinite Lists. CILC 2010 - [c43]Antonio De Nicola, Michele Missikoff, Maurizio Proietti, Fabrizio Smith:
An Open Platform for Business Process Modeling and Verification. DEXA (1) 2010: 76-90 - [c42]Michele Missikoff, Maurizio Proietti, Fabrizio Smith:
Reasoning on Business Processes and Ontologies in a Logic Programming Environment. INVIT 2010: 17-21 - [c41]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation. LOPSTR 2010: 164-183 - [c40]Antonio De Nicola, Michele Missikoff, Maurizio Proietti, Fabrizio Smith:
A Logic-Based Method for Business Process Knowledge Base Management. SEBD 2010: 170-181 - [c39]Fabrizio Smith, Michele Missikoff, Maurizio Proietti:
Ontology-Based Querying of Composite Services. BSME 2010: 159-180 - [p2]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
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
- [j18]Valerio Senni, Alberto Pettorossi, Maurizio Proietti:
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs. Fundam. Informaticae 96(3): 373-393 (2009) - [c38]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Deciding Full Branching Time Logic by Program Transformation. LOPSTR 2009: 5-21 - 2008
- [j17]Alberto Pettorossi, Maurizio Proietti:
Totally correct logic program transformations via well-founded annotations. High. Order Symb. Comput. 21(1-2): 193-234 (2008) - [j16]Alberto Pettorossi, Maurizio Proietti:
Totally correct logic program transformations via well-founded annotations. High. Order Symb. Comput. 21(1-2): 235 (2008) - [c37]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Program Transformation for Development, Verification, and Synthesis of Software. Il Milione 2008 - [c36]Valerio Senni, Alberto Pettorossi, Maurizio Proietti:
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs. ICLP 2008: 284-300 - 2007
- [c35]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Automatic Correctness Proofs for Logic Program Transformations. ICLP 2007: 364-379 - 2006
- [j15]Alberto Pettorossi, Maurizio Proietti:
Preface: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2. Fundam. Informaticae 69(1-2) (2006) - [c34]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. ICLP 2006: 179-195 - 2005
- [j14]Alberto Pettorossi, Maurizio Proietti:
Program Transformation: Theoretical Foundations and Basic Techniques. Part 1. Fundam. Informaticae 66(4) (2005) - [j13]Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism. High. Order Symb. Comput. 18(1-2): 121-210 (2005) - [c33]Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
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
- [j12]Alberto Pettorossi, Maurizio Proietti:
Transformations of logic programs with goals as arguments. Theory Pract. Log. Program. 4(4): 495-537 (2004) - [c32]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Automatic Proofs of Protocols via Program Transformation. MSRAS 2004: 99-116 - [c31]Alberto Pettorossi, Maurizio Proietti:
A theory of totally correct logic program transformations. PEPM 2004: 159-168 - [p1]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
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
- [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
- [j11]Alberto Pettorossi, Maurizio Proietti:
The List Introduction Strategy for the Derivation of Logic Programs. Formal Aspects Comput. 13(3-5): 233-251 (2002) - [c30]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Specialization with Clause Splitting for Deriving Deterministic Constraint Logic Programs. APPIA-GULP-PRODE 2002: 241-257 - [c29]Alberto Pettorossi, Maurizio Proietti:
Program Derivation = Rules + Strategies. Computational Logic: Logic Programming and Beyond 2002: 273-309 - [c28]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Combining Logic Programs and Monadic Second Order Logics by Program Transformation. LOPSTR 2002: 160-181 - 2001
- [c27]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verification of Sets of Infinite State Processes Using Program Transformation. LOPSTR 2001: 111-128 - 2000
- [c26]Alberto Pettorossi, Maurizio Proietti:
Perfect Model Checking via Unfold/Fold Transformations. Computational Logic 2000: 613-628 - [c25]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Automated strategies for specializing constraint logic programs. LOPSTR 2000 - [c24]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Automated Strategies for Specializing Constraint Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 125-146
1990 – 1999
- 1999
- [j10]Alberto Pettorossi, Maurizio Proietti:
Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs. J. Log. Program. 41(2-3): 197-230 (1999) - [c23]Fabio Fioravanti, Maurizio Proietti:
Contextual Specialization of Constraint Logic Programs. APPIA-GULP-PRODE 1999: 455-470 - [c22]Maurizio Proietti, Alberto Pettorossi:
Transforming Inductive Definitions. ICLP 1999: 486-499 - [c21]Alberto Pettorossi, Maurizio Proietti:
Transformation Rules for Logic Programs with Goals as Arguments. LOPSTR 1999: 176-195 - [c20]Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Rules and Strategies for Contextual Specialization of Constraint Logic Programs. WOID@ICLP 1999: 129-144 - 1998
- [j9]Alberto Pettorossi, Maurizio Proietti:
Program Specialization via Algorithmic Unfold/Fold Transformations. ACM Comput. Surv. 30(3es): 6 (1998) - 1997
- [j8]Alberto Pettorossi, Maurizio Proietti:
Future Directions in Program Transformation. ACM SIGPLAN Notices 32(1): 99-102 (1997) - [c19]Alberto Pettorossi, Maurizio Proietti:
Program derivation via list introduction. Algorithmic Languages and Calculi 1997: 296-323 - [c18]Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
Reducing Nondeterminism while Specializing Logic Programs. POPL 1997: 414-427 - 1996
- [j7]Alberto Pettorossi, Maurizio Proietti:
Rules and Strategies for Transforming Functional and Logic Programs. ACM Comput. Surv. 28(2): 360-414 (1996) - [j6]Alberto Pettorossi, Maurizio Proietti:
Future Directions in Program Transformation. ACM Comput. Surv. 28(4es): 171 (1996) - [j5]Alberto Pettorossi, Maurizio Proietti:
Developing correct and efficient logic programs by transformation. Knowl. Eng. Rev. 11(4): 347-360 (1996) - [c17]Alberto Pettorossi, Maurizio Proietti:
A Comparative Revisitation of Some Program Transformation Techniques. Dagstuhl Seminar on Partial Evaluation 1996: 355-385 - [c16]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 - [c15]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 - [c14]Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
Enhancing Partial Deduction via Unfold/Fold Rules. LOPSTR 1996: 146-168 - [e1]Maurizio Proietti:
Logic Programming Synthesis and Transformation, 5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995, Proceedings. Lecture Notes in Computer Science 1048, Springer 1996, ISBN 3-540-60939-3 [contents] - 1995
- [j4]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) - [c13]Kung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti:
Correctness of Logic Program Transformations Based on Existential Termination. ILPS 1995: 480-494 - 1994
- [j3]Alberto Pettorossi, Maurizio Proietti:
Transformation of Logic Programs: Foundations and Techniques. J. Log. Program. 19/20: 261-320 (1994) - [c12]Maurizio Proietti, Alberto Pettorossi:
Total correctness of a goal replacement rule based on the unfold/fold proof method. GULP-PRODE (1) 1994: 203-217 - [c11]Maurizio Proietti, Alberto Pettorossi:
Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables. ICLP 1994: 714-729 - 1993
- [j2]Maurizio Proietti, Alberto Pettorossi:
An Abstract Strategy for Transforming Logic Programs. Fundam. Informaticae 18: 267-286 (1993) - [j1]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) - [c10]Maurizio Proietti, Alberto Pettorossi:
Completeness of some Transformation Strategies for Avoiding Unncecessary Logical Variables. GULP 1993: 601-616 - [c9]Alberto Pettorossi, Maurizio Proietti:
Rules and Strategies for Program Transformation. Formal Program Development 1993: 263-304 - [c8]Maurizio Proietti, Alberto Pettorossi:
Synthesis of Programs from Unfold/Fold Proofs. LOPSTR 1993: 141-158 - 1992
- [c7]Maurizio Proietti, Alberto Pettorossi:
Best-first Strategies for Incremental Transformations of Logic Programs. LOPSTR 1992: 82-98 - 1991
- [c6]Maurizio Proietti, Alberto Pettorossi:
An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract). LOPSTR 1991: 126-128 - [c5]Maurizio Proietti, Alberto Pettorossi:
Semantics Preserving Transformation Rules for Prolog. PEPM 1991: 274-284 - [c4]Maurizio Proietti, Alberto Pettorossi:
Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. PLILP 1991: 347-358 - 1990
- [c3]Maurizio Proietti, Alberto Pettorossi:
Synthesis of Eureka Predicates for Developing Logic Programs. ESOP 1990: 306-325
1980 – 1989
- 1989
- [c2]Alberto Pettorossi, Maurizio Proietti:
Decidability Results and Characterization of Strategies for the Development of Logic Programs. ICLP 1989: 539-553 - 1987
- [c1]Maurizio Proietti:
Connections Between Partial Maps Categories and Triops Theory. Category Theory and Computer Science 1987: 254-269
Coauthor Index
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 2025-01-21 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint