Alberto Pettorossi

From MaRDI portal
Revision as of 15:42, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Alberto Pettorossi to Alberto Pettorossi: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:673495

Available identifiers

zbMath Open pettorossi.albertoMaRDI QIDQ673495

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61972132024-02-16Paper
Analysis and Transformation of Constrained Horn Clauses for Program Verification2023-12-12Paper
Automata Theory and Formal Languages2023-03-29Paper
Removing algebraic data types from constrained Horn clauses using difference predicates2022-11-09Paper
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses2022-09-30Paper
Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach2022-03-09Paper
https://portal.mardi4nfdi.de/entity/Q50206462022-01-06Paper
https://portal.mardi4nfdi.de/entity/Q33849032021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q50163842021-12-13Paper
https://portal.mardi4nfdi.de/entity/Q50153702021-12-07Paper
Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM2021-09-03Paper
https://portal.mardi4nfdi.de/entity/Q49946932021-06-21Paper
Correction to: ``Towers of Hanoi problems: deriving iterative solutions by program transformations2020-06-05Paper
Semantics and Controllability of Time-Aware Business Processes*2019-05-24Paper
Solving Horn Clauses on Inductive Data Types Without Induction2018-12-04Paper
Predicate pairing with abstraction for relational verification2018-09-06Paper
Relational verification through Horn clause transformation2018-08-27Paper
Predicate Pairing for program verification2018-05-31Paper
Program Verification using Constraint Handling Rules and Array Constraint Generalizations*2017-11-10Paper
Proving correctness of imperative programs by linearizing constrained Horn clauses2017-11-09Paper
Verification of time-aware business processes using constrained Horn clauses2017-10-13Paper
A Rule-based Verification Strategy for Array Manipulating Programs2016-08-15Paper
Verifying Array Programs by Transforming Verification Conditions2015-01-13Paper
Proving Theorems by Program Transformation2013-11-28Paper
Specialization with Constrained Generalization for Software Model Checking2013-09-13Paper
Controlling Polyvariance for Specialization-based Verification2013-07-30Paper
Generalization strategies for the verification of infinite state systems2013-06-26Paper
Constraint-based correctness proofs for logic program transformations2013-03-22Paper
Using Real Relaxations during Program Specialization2013-03-13Paper
Synthesizing Concurrent Programs Using Answer Set Programming2013-01-14Paper
Improving Reachability Analysis of Infinite State Systems by Specialization2012-10-29Paper
Improving Reachability Analysis of Infinite State Systems by Specialization2011-10-07Paper
Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation2011-05-27Paper
Combining Logic Programs and Monadic Second Order Logics by Program Transformation2011-03-04Paper
Transformations of logic programs on infinite lists2010-08-19Paper
The Transformational Approach to Program Development2010-07-20Paper
Deciding Full Branching Time Logic by Program Transformation2010-05-04Paper
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs2010-02-05Paper
Totally correct logic program transformations via well-founded annotations2009-08-04Paper
Automatic Correctness Proofs for Logic Program Transformations2009-03-05Paper
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs2009-01-22Paper
Transformational Verification of Parameterized Protocols Using Array Formulas2009-01-15Paper
Proving Properties of Constraint Logic Programs by Eliminating Existential Variables2008-03-11Paper
Derivation of efficient logic programs by specialization and reduction of nondeterminism2006-02-08Paper
Program Development in Computational Logic2005-12-23Paper
https://portal.mardi4nfdi.de/entity/Q57015132005-11-03Paper
Transformations of logic programs with goals as arguments2004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48088112004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44218752003-09-01Paper
https://portal.mardi4nfdi.de/entity/Q47077422003-06-11Paper
The list introduction strategy for the derivation of logic programs2002-09-25Paper
https://portal.mardi4nfdi.de/entity/Q27670912002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27239242001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44992542001-03-05Paper
Transformation of logic programs: Foundations and techniques2000-08-14Paper
Synthesis and transformation of logic programs using unfold/fold proofs2000-02-06Paper
https://portal.mardi4nfdi.de/entity/Q43914531998-06-03Paper
Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q42874801994-05-06Paper
https://portal.mardi4nfdi.de/entity/Q31420261993-12-06Paper
https://portal.mardi4nfdi.de/entity/Q40386691993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40296051993-03-28Paper
The loop absorption and the generalization strategies for the development of logic programs and partial deduction1993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42050711989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47320891989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967301988-01-01Paper
Derivation of efficient programs for computing sequences of actions1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552291987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37699511987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766001987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774271987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37804231987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38199871987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47216301987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37181301986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37368961986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282371986-01-01Paper
Towers of Hanoi problems: deriving iterative solutions by program transformations1985-01-01Paper
Higher-order communications for concurrent programming1985-01-01Paper
A note on Cohen's “eliminating redundant recursive calls”1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37074151985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37098681985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33232661983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33383161983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47437191983-01-01Paper
Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36608891982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408281982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47422891982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47452801982-01-01Paper
A property which guarantees termination in weak combinatory logic and subtree replacement systems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206341981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39306251981-01-01Paper
Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38995201980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38531251979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41626331978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41411041977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40969211975-01-01Paper

Research outcomes over time

This page was built for person: Alberto Pettorossi