default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalomon Sickert
Person information
- affiliation: Hebrew University of Jerusalem, Israel
- affiliation (former): Technische Universität München, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Matthew Brecknell, David Greenaway, Johannes Hölzl, Fabian Immler, Gerwin Klein, Rafal Kolanski, Japheth Lim, Michael Norrish, Norbert Schirmer, Salomon Sickert, Thomas Sewell, Harvey Tuch, Simon Wimmer:
AutoCorres2. Arch. Formal Proofs 2024 (2024)- [j12]Javier Esparza
, Rubén Rubio, Salomon Sickert:
Efficient Normalization of Linear Temporal Logic. J. ACM 71(2): 16:1-16:42 (2024) - [j11]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:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. Int. J. Softw. Tools Technol. Transf. 26(5): 551-567 (2024) - 2023
- [i13]Javier Esparza, Rubén Rubio, Salomon Sickert:
A Simple Rewrite System for the Normalization of Linear Temporal Logic. CoRR abs/2304.08872 (2023) - [i12]Javier Esparza, Rubén Rubio, Salomon Sickert:
Efficient Normalization of Linear Temporal Logic. CoRR abs/2310.12613 (2023) - 2022
- [j10]Orna Kupferman, Nir Lavee, Salomon Sickert:
Certifying DFA Bounds for Recognition and Separation. Innov. Syst. Softw. Eng. 18(3): 405-416 (2022) - [j9]Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert:
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata. Int. J. Softw. Tools Technol. Transf. 24(4): 635-659 (2022) - [c17]Javier Esparza, Rubén Rubio, Salomon Sickert:
A Simple Rewrite System for the Normalization of Linear Temporal Logic. Principles of Systems Design 2022: 208-227 - [c16]Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. FoSSaCS 2022: 140-160 - [c15]Antonio Casares, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert:
Practical Applications of the Alternating Cycle Decomposition. TACAS (2) 2022: 99-117 - [i11]Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. CoRR abs/2201.10267 (2022) - [i10]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:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR abs/2206.00251 (2022) - 2021
- [c14]Orna Kupferman, Nir Lavee, Salomon Sickert:
Certifying DFA Bounds for Recognition and Separation. ATVA 2021: 48-64 - [c13]Orna Kupferman, Salomon Sickert:
Certifying Inexpressibility. FoSSaCS 2021: 385-405 - [i9]Orna Kupferman, Salomon Sickert:
Certifying Inexpressibility. CoRR abs/2101.08756 (2021) - [i8]Orna Kupferman, Nir Lavee, Salomon Sickert:
Certifying DFA Bounds for Recognition and Separation. CoRR abs/2107.01566 (2021) - 2020
- [j8]Michael Luttenberger, Philipp J. Meyer, Salomon Sickert:
Practical synthesis of reactive systems from LTL specifications via parity games. Acta Informatica 57(1-2): 3-36 (2020) - [j7]Salomon Sickert:
An Efficient Normalisation Procedure for Linear Temporal Logic: Isabelle/HOL Formalisation. Arch. Formal Proofs 2020 (2020) - [j6]Javier Esparza, Jan Kretínský, Salomon Sickert:
A Unified Translation of Linear Temporal Logic to ω-Automata. J. ACM 67(6): 33:1-33:61 (2020) - [c12]Salomon Sickert, Javier Esparza:
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. LICS 2020: 831-844 - [i7]Salomon Sickert, Javier Esparza:
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. CoRR abs/2005.00472 (2020)
2010 – 2019
- 2019
- [b1]Salomon Sickert:
A Unified Translation of Linear Temporal Logic to ω-Automata. Technical University of Munich, Germany, 2019 - [j5]Benedikt Seidl, Salomon Sickert:
A Compositional and Unified Translation of LTL into ω-Automata. Arch. Formal Proofs 2019 (2019) - [c11]Julian Brunner, Benedikt Seidl, Salomon Sickert:
A Verified and Compositional Translation of LTL to Deterministic Rabin Automata. ITP 2019: 11:1-11:19 - [i6]Michael Luttenberger, Philipp J. Meyer, Salomon Sickert:
Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games. CoRR abs/1903.12576 (2019) - [i5]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:
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. CoRR abs/1904.07736 (2019) - 2018
- [c10]Jan Kretínský, Tobias Meggendorfer, Salomon Sickert:
Owl: A Library for ω-Words, Automata, and LTL. ATVA 2018: 543-550 - [c9]Jan Kretínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler:
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton. CAV (1) 2018: 567-577 - [c8]Philipp J. Meyer, Salomon Sickert, Michael Luttenberger:
Strix: Explicit Reactive Synthesis Strikes Back! CAV (1) 2018: 578-586 - [c7]Javier Esparza, Jan Kretínský, Salomon Sickert:
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. LICS 2018: 384-393 - [i4]Javier Esparza, Jan Kretínský, Salomon Sickert:
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. CoRR abs/1805.00748 (2018) - [i3]Jan Kretínský, Tobias Meggendorfer, Salomon Sickert:
LTL Store: Repository of LTL formulae from literature and case studies. CoRR abs/1807.03296 (2018) - 2017
- [c6]Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert:
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. TACAS (1) 2017: 426-442 - [c5]David Müller, Salomon Sickert:
LTL to Deterministic Emerson-Lei Automata. GandALF 2017: 180-194 - [i2]Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert:
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. CoRR abs/1701.06103 (2017) - 2016
- [j4]Salomon Sickert:
Linear Temporal Logic. Arch. Formal Proofs 2016 (2016) - [j3]Javier Esparza, Jan Kretínský, Salomon Sickert:
From LTL to deterministic automata - A safraless compositional approach. Formal Methods Syst. Des. 49(3): 219-271 (2016) - [c4]Salomon Sickert, Jan Kretínský:
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata. ATVA 2016: 130-137 - [c3]Salomon Sickert, Javier Esparza, Stefan Jaax, Jan Kretínský:
Limit-Deterministic Büchi Automata for Linear Temporal Logic. CAV (2) 2016: 312-332 - [e1]Javier Esparza, Orna Grumberg, Salomon Sickert:
Dependable Software Systems Engineering. NATO Science for Peace and Security Series - D: Information and Communication Security 45, IOS Press 2016, ISBN 978-1-61499-626-2 [contents] - 2015
- [j2]Nikola Benes, Jan Kretínský, Kim G. Larsen, Mikael H. Møller, Salomon Sickert, Jirí Srba:
Refinement checking on parametric modal transition systems. Acta Informatica 52(2-3): 269-297 (2015) - [j1]Salomon Sickert:
Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata. Arch. Formal Proofs 2015 (2015) - 2013
- [c2]Jan Kretínský, Salomon Sickert:
MoTraS: A Tool for Modal Transition Systems and Their Extensions. ATVA 2013: 487-491 - [c1]Jan Kretínský, Salomon Sickert:
On Refinements of Boolean and Parametric Modal Transition Systems. ICTAC 2013: 213-230 - [i1]Jan Kretínský, Salomon Sickert:
On Refinements of Boolean and Parametric Modal Transition Systems. CoRR abs/1304.5278 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
