Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Liana Hadarean"'
Autor:
Lee Pike, Aritra Sengupta, Martin Schäf, Michael Emmi, Willem Visser, Nicolás Rosner, Ranjit Jhala, Liana Hadarean
Publikováno v:
ESEC/SIGSOFT FSE
We present RAPID, an industrial-strength analysis developed at AWS that aims to help developers by providing automatic, fast and actionable feedback about correct usage of cloud-service APIs. RAPID’s design is based on the insight that cloud servic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6508955580adb9376bb9ec5b6581e7fe
https://doi.org/10.1145/3468264.3473934
https://doi.org/10.1145/3468264.3473934
Autor:
Andrew Gacek, Andy Warfield, Dan Peebles, Brad E. Marshall, Neha Rungta, Chriss Stephens, Cole Schlesinger, Malik Bouchet, Ranjit Jhala, Byron Cook, Anna Druzkina, Bryant Cutler, Liana Hadarean, Carsten Varming
Publikováno v:
ESEC/SIGSOFT FSE
Data stored in cloud services is highly sensitive and so access to it is controlled via policies written in domain-specific languages (DSLs). The expressiveness of these DSLs provides users flexibility to cover a wide variety of uses cases, however,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f80ccb3115bd7dfa265955048afb0229
https://doi.org/10.1145/3368089.3409728
https://doi.org/10.1145/3368089.3409728
Autor:
Liana Hadarean
Publikováno v:
ICST
Formal methods have been successfully applied in domains such as microprocessor hardware design and aerospace, e.g., proofs of security properties for helicopter control systems [4]. However, despite 50 years of research and development, we have not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2544e86cb914269151eac63ebf8c8ad
https://doi.org/10.1109/icst46399.2020.00009
https://doi.org/10.1109/icst46399.2020.00009
Publikováno v:
2016 Formal Methods in Computer-Aided Design (FMCAD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44edf555d6b801c080e34af28e9700d0
https://doi.org/10.1109/fmcad.2016.7886666
https://doi.org/10.1109/fmcad.2016.7886666
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662491218
VMCAI
VMCAI
Almost all applications of SAT solvers generate Boolean formulae from higher level expression graphs by encoding the semantics of each operation or relation into propositional logic. All non-trivial relations have many different possible encodings an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef5229596a62581ea36ea84021304d69
https://doi.org/10.1007/978-3-662-49122-5_26
https://doi.org/10.1007/978-3-662-49122-5_26
Publikováno v:
Formal Methods in System Design. 42:91-118
Producing and checking proofs from SMT solvers is currently the most feasible method for achieving high confidence in the correctness of solver results. The diversity of solvers and relative complexity of SMT over, say, SAT means that flexibility, as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::010f15eb7915f1a9b76ad32d49ed59c7
https://doi.org/10.1007/s10703-012-0163-3
https://doi.org/10.1007/s10703-012-0163-3
Publikováno v:
Computer Aided Verification ISBN: 9783319088662
CAV
CAV
The standard method for deciding bit-vector constraints is via eager reduction to propositional logic. This is usually done after first applying powerful rewrite techniques. While often efficient in practice, this method does not scale on problems fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::521cbcb1e61507c99d802290358a5b0a
https://doi.org/10.1007/978-3-319-08867-9_45
https://doi.org/10.1007/978-3-319-08867-9_45
Autor:
Clark Barrett, Christopher L. Conway, Morgan Deters, Liana Hadarean, Dejan Jovanović, Tim King, Andrew Reynolds, Cesare Tinelli
Publikováno v:
Computer Aided Verification ISBN: 9783642221095
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ddc2e61ada16a3247843d5d126cb7c3
https://doi.org/10.1007/978-3-642-22110-1_14
https://doi.org/10.1007/978-3-642-22110-1_14