Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Salvatore La Torre"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 260-274 (2014)
Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a m
Externí odkaz:
https://doaj.org/article/a41b10e29c2744f9b2a27c42b6a8f748
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 87, Iss Proc. FIT 2012, Pp 34-47 (2012)
We exhibit assertion-preserving (reachability preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program is that it
Externí odkaz:
https://doaj.org/article/4ee7c4fc6c054bd0a713c28e5c607f94
Publikováno v:
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f4d52d5db96bb294ee1ce2fe34a79cb
https://doi.org/10.1145/3551349.3559523
https://doi.org/10.1145/3551349.3559523
Bounded verification techniques such as bounded model checking (BMC) have successfully been used for many practical program analysis problems, but concurrency still poses a challenge. Here, we describe a new approach to BMC of sequentially consistent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35b56d128b9b87be3702a52c979ab977
http://hdl.handle.net/11695/100659
http://hdl.handle.net/11695/100659
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 260-274 (2014)
GandALF
GandALF
Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3621054352994369535d59553ae70961
https://doi.org/10.1016/j.ic.2016.07.007
https://doi.org/10.1016/j.ic.2016.07.007
Publikováno v:
ASE
Swarm-based verification methods split a verification problem into a large number of independent simpler tasks and so exploit the availability of large numbers of cores to speed up verification. Lazy-CSeq is a BMC-based bug-finding tool for C program
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05c6a978357dc5fd8924746eef205439
http://hdl.handle.net/11695/96116
http://hdl.handle.net/11695/96116
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783642130885
LATA
LATA
In this paper we focus on the role of parametric constants in real-time temporal logic and introduce the logic PMITL as a parametric extension of MITL. For this logic, we study decision problems which are the analogues of satisfiability, validity and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::573f0349df3ced670a538c0a84934a28
https://doi.org/10.1016/j.tcs.2014.11.019
https://doi.org/10.1016/j.tcs.2014.11.019
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662545799
TACAS (2)
TACAS (2)
Lazy sequentialization has emerged as one of the most effective techniques to find bugs in concurrent programs. However, the size of the shared global and thread-local state still poses a problem for further scaling. We there- fore use abstract inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7299db7dd83cab6b6404c68690cb1435
https://eprints.soton.ac.uk/406349/
https://eprints.soton.ac.uk/406349/
Publikováno v:
Networked Systems ISBN: 9783319596464
NETYS
NETYS
Lazy sequentialization has proven to be one of the most effective techniques for concurrent program verification. The Lazy-CSeq sequentialization tool performs a “lazy” code-to-code translation from a concurrent program into an equivalent non-det
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c142a3ec2fbcc81bea90468c423087ee
https://doi.org/10.1007/978-3-319-59647-1_20
https://doi.org/10.1007/978-3-319-59647-1_20