Daniel Hausmann

Log. Methods Comput. Sci., 2024

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology.

[BibT_eX]

[DOI]

Mathieu Lehaut

CoRR, 2024

Alternating Nominal Automata with Name Allocation.

[BibT_eX]

[DOI]

CoRR, 2024

Faster Game Solving by Fixpoint Acceleration.

[BibT_eX]

[DOI]

CoRR, 2024

Generic Model Checking for Modal Fixpoint Logics in COOL-MC.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Fair ømega-Regular Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2024

Symbolic Solution of Emerson-Lei Games for Reactive Synthesis.

[BibT_eX]

[DOI]

Mathieu Lehaut

Proceedings of the Foundations of Software Science and Computation Structures, 2024

Faster and Smaller Solutions of Obliging Games.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

Benchmarking for COOL Model Checking.

[BibT_eX]

[DOI]

Dataset, October, 2023

Benchmarking for COOL Model Checking.

[BibT_eX]

[DOI]

Dataset, September, 2023

Benchmarking for COOL Model Checking.

[BibT_eX]

[DOI]

Dataset, September, 2023

Benchmarking for COOL Model Checking.

[BibT_eX]

[DOI]

Dataset, September, 2023

Benchmarking scripts for COOL 2.4.

[BibT_eX]

[DOI]

Dataset, June, 2023

Benchmarking scripts for COOL 2.3.

[BibT_eX]

[DOI]

Dataset, May, 2023

Benchmarking scripts for COOL 2.3.

[BibT_eX]

[DOI]

Dataset, March, 2023

Games for Efficient Supervisor Synthesis.

[BibT_eX]

[DOI]

Prabhat Kumar Jha

IEEE Control. Syst. Lett., 2023

Fair $ω$-Regular Games.

[BibT_eX]

[DOI]

CoRR, 2023

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics.

[BibT_eX]

[DOI]

CoRR, 2023

Symbolic Reactive Synthesis for the Safety and EL-fragment of LTL.

[BibT_eX]

[DOI]

Mathieu Lehaut

CoRR, 2023

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description).

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 29, 2023

2022

Benchmark data for COOL 2.2.

[BibT_eX]

[DOI]

Dataset, October, 2022

Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi.

[BibT_eX]

[DOI]

CoRR, 2022

A Survey on Satisfiability Checking for the μ-Calculus Through Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Principles of Systems Design, 2022

2021

Quasipolynomial Computation of Nested Fixpoints.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

A Linear-Time Nominal μ-Calculus with Name Allocation.

[BibT_eX]

[DOI]

Stefan Milius

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Nominal Büchi Automata with Name Allocation.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Harnessing LTL With Freeze Quantification.

[BibT_eX]

[DOI]

Stefan Milius

CoRR, 2020

Cheap CTL Compassion in NuSMV.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

NP Reasoning in the Monotone μ-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019

Computing Nested Fixpoints in Quasipolynomial Time.

[BibT_eX]

[DOI]

CoRR, 2019

Optimal Satisfiability Checking for Arithmetic μ-Calculi.

[BibT_eX]

[DOI]

CoRR, 2019

Optimal Satisfiability Checking for Arithmetic \mu -Calculi.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2019

Game-Based Local Model Checking for the Coalgebraic mu-Calculus.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Satisfiability Checking for the Coalgebraic µ-Calculus.

[BibT_eX]

[DOI]

PhD thesis, 2018

Permutation Games for the Weakly Aconjunctive \mu μ -Calculus.

[BibT_eX]

[DOI]

Hans-Peter Deifel

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

2017

Permutation Games for the Weakly Aconjunctive mu-Calculus.

[BibT_eX]

[DOI]

Hans-Peter Deifel

CoRR, 2017

2016

Global Caching for the Alternation-free μ-Calculus.

[BibT_eX]

[DOI]

Christoph Egger

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

Global Caching for the Flat Coalgebraic µ-Calculus.

[BibT_eX]

[DOI]

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

2010

Optimal Tableaux for Conditional Logics with Cautious Monotonicity.

[BibT_eX]

[DOI]

Dirk Pattinson

Proceedings of the ECAI 2010, 2010

2009

Optimizing Conditional Logic Reasoning within CoLoSS.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Methods for Modalities, 2009

2008

The Importance of Being Formal.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Certification of Safety-Critical Software Controlled Systems, 2008

Zertifizierung einer Sicherungskomponente mittels durchgängig formaler Modellierung.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering 2008, 2008

2006

A coalgebraic approach to the semantics of the ambient calculus.

[BibT_eX]

[DOI]

Till Mossakowski

Theor. Comput. Sci., 2006

2005

Iterative Circular Coinduction for CoCasl in Isabelle/HOL.

[BibT_eX]

[DOI]

Till Mossakowski

Proceedings of the Fundamental Approaches to Software Engineering, 2005

Towards a Coalgebraic Semantics of the Ambient Calculus.

[BibT_eX]

[DOI]

Till Mossakowski