Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mouhammad Sakr"'
Autor:
Swen Jacobs, Mouhammad Sakr
Publikováno v:
Computer Aided Verification ISBN: 9783030816872
CAV (2)
CAV (2)
AIGEN is an open source tool for the generation of transition systems in a symbolic representation. To ensure diversity, it employs a uniform random sampling over the space of all Boolean functions with a given number of variables. AIGEN relies on re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::306e3bdae89f621c092d5e5ad8a5961f
https://doi.org/10.1007/978-3-030-81688-9_20
https://doi.org/10.1007/978-3-030-81688-9_20
Publikováno v:
ACM Transactions on Embedded Computing Systems. 17:1-25
We consider the subtractive model repair problem : given a finite Kripke structure M and a CTL formula η, determine if M contains a substructure M ′ that satisfies η. Thus, M can be “repaired” to satisfy eta by deleting some transitions and s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02cfc192a61ddaef64c87d22091fbf4d
https://doi.org/10.1145/3147426
https://doi.org/10.1145/3147426
Publikováno v:
VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2020
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
We investigate the satisfaction of specifications in Prompt Linear Temporal Logic (Prompt-LTL) by concurrent systems. Prompt-LTL is an extension of LTL that allows to specify parametric bounds on the satisfaction of eventualities, thus adding a quant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f99bcd8b3bf2ee16927949e828627f5
http://arxiv.org/abs/1911.03122
http://arxiv.org/abs/1911.03122
Autor:
Swen Jacobs, Mouhammad Sakr
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
ATVA
We present an algorithm for solving two-player safety games that combines a mixed forward/backward search strategy with a symbolic representation of the state space. By combining forward and backward exploration, our algorithm can synthesize strategi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a94a83421239d6b20cb0c92ddbf54302
https://doi.org/10.1007/978-3-030-01090-4_13
https://doi.org/10.1007/978-3-030-01090-4_13
Autor:
Swen Jacobs, Mouhammad Sakr
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319737201
VMCAI
VMCAI
We study cutoff results for parameterized verification and synthesis of guarded protocols, as introduced by Emerson and Kahlon (2000). Guarded protocols describe systems of processes whose transitions are enabled or disabled depending on the existenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::487d650edb4ee4e5c5df57f245f20c7d
https://doi.org/10.1007/978-3-319-73721-8_12
https://doi.org/10.1007/978-3-319-73721-8_12