Laura Bozzelli

According to our database1, Laura Bozzelli
  • authored at least 60 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On the Complexity of ATL and ATL* Module Checking.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Hierarchical Cost-Parity Games.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions.
Proceedings of the Software Engineering and Formal Methods - 15th International Conference, 2017

Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Foundations of Boolean stream runtime verification.
Theor. Comput. Sci., 2016

Model Checking the Logic of Allen's Relations Meets and Started-by is PNP-Complete.
Proceedings of the Seventh International Symposium on Games, 2016

On the Expressiveness of Temporal Equilibrium Logic.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015
The complexity of one-agent refinement modal logic.
Theor. Comput. Sci., 2015

Uniform strategies, rational relations and jumping automata.
Inf. Comput., 2015

On the complexity of Temporal Equilibrium Logic.
CoRR, 2015

On the Complexity of Temporal Equilibrium Logic.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Unifying Hyper and Epistemic Temporal Logics.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
Verification of gap-order constraint abstractions of counter systems.
Theor. Comput. Sci., 2014

Refinement modal logic.
Inf. Comput., 2014

Unifying Hyper and Epistemic Temporal Logic.
CoRR, 2014

Visibly rational expressions.
Acta Inf., 2014

Foundations of Boolean Stream Runtime Verification.
Proceedings of the Runtime Verification - 5th International Conference, 2014

Visibly Linear Temporal Logic.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
The Complexity of Synthesizing Uniform Strategies
Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

The Complexity of One-Agent Refinement Modal Logic.
Proceedings of the IJCAI 2013, 2013

2012
Refinement Modal Logic
CoRR, 2012

On timed alternating simulation for concurrent timed games.
Acta Inf., 2012

Verification of Gap-Order Constraint Abstractions of Counter Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Strong Termination for Gap-Order Constraint Abstractions of Counter Systems.
Proceedings of the Language and Automata Theory and Applications, 2012

The Complexity of One-Agent Refinement Modal Logic.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

Visibly Rational Expressions.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Hardness of preorder checking for basic formalisms.
Theor. Comput. Sci., 2011

New results on pushdown module checking with imperfect information
Proceedings of Second International Symposium on Games, 2011

Opacity Issues in Games with Imperfect Information
Proceedings of Second International Symposium on Games, 2011

Hybrid and First-Order Complete Extensions of CaRet.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Complexity Analysis of the Backward Coverability Algorithm for VASS.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

2010
Complexity and succinctness issues for linear-time hybrid logics.
Theor. Comput. Sci., 2010

Pushdown module checking.
Formal Methods in System Design, 2010

Hardness of Preorder Checking for Basic Formalisms.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
Decision problems for lower/upper bound parametric timed automata.
Formal Methods in System Design, 2009

CaRet With Forgettable Past.
Electr. Notes Theor. Comput. Sci., 2009

On decidability of LTL model checking for process rewrite systems.
Acta Inf., 2009

On Timed Alternating Simulation for Concurrent Timed Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Verification of well-formed communicating recursive state machines.
Theor. Comput. Sci., 2008

The Complexity of CaRet + Chop.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

Complexity and Succinctness Issues for Linear-Time Hybrid Logics.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

The Complexity of CTL* + Linear Past.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Complexity results on branching-time pushdown model checking.
Theor. Comput. Sci., 2007

Decision Problems for Lower/Upper Bound Parametric Timed Automata.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Model checking for process rewrite systems and a class of action-based regular properties.
Theor. Comput. Sci., 2006

Verification of Well-Formed Communicating Recursive State Machines.
Proceedings of the Verification, 2006

Complexity Results on Branching-Time Pushdown Model Checking.
Proceedings of the Verification, 2006

Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints.
Proceedings of the Logic for Programming, 2006

On Decidability of LTL Model Checking for Process Rewrite Systems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Controller Synthesis for MTL Specifications.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties.
Proceedings of the Verification, 2005

Pushdown Module Checking.
Proceedings of the Logic for Programming, 2005

2004
Model checking for Process Rewrite Systems and a class of action - based regular properties
CoRR, 2004

Verification of Process Rewrite Systems in normal form
CoRR, 2004

2003
Verification of recursive parallel systems
CoRR, 2003


  Loading...