2012

Laura Bozzelli and Sophie Pinchinat. Verification of gap-order constraint abstractions of counter systems. In Proc. 13th VMCAI, 2012. To appear.


2011

Laura Bozzelli. New results on pushdown module checking with imperfect information. In Proc. of the 2nd International Symposium on Games, Automata, Logics and Formal Verification (GANDALF'11), Minori, (Amalfi coast), Italy, 15-17 June 2011. Volume 54 of EPTCS, pages 162-177, 2011.

Bastien Maubert, Sophie Pinchinat, and Laura Bozzelli. Opacity Issues in Games with Imperfect Information. In Proc. of the 2nd International Symposium on Games, Automata, Logics and Formal Verification (GANDALF'11), Minori, (Amalfi coast), Italy, 15-17 June 2011. Volume 54 of EPTCS, pages 87-101, 2011.

Laura Bozzelli and Ruggero Lanotte. Hybrid and first-order complete extensions of CaRet. In Proc. of the 20th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'11), Bern, Switzerland, July 4-8, 2011. Volume 6793 of LNCS, pages 58-72. Springer, 2011.

Laura Bozzelli and Pierre Ganty. Complexity Analysis of the Backward Coverability Algorithm for VASS. In Proc. of the 5th International Workshop on Reachability Problems (RP'11), Genoa, Italy, September 28-30, 2011. Volume 6945 of LNCS, pages 96-109. Springer, 2011.


2010

Laura Bozzelli, Axel Legay, and Sophie Pinchinat. Hardness of Preorder Checking for Basic Formalisms. In Proc. of the 16th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-16), Dakar, Senegal, April 25-May 1, 2010. Volume 6355 of LNCS, pages 119-135. Springer, 2010.

Laura Bozzelli, Aniello Murano, and Adriano Peron. Pushdown module checking. Formal Methods in System Design 36(1): 65-95 (2010).

Laura Bozzelli and Ruggero Lanotte. Complexity and succinctness issues for linear-time hybrid logics. Theoretical Computer Science 411(2): 454-469 (2010).



2009

Laura Bozzelli, Axel Legay, and Sophie Pinchinat. On Timed Alternating Simulation for Concurrent Timed Games. In Proc. of the 29th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09), IIT Kanpur, India, December 15--17, 2009. Volume 4 of Leibniz International Proceedings in Informatics (LIPIcs), pages 85-96, 2009.

Laura Bozzelli. CaRet With Forgettable Past. In Proc. of the 4th Workshop on Methods for Modalities (M4M-5), Cachan, France, November 2007. Volume 231 of ENTCS, pages 343-361. Elsevier, 2009.

Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, and Jan Strejcek. On decidability of LTL model checking for process rewrite systems. Acta Informatica 46(1): 1-28 (2009).

Laura Bozzelli and Salvatore La Torre. Decision problems for lower/upper bound parametric timed automata. Formal Methods in System Design 35(2): 121-151 (2009).


2008

Laura Bozzelli and Ruggero Lanotte. Complexity and Succinctness Issues for Linear-Time Hybrid Logics. In Proc. of the 11th European Conference on Logics in Artificial Intelligence (JELIA'08), Dresden, Germany, September 28 - October 1, 2008. Volume 5293 of LNCS, pages 48-61. Springer, 2008.

Laura Bozzelli. The Complexity of CTL* + Linear Past. In Proc. of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), Budapest, Hungary, March-April 2008. Volume 4962 of LNCS, pages 186-200. Springer, 2008.

Laura Bozzelli. The Complexity of CaRet + Chop. In Proc. of the 15th International Symposium on Temporal Representation and Reasoning (TIME'08), Montreal, Canada, June 2008. IEEE Computer Society, 2008, pages 23-31.

Laura Bozzelli, Salvatore La Torre, and Adriano Peron. Verification of well-formed communicating recursive state machines. Theoretical Computer Science 403(2-3): 382-405 (2008).


2007

Laura Bozzelli. Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. In Proc. of the 18th International Conference on Concurrency Theory (CONCUR'07), Lisbon, Portugal, September 2007. Volume 4703 of LNCS, pages 476-491. Springer, 2007.

Laura Bozzelli and Salvatore La Torre. Decision Problems for Lower/Upper Bound Parametric Timed Automata. In Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), Wroclaw, Poland, 9--13 July 2007. Volume 4596 of LNCS, pages 925-936. Springer, 2007.

Laura Bozzelli. Complexity Results on Branching-Time Pushdown Model Checking. Theoretical Computer Science 379(1-2): 286-297 (2007).


2006

Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, and Jan Strejcek. On Decidability of LTL Model Checking for Process Rewrite Systems. In Proc. of the 26th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), Kolkata, India, December 2006. Volume 4337 of LNCS, pages 248-259. Springer, 2006.

Laura Bozzelli and Régis Gascon. Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. In Proc. of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), Phnom Penh, Cambodia, November 2006. Volume 4246 of LNCS, pages 197-211. Springer, 2006.

Patricia Bouyer, Laura Bozzelli, and Fabrice Chevalier. Controller Synthesis for MTL Specifications. In Proc. of the 17th International Conference on Concurrency Theory (CONCUR'06), Bonn, Germany, August 27-30, 2006. Volume 4137 of LNCS, pages 450-464. Springer, 2006.

Laura Bozzelli, Salvatore La Torre, and Adriano Peron. Verification of Well-Formed Communicating Recursive State Machines. In Proc. of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'06), Charleston, SC, USA, January 8-10, 2006. Volume 3855 of LNCS, pages 412-426. Springer, 2006.

Laura Bozzelli. Complexity Results on Branching-Time Pushdown Model Checking. In Proc. of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'06), Charleston, SC, USA, January 8-10, 2006. Volume 3855 of LNCS, pages 65-79. Springer, 2006.

Laura Bozzelli. Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. Theoretical Computer Science 360(1-3): 352-372 (2006).


2005

Laura Bozzelli, Aniello Murano, and Adriano Peron. Pushdown Module Checking. In Proc. of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05), Montego Bay, Jamaica, December 2005. Volume 3835 of LNCS, pages 504-518. Springer, 2005.

Laura Bozzelli. Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. In Proc. 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05), Paris, France, 17-20 January 2005. Volume 3385 of LNCS, pages 282-297. Springer, 2005.