Salomon Sickert

According to our database, Salomon Sickert authored at least 31 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Efficient Normalization of Linear Temporal Logic.

Javier Esparza, Rubén Rubio, Salomon Sickert

J. ACM, April, 2024

2022

From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata.

Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert

Int. J. Softw. Tools Technol. Transf., 2022

Certifying DFA Bounds for Recognition and Separation.

Orna Kupferman, Nir Lavee, Salomon Sickert

Innov. Syst. Softw. Eng., 2022

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021.

Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker

CoRR, 2022

Practical Applications of the Alternating Cycle Decomposition.

Antonio Casares, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert

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

On the Translation of Automata to Linear Temporal Logic.

Udi Boker, Karoliina Lehtinen, Salomon Sickert

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

A Simple Rewrite System for the Normalization of Linear Temporal Logic.

Javier Esparza, Rubén Rubio, Salomon Sickert

Proceedings of the Principles of Systems Design, 2022

2021

Certifying Inexpressibility.

Orna Kupferman, Salomon Sickert

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

2020

A Unified Translation of Linear Temporal Logic to ω-Automata.

Javier Esparza, Jan Kretínský, Salomon Sickert

J. ACM, 2020

An Efficient Normalisation Procedure for Linear Temporal Logic: Isabelle/HOL Formalisation.

Salomon Sickert

Arch. Formal Proofs, 2020

Practical synthesis of reactive systems from LTL specifications via parity games.

Michael Luttenberger, Philipp J. Meyer, Salomon Sickert

Acta Informatica, 2020

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata.

Salomon Sickert, Javier Esparza

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019

A Unified Translation of Linear Temporal Logic to ω-Automata.

Salomon Sickert

PhD thesis, 2019

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results.

Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr, Salomon Sickert, Leander Tentrup, Adam Walker

CoRR, 2019

A Compositional and Unified Translation of LTL into ω-Automata.

Benedikt Seidl, Salomon Sickert

Arch. Formal Proofs, 2019

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata.

Julian Brunner, Benedikt Seidl, Salomon Sickert

Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018

LTL Store: Repository of LTL formulae from literature and case studies.

Jan Kretínský, Tobias Meggendorfer, Salomon Sickert

CoRR, 2018

One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata.

Javier Esparza, Jan Kretínský, Salomon Sickert

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Strix: Explicit Reactive Synthesis Strikes Back!

Philipp J. Meyer, Salomon Sickert, Michael Luttenberger

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton.

Jan Kretínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Owl: A Library for ω-Words, Automata, and LTL.

Jan Kretínský, Tobias Meggendorfer, Salomon Sickert

Proceedings of the Automated Technology for Verification and Analysis, 2018

2017

LTL to Deterministic Emerson-Lei Automata.

David Müller, Salomon Sickert

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.

Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert

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

2016

From LTL to deterministic automata - A safraless compositional approach.

Javier Esparza, Jan Kretínský, Salomon Sickert

Formal Methods Syst. Des., 2016

Linear Temporal Logic.

Salomon Sickert

Arch. Formal Proofs, 2016

Limit-Deterministic Büchi Automata for Linear Temporal Logic.

Salomon Sickert, Javier Esparza, Stefan Jaax, Jan Kretínský

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata.

Salomon Sickert, Jan Kretínský

Proceedings of the Automated Technology for Verification and Analysis, 2016

2015

Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata.

Salomon Sickert

Arch. Formal Proofs, 2015

Refinement checking on parametric modal transition systems.

Nikola Benes, Jan Kretínský, Kim G. Larsen, Mikael H. Møller, Salomon Sickert, Jirí Srba

Acta Informatica, 2015

2013

On Refinements of Boolean and Parametric Modal Transition Systems.

Jan Kretínský, Salomon Sickert

Proceedings of the Theoretical Aspects of Computing - ICTAC 2013, 2013

MoTraS: A Tool for Modal Transition Systems and Their Extensions.

Jan Kretínský, Salomon Sickert

Proceedings of the Automated Technology for Verification and Analysis, 2013