The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alberto Pettorossi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  79. The Transformational Approach to Program Development. [Citation Graph (, )][DBLP]


  80. Synthesis of subtree rewriting systems behaviour by solving equations. [Citation Graph (, )][DBLP]


  81. A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs. [Citation Graph (, )][DBLP]


  82. Deciding Full Branching Time Logic by Program Transformation. [Citation Graph (, )][DBLP]


  83. Transformations of Logic Programs on Infinite Lists [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002