Salomon Sickert

Orcid: 0000-0002-0280-8981

Affiliations:
  • Hebrew University of Jerusalem, Israel
  • Technische Universität München, Germany (former)


According to our database1, Salomon Sickert authored at least 32 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021.
Int. J. Softw. Tools Technol. Transf., October, 2024

Efficient Normalization of Linear Temporal Logic.
J. ACM, April, 2024

AutoCorres2.
Arch. Formal Proofs, 2024

2022
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata.
Int. J. Softw. Tools Technol. Transf., 2022

Certifying DFA Bounds for Recognition and Separation.
Innov. Syst. Softw. Eng., 2022

Practical Applications of the Alternating Cycle Decomposition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

On the Translation of Automata to Linear Temporal Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

A Simple Rewrite System for the Normalization of Linear Temporal Logic.
Proceedings of the Principles of Systems Design, 2022

2021
Certifying Inexpressibility.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
A Unified Translation of Linear Temporal Logic to ω-Automata.
J. ACM, 2020

An Efficient Normalisation Procedure for Linear Temporal Logic: Isabelle/HOL Formalisation.
Arch. Formal Proofs, 2020

Practical synthesis of reactive systems from LTL specifications via parity games.
Acta Informatica, 2020

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata.
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.
PhD thesis, 2019

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

A Compositional and Unified Translation of LTL into ω-Automata.
Arch. Formal Proofs, 2019

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

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

One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Strix: Explicit Reactive Synthesis Strikes Back!
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Owl: A Library for ω-Words, Automata, and LTL.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
LTL to Deterministic Emerson-Lei Automata.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2016
From LTL to deterministic automata - A safraless compositional approach.
Formal Methods Syst. Des., 2016

Linear Temporal Logic.
Arch. Formal Proofs, 2016

Limit-Deterministic Büchi Automata for Linear Temporal Logic.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata.
Arch. Formal Proofs, 2015

Refinement checking on parametric modal transition systems.
Acta Informatica, 2015

2013
On Refinements of Boolean and Parametric Modal Transition Systems.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2013, 2013

MoTraS: A Tool for Modal Transition Systems and Their Extensions.
Proceedings of the Automated Technology for Verification and Analysis, 2013


  Loading...