Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Lennart Beringer"'
Autor:
Lennart Beringer, Andrew W. Appel
Publikováno v:
Formal Methods in System Design. 58:322-345
Representation predicates enable data abstraction in separation logic, but when the same concrete implementation may need to be abstracted in different ways, one needs a notion of subsumption. We demonstrate function-specification subtyping, analogou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d3604aaab91ff16164d16c88ed5b332
https://doi.org/10.1007/s10703-020-00353-1
https://doi.org/10.1007/s10703-020-00353-1
Autor:
Lennart Beringer
Publikováno v:
Leveraging Applications of Formal Methods, Verification and Validation. Software Engineering ISBN: 9783031197550
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9510201122578b1a87f0796dc85a84a
https://doi.org/10.1007/978-3-031-19756-7_14
https://doi.org/10.1007/978-3-031-19756-7_14
Autor:
Lennart Beringer
Publikováno v:
SSA-based Compiler Design ISBN: 9783030805142
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ff181d456b754fb13cd92e298e629c4
https://doi.org/10.1007/978-3-030-80515-9_6
https://doi.org/10.1007/978-3-030-80515-9_6
Publikováno v:
Journal of Automated Reasoning. 61:367-422
The Verified Software Toolchain builds foundational machine-checked proofs of the functional correctness of C programs. Its program logic, Verifiable C, is a shallowly embedded higher-order separation Hoare logic which is proved sound in Coq with res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d198d3e3f04594f9a7cdaf13cc3e700
https://doi.org/10.1007/s10817-018-9457-5
https://doi.org/10.1007/s10817-018-9457-5
Autor:
Lennart Beringer, Andrew W. Appel
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030309411
FM
FM
Representation predicates enable data abstraction in separation logic, but when the same concrete implementation may need to be abstracted in different ways, one needs a notion of subsumption. We demonstrate function-specification subtyping, analogou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::801e3a925490c5e7d5668e0bde671d19
https://doi.org/10.1007/978-3-030-30942-8_34
https://doi.org/10.1007/978-3-030-30942-8_34
Autor:
Yao Li, Yishuai Li, Li-yao Xia, William Mansky, Benjamin C. Pierce, Nicolas Koh, Wolf Honoré, Lennart Beringer, Steve Zdancewic
We present the first formal verification of a networked server implemented in C. Interaction trees, a general structure for representing reactive computations, are used to tie together disparate verification and testing tools (Coq, VST, and QuickChic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe885bf3abe5791f0a9d5609ee07a7b1
http://arxiv.org/abs/1811.11911
http://arxiv.org/abs/1811.11911
Autor:
Zhong Shao, Steve Zdancewic, Stephanie Weirich, Adam Chlipala, Lennart Beringer, Benjamin C. Pierce, Andrew W. Appel
Publikováno v:
Prof. Chlipala via Phoebe Ayers
BASE-Bielefeld Academic Search Engine
BASE-Bielefeld Academic Search Engine
We introduce our efforts within the project ‘The science of deep specification’ to work out the key formal underpinnings of industrial-scale formal specifications of software and hardware components, anticipating a world where large verified syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9ec72219d83e01c556c168e5f39fe4f
https://europepmc.org/articles/PMC5597730/
https://europepmc.org/articles/PMC5597730/
Autor:
Matthew Green, Naphat Sanguansin, Katherine Ye, Lennart Beringer, Adam Petcher, Andrew W. Appel
We have formalized the functional specification of HMAC-DRBG (NIST 800-90A), and we have proved its cryptographic security--that its output is pseudorandom--using a hybrid game-based proof. We have also proved that the mbedTLS implementation (C progr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41ce98e9a8e4356bdef04a8298191fd6
http://arxiv.org/abs/1708.08542
http://arxiv.org/abs/1708.08542
Publikováno v:
Computer Languages, Systems & Structures. 39:49-65
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, and usually contributes to other analyses or code optimizations. In rece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::868cb75df69cacb5470a7ea767dc8d1b
https://doi.org/10.1016/j.cl.2013.01.001
https://doi.org/10.1016/j.cl.2013.01.001
Publikováno v:
ICFP
We present VeriStar , a verified theorem prover for a decidable subset of separation logic. Together with VeriSmall [3], a proved-sound Smallfoot-style program analysis for C minor, VeriStar demonstrates that fully machine-checked static analyses equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66d97780790849e1ee297627f24aa583
https://doi.org/10.1145/2398856.2364531
https://doi.org/10.1145/2398856.2364531