default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyrat Khalimov 0001
Person information
- affiliation: Université libre de Bruxelles, Brussels, Belgium
Other persons with the same name
- Ayrat Khalimov 0002 — Innopolis University, Innopolis, Russia
- Ayrat Khalimov 0003 — Clausthal University of Technology, Germany
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]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
Church synthesis on register automata over linearly ordered data domains. Formal Methods Syst. Des. 61(2): 290-337 (2022) - [c14]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders. ICALP 2022: 122:1-122:19 - [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
- [c13]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
Church Synthesis on Register Automata over Linearly Ordered Data Domains. STACS 2021: 28:1-28:16 - [i9]Ayrat Khalimov, Emmanuel Filiot, Léo Exibard:
Transducer Synthesis from Universal Register Automata in (N, >). CoRR abs/2105.09978 (2021) - 2020
- [i8]Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
Register Games on Infinite Ordered Data Domains. CoRR abs/2004.12141 (2020)
2010 – 2019
- 2019
- [c12]Ayrat Khalimov, Orna Kupferman:
Register-Bounded Synthesis. CONCUR 2019: 25:1-25:16 - [i7]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
- [c11]Ayrat Khalimov, Benedikt Maderbacher, Roderick Bloem:
Bounded Synthesis of Register Transducers. ATVA 2018: 494-510 - [i6]Ayrat Khalimov:
Reactive Synthesis: Branching Logics and Parameterized Systems. CoRR abs/1808.09430 (2018) - [i5]Ayrat Khalimov, Benedikt Maderbacher, Roderick Bloem:
Bounded Synthesis of Register Transducers. CoRR abs/1809.05017 (2018) - 2017
- [c10]Ayrat Khalimov, Roderick Bloem:
Bounded Synthesis for Streett, Rabin, and \text CTL^*. CAV (2) 2017: 333-352 - [c9]Roderick Bloem, Sven Schewe, Ayrat Khalimov:
CTL* synthesis via LTL synthesis. SYNT@CAV 2017: 4-22 - [c8]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 - [i4]Patrick Klampfl, Robert Könighofer, Roderick Bloem, Ayrat Khalimov, Aiman Abu-Yonis, Shiri Moran:
OpenSEA: Semi-Formal Methods for Soft Error Analysis. CoRR abs/1712.04291 (2017) - 2016
- [j1]Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Sasha Rubin, Helmut Veith, Josef Widder:
Decidability in Parameterized Verification. SIGACT News 47(2): 53-64 (2016) - [c7]Simon Außerlechner, Swen Jacobs, Ayrat Khalimov:
Tight Cutoffs for Guarded Protocols with Fairness. VMCAI 2016: 476-494 - [c6]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 - 2015
- [b1]Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Sasha Rubin, Helmut Veith, Josef Widder:
Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2015, ISBN 978-3-031-00883-2 - [c5]Ayrat Khalimov:
Specification Format for Reactive Synthesis Problems. SYNT 2015: 112-119 - [i3]Simon Außerlechner, Swen Jacobs, Ayrat Khalimov:
Tight Cutoffs for Guarded Protocols with Fairness. CoRR abs/1505.03273 (2015) - 2014
- [c4]Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. VMCAI 2014: 262-281 - [c3]Roderick Bloem, Swen Jacobs, Ayrat Khalimov:
Parameterized Synthesis Case Study: AMBA AHB. SYNT 2014: 68-83 - [i2]Roderick Bloem, Swen Jacobs, Ayrat Khalimov:
Parameterized Synthesis Case Study: AMBA AHB. CoRR abs/1406.7608 (2014) - 2013
- [c2]Ayrat Khalimov, Swen Jacobs, Roderick Bloem:
PARTY Parameterized Synthesis of Token Rings. CAV 2013: 928-933 - [c1]Ayrat Khalimov, Swen Jacobs, Roderick Bloem:
Towards Efficient Parameterized Synthesis. VMCAI 2013: 108-127 - [i1]Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. CoRR abs/1311.4425 (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:34 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:
