Publications of Alberto Pettorossi

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  2011, with author Pettorossi A., in the category Articles in Collections and Proceedings (or show them all):   (Items found: 5)


2011  [top]
  • Emanuele De Angelis, Pettorossi A., Maurizio Proietti: Synthesizing Concurrent Programs using Answer Set Programming, in the Proceedings of International Workshop on Concurrency, Specification and Programming (CS&P 2011), Pultusk, Poland, 28-30 Sept. 2011, 2011
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, in: Logic-Based Program Synthesis and Transformation, 20th International Symposium, LOPSTR '10, Revised Selected Papers, Alpuente M ed., Lecture Notes in Computer Science, 6564, Springer Berlin Heidelberg, 164-183, 2011
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Improving Reachability Analysis of Infinite State Systems by Specialization, in: Reachability Problems (RP 2011), Delzanno G, Potapov I eds., Lecture Notes in Computer Science, 6945, Springer Berlin Heidelberg, 165-179, 2011
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Controlling Polyvariance for Specialization-Based Verification, in the Proceedings of 26th Italian Conference on Computational Logic (CILC'11), Fioravanti F ed., CEUR-WS, 2011
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Using Real Relaxations During Program Specialization, in the Proceedings of 21st International Symposium on Logic-Based Synthesis and Transformation (LOPSTR 2011), Univ. of Southern Denmark, Odense, Denmark, pp. 96-111, 2011
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -