Publications of Valerio Senni

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  ALL, with author Senni V., in the category ALL (or show them all):   (Items found: 46)


2015 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005

2015  [top]

2013  [top]

2012  [top]
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Improving Reachability Analysis of Infinite State Systems by Specialization, Fundamenta Informaticae 119, 281-300, 2012
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Using Real Relaxations During Program Specialization, in: Logic-based Program Synthesis and Transformation, Selected papers, Vidal G. ed., Lecture Notes in Computer Science, 7225, Springer Berlin, Heidelberg, 106-122, 2012
  • Giorgetti A, Senni V.: Specification and Validation of Algorithms Generating Planar Lehman Words, in the Proceedings of 8th International Conference on random generation of combinatorial structures (GASCom'12, ), June 25-27, 2012, LaBRI, Bordeaux, 2012
  • Pettorossi A., Maurizio Proietti, Senni V.: Constraint-Based Correctness Proofs for Logic Program Transformations, Formal Aspects of Computing 24, 569-594, 2012
  • Senni V., Fioravanti F.: Generation of Test Data Structures Using Constraint Logic Programming, in the Proceedings of 6th International Conference on Tests and Proofs (TAP 2012), Lecture Notes in Computer Science, 7305, 2012

2011  [top]
  • 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
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Program Transformation for Development, Verification, and Synthesis of Programs, Intelligenza Artificiale 5, 119-125, 2011
  • Fioravanti F., Maurizio Proietti, Pettorossi A., Senni V.: A Constraint-Based Transformation for Verifying Infinite State Systems, IASI-CNR, R. 11-23, 2011
  • Pettorossi A., Maurizio Proietti, Senni V.: Constraint-Based Correctness Proofs for Logic Program Transformations, IASI-CNR, R. 11-24, 2011
  • Senni V., Ringeissen C.: Modular Termination and Combinability for Superposition Modulo Counter Arithmetic, in: 8th International Symposium Frontiers of Combining Systems FroCoS 2011, Lecture Notes in Artificial Intelligence, 6989, Springer Berlin, 211-226, 2011

2010  [top]
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, in the Proceedings of 20th International Symposium on Logic-Based Synthesis and Transformation (LOPSTR 2010), July 23-25, 2010, Hagenberg, Austria, RISC-Linz Report Series No. 10-14., Alpuente M ed., 2010
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Generalization Strategies for the Verification of Infinite State Systems, in the Proceedings of 25th Italian Conference on Computational Logic (CILC'10), Leone N., Faber W. eds., CEUR-WS, 598, 2010
  • Fioravanti F., Pettorossi A., Maurizio Proietti, Senni V.: Generalization Strategies for the Verification of Infinite State Systems, IASI-CNR, R. 10-21, 2010
  • Pettorossi A., Maurizio Proietti, Senni V.: Transformations of logic programs on infinite lists, IASI-CNR, R. 10-04, 2010
  • Pettorossi A., Maurizio Proietti, Senni V.: Transformations of Logic Programs on Infinite Lists, Theory and Practice of Logic Programming 10, 383-399, 2010
  • Pettorossi A., Maurizio Proietti, Senni V.: Deciding Full Branching Time Logic by Program Transformation, in: 19th International Symposium on Logic-Based Synthesis and Transformation (LOPSTR '09), Revised Selected Papers, De Schreye D. ed., Lecture Notes in Computer Science, 6037, Springer, 5-21, 2010
  • Pettorossi A., Maurizio Proietti, Senni V.: A Transformation Strategy for Verifying Logic Programs on Infinite Lists, in the Proceedings of 25th Italian Conference on Computational Logic (CILC'10), Leone N., Faber W. eds., CEUR-WS, 598, 2010
  • Pettorossi A., Maurizio Proietti, Senni V.: The Transformational Approach to Program Development, in: A 25 Year Perspective on Logic Programming, Pontelli E., Dovier A. eds., Lecture Notes in Computer Science, 6125, Springer, 112-135, 2010

2009  [top]

2008  [top]
  • Senni V., Pettorossi A., Maurizio Proietti: Folding Transformation Rules for Constraint Logic Programs, Electronic Proceedings of the 2008 Italian Conference on Computational Logic (CILC 2008), 10-12 July, 2008, Perugia, Italy. http://www.dipmat.unipg.it/CILC08/, 2008
  • Senni V., Pettorossi A., Maurizio Proietti: A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs, IASI-CNR, R. 08-03, 2008
  • Senni V., Maurizio Proietti, Pettorossi A.: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs, in the Proceedings of 24th International Conference on Logic Programming, Garcia de la Banda M., Pontelli E. eds., Lecture Notes in Computer Science, 5366, pp. 284-300, 2008

2007  [top]
  • Jacovitti G., Pettorossi A., Consolo R., Senni V.: Information Science and Technology for the New Century, in: Quaderni Sefir no. 7, Senni V., Pettorossi A., Jacovitti G., Consolo R. eds., 2007
  • Pettorossi A., Maurizio Proietti, Senni V.: Automatic Correctness Proofs for Logic Program Transformations, in the Proceedings of 23rd International Conference on Logic Programming (ICLP '07), Niemela I., Dahl V. eds., Lecture Notes in Computer Science, 4670, pp. 364-379, Springer, 2007
  • Pettorossi A., Maurizio Proietti, Senni V.: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables, DISP, Universit{`a} di Roma Tor Vergata, 8, 2007

2006  [top]
  • Pettorossi A., Maurizio Proietti, Senni V.: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables, in: Proceedings of the 22nd International Conference on Logic Programming (ICLP '06), Etalle S., Truszczynski M. eds., Lecture Notes in Computer Science, 4079, Springer-Verlag, 179-195, 2006
  • Pettorossi A., Maurizio Proietti, Senni V.: Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs, Electronic Proceedings of the Dagstuhl Seminar 05161, Transformation Techniques in Software Engineering, IBFI, Germany, 2006

2005  [top]
  • Pettorossi A., Maurizio Proietti, Senni V.: Transformational Verification of Parameterized Protocols Using Array Formulas., in the Proceedings of 15th International Symposium on Logic Based Program Synthesis and Transformation (LOPSTR 2005), Imperial College, London, UK, September 7-9, Hill P.M ed., Lecture Notes in Computer Science, 2005
  • Pettorossi A., Maurizio Proietti, Senni V.: Verifying parameterized protocols by transforming stratified logic programs, Electronic Proceedings of the Italian Annual Meeting on Computational Logic (CILC'05), June 21-22, Roma, Italy, 2005
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -