Fabio Mogavero

Inf. Comput., 2024

Model Checking Linear Temporal Properties on Polyhedral Systems.

[BibT_eX]

[DOI]

Marco Faella

Proceedings of the 31st International Symposium on Temporal Representation and Reasoning, 2024

Full Characterisation of Extended CTL.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Temporal Representation and Reasoning, 2024

Automata-Theoretic Characterisations of Branching-Time Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Plan Logic.

[BibT_eX]

[DOI]

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

Alternating (In)Dependence-Friendly Logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., December, 2023

Taming Strategy Logic: Non-Recurrent Fragments.

[BibT_eX]

[DOI]

Adriano Peron

Inf. Comput., October, 2023

Good-for-Game QPTL: An Alternating Hodges Semantics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., January, 2023

Quantifying Over Trees in Monadic Second-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Satisfiability and containment of recursive SHACL.

[BibT_eX]

[DOI]

Paolo Pareti

J. Web Semant., 2022

2021

Expressing Structural Temporal Properties of Safety Critical Hierarchical Systems.

[BibT_eX]

[DOI]

Luigi Libero Lucio Starace

Adriano Peron

Proceedings of the Quality of Information and Communications Technology, 2021

2020

Robust worst cases for parity games algorithms.

[BibT_eX]

[DOI]

Inf. Comput., 2020

SHACL Satisfiability and Containment (Extended Paper).

[BibT_eX]

[DOI]

Paolo Pareti

Timothy J. Norman

CoRR, 2020

From Quasi-Dominions to Progress Measures.

[BibT_eX]

[DOI]

CoRR, 2020

SHACL Satisfiability and Containment.

[BibT_eX]

[DOI]

Paolo Pareti

Timothy J. Norman

Proceedings of the Semantic Web - ISWC 2020, 2020

2019

Attacking Diophantus: Solving a Special Case of Bag Containment.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

On the decidability of linear bounded periodic cyber-physical systems.

[BibT_eX]

[DOI]

Ruggero Lanotte

Massimo Merro

Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, 2019

Satisfiability in Strategy Logic Can Be Easier than Model Checking.

[BibT_eX]

[DOI]

Erman Acar

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Reasoning about graded strategy quantifiers.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Practical verification of multi-agent systems against Slk specifications.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Solving parity games via priority promotion.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2018

2017

Preface to the Special Issue on SR 2014.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Reasoning about Strategies: on the Satisfiability Problem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries.

[BibT_eX]

[DOI]

Simone Bova

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Reformulating Queries: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Relentful strategic reasoning in alternating-time temporal logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2016

Cycle Detection in Computation Tree Logic.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Games, 2016

A Delayed Promotion Policy for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Games, 2016

Improving Priority Promotion for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Hardware and Software: Verification and Testing, 2016

2015

Reasoning About Substructures and Games.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2015

Special issue on SR 2013.

[BibT_eX]

[DOI]

Inf. Comput., 2015

On Promptness in Parity Games.

[BibT_eX]

[DOI]

Loredana Sorrentino

Fundam. Informaticae, 2015

On the Counting of Strategies.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Binding Forms in First-Order Logic.

[BibT_eX]

[DOI]

Giuseppe Perelli

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Reasoning About Strategies: On the Model-Checking Problem.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Synthesis of hierarchical systems.

[BibT_eX]

[DOI]

Benjamin Aminof

Sci. Comput. Program., 2014

On the Remarkable Features of Binding Forms.

[BibT_eX]

[DOI]

Giuseppe Perelli

CoRR, 2014

A Behavioral Hierarchy of Strategy Logic.

[BibT_eX]

[DOI]

Luigi Sauro

Proceedings of the Computational Logic in Multi-Agent Systems, 2014

MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Strategy games: a renewed framework.

[BibT_eX]

[DOI]

Luigi Sauro

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

On the Boundary of Behavioral Strategies.

[BibT_eX]

[DOI]

Luigi Sauro

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Substructure Temporal Logic.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Logics in Computer Science - A Study on Extensions of Temporal and Strategic Logics.

[BibT_eX]

[DOI]

Atlantis Studies in Computing 3, Atlantis Press, ISBN: 978-94-91216-94-7, 2013

2012

Graded computation tree logic.

[BibT_eX]

[DOI]

Alessandro Bianco

ACM Trans. Comput. Log., 2012

Quantitatively fair scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A Decidable Fragment of Strategy Logic

[BibT_eX]

[DOI]

CoRR, 2012

What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Exploring the boundary of half-positionality.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2011

2010

Logics in Computer Science.

[BibT_eX]

[DOI]

PhD thesis, 2010

Quantitative Fairness Games

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages, 2010

Reasoning About Strategies.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Graded Computation Tree Logic with Binary Coding.

[BibT_eX]

[DOI]

Alessandro Bianco

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Balanced Paths in Colored Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Branching-Time Temporal Logics with Minimal Model Quantifiers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Comparing Rule-Based Policies.

[BibT_eX]

[DOI]

Piero A. Bonatti