default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomain Brenguier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i10]Romain Brenguier, Lucas C. Cordeiro, Daniel Kroening, Peter Schrammel:
JBMC: A Bounded Model Checking Tool for Java Bytecode. CoRR abs/2302.02381 (2023)- [i9]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023)
2010 – 2019
- 2017
- [j3]Romain Brenguier, Jean-François Raskin
, Ocan Sankur:
Assume-admissible synthesis. Acta Informatica 54(1): 41-83 (2017) - [j2]Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The first reactive synthesis competition (SYNTCOMP 2014). Int. J. Softw. Tools Technol. Transf. 19(3): 367-390 (2017) - [c21]Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur:
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR 2017: 2:1-2:23 - [c20]Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur, Leander Tentrup:
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. SYNT@CAV 2017: 116-143 - 2016
- [c19]Romain Brenguier, Vojtech Forejt:
Decidability Results for Multi-objective Stochastic Games. ATVA 2016: 227-243 - [c18]Romain Brenguier:
Optimal Assumptions for Synthesis. CONCUR 2016: 8:1-8:15 - [c17]Romain Brenguier:
Robust Equilibria in Mean-Payoff Games. FoSSaCS 2016: 217-233 - [c16]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. FSTTCS 2016: 42:1-42:14 - [c15]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - [c14]Swen Jacobs, Roderick Bloem, Romain Brenguier, Ayrat Khalimov, Felix Klein, Robert Könighofer, Jens Kreber, Alexander Legg, Nina Narodytska, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SYNT@CAV 2016: 149-177 - [i8]Romain Brenguier:
Optimal Assumptions for Synthesis. CoRR abs/1604.03471 (2016) - [i7]Romain Brenguier, Vojtech Forejt:
Decidability Results for Multi-objective Stochastic Games. CoRR abs/1605.03811 (2016) - [i6]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. CoRR abs/1611.08677 (2016) - 2015
- [j1]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Pure Nash Equilibria in Concurrent Deterministic Games. Log. Methods Comput. Sci. 11(2) (2015) - [c13]Romain Brenguier, Jean-François Raskin:
Pareto Curves of Multidimensional Mean-Payoff Games. CAV (2) 2015: 251-267 - [c12]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CONCUR 2015: 100-113 - [c11]Swen Jacobs, Roderick Bloem, Romain Brenguier, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The Second Reactive Synthesis Competition (SYNTCOMP 2015). SYNT 2015: 27-57 - [c10]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Compositional Algorithms for Succinct Safety Games. SYNT 2015: 98-111 - [i5]Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The First Reactive Synthesis Competition (SYNTCOMP 2014). CoRR abs/1506.08726 (2015) - [i4]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CoRR abs/1507.00623 (2015) - [i3]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. CoRR abs/1512.05568 (2015) - 2014
- [c9]Romain Brenguier, Jean-François Raskin, Mathieu Sassolas:
The complexity of admissibility in Omega-regular games. CSL-LICS 2014: 23:1-23:10 - [c8]Romain Brenguier, Franck Cassez, Jean-François Raskin:
Energy and mean-payoff timed games. HSCC 2014: 283-292 - [c7]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
AbsSynthe: abstract synthesis from succinct safety specifications. SYNT 2014: 100-116 - 2013
- [c6]Romain Brenguier:
PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games. CAV 2013: 890-895 - [i2]Romain Brenguier, Jean-François Raskin, Mathieu Sassolas:
The Complexity of Admissibility in Omega-Regular Games. CoRR abs/1304.1682 (2013) - [i1]Romain Brenguier:
Robust Equilibria in Concurrent Games. CoRR abs/1311.7683 (2013) - 2012
- [b1]Romain Brenguier:
Equilibres de Nash dans les jeux concurrents : application aux jeux temporisés. (Nash equilibria in concurrent games : application to timed games). École normale supérieure de Cachan, France, 2012 - [c5]Romain Brenguier, Stefan Göller, Ocan Sankur:
A Comparison of Succinctly Represented Finite-State Systems. CONCUR 2012: 147-161 - [c4]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Concurrent Games with Ordered Objectives. FoSSaCS 2012: 301-315 - 2011
- [c3]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Nash Equilibria in Concurrent Games with Büchi Objectives. FSTTCS 2011: 375-386 - 2010
- [c2]Patricia Bouyer, Romain Brenguier, Nicolas Markey:
Nash Equilibria for Reachability Objectives in Multi-player Timed Games. CONCUR 2010: 192-206 - [c1]Patricia Bouyer, Romain Brenguier, Nicolas Markey:
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. FORMATS 2010: 62-76
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 2025-01-09 12:53 CET 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:
