Valerio Senni
Valerio Senni Valerio Senni
Postdoc

Personal web page: http://www.disp.uniroma2.it/users/senni/

Selected publications
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Generalization Strategies for the Verification of Infinite State Systems, Theory and Practice of Logic Programming 13, 175-199, 2013
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Improving Reachability Analysis of Infinite State Systems by Specialization, Fundamenta Informaticae 119, 281-300, 2012
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Constraint-Based Correctness Proofs for Logic Program Transformations, Formal Aspects of Computing 24, 569-594, 2012
  • Valerio Senni, 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
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Program Transformation for Development, Verification, and Synthesis of Programs, Intelligenza Artificiale 5, 119-125, 2011
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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., Maurizio Proietti, Alberto Pettorossi, Valerio Senni: A Constraint-Based Transformation for Verifying Infinite State Systems, IASI-CNR, R. 11-23, 2011
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Constraint-Based Correctness Proofs for Logic Program Transformations, IASI-CNR, R. 11-24, 2011
  • Valerio Senni, 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
  • Fioravanti F., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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., Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Transformations of Logic Programs on Infinite Lists, Theory and Practice of Logic Programming 10, 383-399, 2010
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Deciding Full Branching Time Logic by Program Transformation, in the Proceedings of 19th International Symposium on Logic Program Synthesis and Transformation (LOPSTR 2009), De Schreye D., Quaresma P. eds., 2009
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: The Transformational Approach to Program Development, IASI-CNR, R. 09-06, 2009
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Transformational Verification of Linear Temporal Logic, Electronic Proceedings of the 2009 Italian Conference on Computational Logic (CILC 2009), 24-26 June, 2009, Ferrara, Italy. http://www.ing.unife.it/eventi/cilc09/accepted.shtml, 2009
  • Valerio Senni, Alberto Pettorossi, Maurizio Proietti: A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs, Fundamenta Informaticae 96 (3), 373-393, 2009
  • Valerio Senni, Alberto Pettorossi, 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
  • Valerio Senni, Maurizio Proietti, Alberto Pettorossi: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
  • Alberto Pettorossi, Maurizio Proietti, Valerio Senni: 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
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -