Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Andrei Marian Dan"'
Autor:
Gagandeep Singh, Mislav Balunovic, Wonryong Ryou, Martin Vechev, Andrei Marian Dan, Jiayu Chen
Publikováno v:
Lecture Notes in Computer Science, 12759
Computer Aided Verification
Computer Aided Verification ISBN: 9783030816841
CAV (1)
Computer Aided Verification
Computer Aided Verification ISBN: 9783030816841
CAV (1)
We present a scalable and precise verifier for recurrent neural networks, called PROVER based on two novel ideas: (i) a method to compute a set of polyhedral abstractions for the non-convex and nonlinear recurrent update functions by combining sampli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3a6b636f8afd19c75872dc374370797
https://hdl.handle.net/20.500.11850/519266
https://hdl.handle.net/20.500.11850/519266
Publikováno v:
Computer Languages, Systems & Structures. 47:62-76
We present a new abstract interpretation based approach for automatically verifying concurrent programs running on relaxed memory models. Our approach is based on three key insights: (i) Although the behaviors of relaxed memory models (e.g., TSO and
Autor:
Dana Drachsler-Cohen, Petar Tsankov, Andrei Marian Dan, Martin Vechev, Florian Bünzli, Arthur Gervais
Publikováno v:
CCS
CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security
CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security
Permissionless blockchains allow the execution of arbitrary programs (called smart contracts), enabling mutually untrusted entities to interact without relying on trusted third parties. Despite their potential, repeated security concerns have shaken
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319737201
VMCAI
VMCAI
Remote Memory Access (RMA) networks are emerging as a promising basis for building performant large-scale systems such as MapReduce, scientific computing applications, and others. To achieve this performance, RMA networks exhibit relaxed memory consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92a4f5afc2de6584e97a9bf01f7dea73
https://doi.org/10.1007/978-3-319-73721-8_3
https://doi.org/10.1007/978-3-319-73721-8_3
Publikováno v:
Computer Aided Verification ISBN: 9783319633893
CAV (2)
CAV (2)
Static analysis tools are increasingly important for ensuring code quality. Ideally, all warnings from a static analysis would be addressed, but the volume of warnings and false positives usually makes this effort prohibitive. We present techniques f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d30fd6ebf0a02cec952aabfd1865930a
https://doi.org/10.1007/978-3-319-63390-9_27
https://doi.org/10.1007/978-3-319-63390-9_27
Publikováno v:
OOPSLA
Recent advances in networking hardware have led to a new generation of Remote Memory Access (RMA) networks in which processors from different machines can communicate directly, bypassing the operating system and allowing higher performance. Researche
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662460801
VMCAI
VMCAI
We present a new abstract interpretation based approach for automatically verifying concurrent programs running on relaxed memory models. Our approach is based on three key insights: i behaviors of relaxed models e.g. TSO and PSO are naturally captur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::793126b5e6bc1ae4bc60c3e5a2757829
https://doi.org/10.1007/978-3-662-46081-8_25
https://doi.org/10.1007/978-3-662-46081-8_25
Publikováno v:
Static Analysis ISBN: 9783319109350
SAS
SAS
We address the problem of fence inference in infinite-state concurrent programs running on relaxed memory models such as TSO and PSO. We present a novel algorithm that can automatically synthesize the necessary fences for infinite-state programs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5c63d499021333e58fa81832c4b31fe
https://doi.org/10.1007/978-3-319-10936-7_15
https://doi.org/10.1007/978-3-319-10936-7_15
Publikováno v:
Static Analysis ISBN: 9783642388552
SAS
SAS
We present a novel approach for predicate abstraction of programs running on relaxed memory models. Our approach consists of two steps.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6eec8dfaafe969a269578c784c73019e
https://doi.org/10.1007/978-3-642-38856-9_7
https://doi.org/10.1007/978-3-642-38856-9_7