Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMouhammad Sakr
Person information
- affiliation: University of Luxembourg, Luxembourg
- affiliation (former): American University of Beirut, Lebanon
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c6]Swen Jacobs, Mouhammad Sakr, Marcus Völp:
Automatic Repair and Deadlock Detection for Parameterized Systems. FMCAD 2022: 225-234- [i5]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
- [b1]Mouhammad Sakr:
Parameterized verification and repair of concurrent systems. Saarland University, Saarbrücken, Germany, 2021 - [c5]Swen Jacobs, Mouhammad Sakr:
AIGEN: Random Generation of Symbolic Transition Systems. CAV (2) 2021: 435-446 - [i4]Swen Jacobs, Mouhammad Sakr
, Marcus Völp:
Parameterized Repair of Concurrent Systems. CoRR abs/2111.03322 (2021) - 2020
- [j2]Swen Jacobs, Mouhammad Sakr:
A symbolic algorithm for lazy synthesis of eager strategies. Acta Informatica 57(1-2): 81-106 (2020) - [c4]Swen Jacobs, Mouhammad Sakr, Martin Zimmermann:
Promptness and Bounded Fairness in Concurrent and Parameterized Systems. VMCAI 2020: 337-359
2010 – 2019
- 2019
- [i3]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) - [i2]Swen Jacobs, Mouhammad Sakr, Martin Zimmermann:
Promptness and Bounded Fairness in Concurrent and Parameterized Systems. CoRR abs/1911.03122 (2019) - 2018
- [j1]Paul C. Attie, Kinan Dak-Al-Bab, Mouhammad Sakr:
Model and Program Repair via SAT Solving. ACM Trans. Embed. Comput. Syst. 17(2): 32:1-32:25 (2018) - [c3]Swen Jacobs, Mouhammad Sakr:
A Symbolic Algorithm for Lazy Synthesis of Eager Strategies. ATVA 2018: 211-227 - [c2]Swen Jacobs, Mouhammad Sakr:
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity. VMCAI 2018: 247-268 - 2017
- [i1]Swen Jacobs, Mouhammad Sakr:
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity. CoRR abs/1707.01369 (2017) - 2015
- [c1]Paul C. Attie, Ali Cherri, Kinan Dak-Al-Bab, Mouhammad Sakr, Jad Saklawi:
Model and program repair via SAT solving. MEMOCODE 2015: 148-157
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 2023-09-28 03:09 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:
