default search action
Felix Klein 0001
Person information
- affiliation: Saarland University, Computer Science Department, Saarbrücken, Germany
- not to be confused with: Felix Klein 0002
Other persons with the same name
- Felix Klein 0002 — Saarland University, Saarbrücken, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]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) - 2022
- [j2]Bernd Finkbeiner, Felix Klein, Niklas Metzger:
Live synthesis. Innov. Syst. Softw. Eng. 18(3): 443-454 (2022) - [i13]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
- [c13]Bernd Finkbeiner, Felix Klein, Niklas Metzger:
Live Synthesis. ATVA 2021: 153-169 - [i12]Gideon Geier, Philippe Heim, Felix Klein, Bernd Finkbeiner:
Syntroids: Synthesizing a Game for FPGAs using Temporal Logic Specifications. CoRR abs/2101.07232 (2021) - [i11]Bernd Finkbeiner, Felix Klein, Niklas Metzger:
Live Synthesis. CoRR abs/2107.01136 (2021) - 2020
- [b1]Felix Klein:
Synthesizing stream control. Saarland University, Saarbrücken, Germany, 2020
2010 – 2019
- 2019
- [c12]Bernd Finkbeiner, Felix Klein, Ruzica Piskac
Temporal Stream Logic: Synthesis Beyond the Bools. CAV (1) 2019: 609-629 - [c11]Gideon Geier, Philippe Heim
Syntroids: Synthesizing a Game for FPGAs using Temporal Logic Specifications. FMCAD 2019: 138-146 - [c10]Bernd Finkbeiner, Felix Klein, Ruzica Piskac
Synthesizing functional reactive programs. Haskell@ICFP 2019: 162-175 - [i10]Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. CoRR abs/1904.07736 (2019) - [i9]Bernd Finkbeiner, Felix Klein, Ruzica Piskac, Mark Santolucito:
Synthesizing Functional Reactive Programs. CoRR abs/1905.09825 (2019) - 2018
- [c9]Carsten Gerstacker, Felix Klein, Bernd Finkbeiner:
Bounded Synthesis of Reactive Programs. ATVA 2018: 441-457 - [i8]Bernd Finkbeiner, Felix Klein:
Reactive Synthesis: Towards Output-Sensitive Algorithms. CoRR abs/1803.10104 (2018) - [i7]Bernd Finkbeiner, Felix Klein, Ruzica Piskac, Mark Santolucito:
Vehicle Platooning Simulations with Functional Reactive Programming. CoRR abs/1803.10383 (2018) - [i6]Carsten Gerstacker, Felix Klein, Bernd Finkbeiner:
Bounded Synthesis of Reactive Programs. CoRR abs/1807.09047 (2018) - 2017
- [c8]Bernd Finkbeiner, Felix Klein, Ruzica Piskac
Vehicle Platooning Simulations with Functional Reactive Programming. SCAV@CPSWeek 2017: 43-47 - [c7]Swen Jacobs
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. SYNT@CAV 2017: 116-143 - [p1]Bernd Finkbeiner, Felix Klein:
Reactive Synthesis: Towards Output-Sensitive Algorithms. Dependable Software Systems Engineering 2017: 25-43 - [i5]Bernd Finkbeiner, Felix Klein, Ruzica Piskac, Mark Santolucito:
Temporal Stream Logic: Synthesis beyond the Bools. CoRR abs/1712.00246 (2017) - 2016
- [j1]Felix Klein, Martin Zimmermann
How Much Lookahead is Needed to Win Infinite Games? Log. Methods Comput. Sci. 12(3) (2016) - [c6]Bernd Finkbeiner, Felix Klein:
Bounded Cycle Synthesis. CAV (1) 2016: 118-135 - [c5]Felix Klein, Martin Zimmermann
Prompt Delay. FSTTCS 2016: 43:1-43:14 - [c4]Swen Jacobs
A High-Level LTL Synthesis Format: TLSF v1.1. SYNT@CAV 2016: 112-132 - [c3]Swen Jacobs
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SYNT@CAV 2016: 149-177 - [i4]Swen Jacobs, Felix Klein:
A High-Level LTL Synthesis Format: TLSF v1.0. CoRR abs/1601.05228 (2016) - [i3]Felix Klein, Martin Zimmermann:
Prompt Delay. CoRR abs/1602.05045 (2016) - [i2]Bernd Finkbeiner, Felix Klein:
Bounded Cycle Synthesis. CoRR abs/1605.01511 (2016) - 2015
- [c2]Felix Klein, Martin Zimmermann
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CSL 2015: 519-533 - [c1]Felix Klein, Martin Zimmermann
How Much Lookahead is Needed to Win Infinite Games? ICALP (2) 2015: 452-463 - [i1]Felix Klein, Martin Zimmermann:
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CoRR abs/1504.02627 (2015)
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:33 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: