Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Oukseh Lee"'
Publikováno v:
New Generation Computing. 2004, Vol. 22 Issue 1, p1-36. 36p.
Publikováno v:
Computer Aided Verification ISBN: 9783642221095
CAV
CAV
We call a data structure overlaid, if a node in the structure includes links for multiple data structures and these links are intended to be used at the same time. In this paper, we present a static program analysis for overlaid data structures. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c75964960b76cd3912f779a2d8319136
https://ora.ox.ac.uk/objects/uuid:49b80d6b-b1f4-44bc-bcbf-fc197b77ea88
https://ora.ox.ac.uk/objects/uuid:49b80d6b-b1f4-44bc-bcbf-fc197b77ea88
Publikováno v:
Formal Methods in System Design. 41:4-24
We present a static program analysis for overlaid data structures such that a node in the structure includes links for multiple data structures and these links are intended to be used at the same time. These overlaid data structures are frequently us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45285fd5d8ba1b8833373fe5a965738a
https://doi.org/10.1007/s10703-012-0151-7
https://doi.org/10.1007/s10703-012-0151-7
Publikováno v:
Science of Computer Programming. 58(1-2):141-178
We present a static analysis that estimates reusable memory cells and a source-level transformation that adds explicit memory reuse commands into the program text. For benchmark ML programs, our analysis and transformation system achieves a memory re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f5dcc70dff120ef90b3d789aed710dc
Publikováno v:
Information Processing Letters. 81:179-185
This article is about our Þndings when we tried to derive a modular version from a whole-program control-sow analysis (CFA). Deriving a modular version from a whole-program kCFA makes the resulting analysis polyvariant at modulelevel. Hence the corr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d94aca15f7a6668ca5b4ab3e3035b45
https://doi.org/10.1016/s0020-0190(01)00223-x
https://doi.org/10.1016/s0020-0190(01)00223-x
Autor:
Kwangkeun Yi, Oukseh Lee
Publikováno v:
ACM Transactions on Programming Languages and Systems. 20:707-723
The Hindley/Milner let-polymorphic type inference system has two different algorithms: one is the de facto standard Algorithm 𝒲 that is bottom-up (or context-insensitive), and the other is a “folklore” algorithm that is top-down (or context-se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8597601e13edb96e93731b0a500d9544
https://doi.org/10.1145/291891.291892
https://doi.org/10.1145/291891.291892
Autor:
Peter W. O'Hearn, Josh Berdine, Dino Distefano, Byron Cook, Oukseh Lee, Hongseok Yang, Cristiano Calcagno
Publikováno v:
Computer Aided Verification ISBN: 9783540705437
CAV
CAV
Pointer safety faults in device drivers are one of the leading causes of crashes in operating systems code. In principle, shape analysis tools can be used to prove the absence of this type of error. In practice, however, shape analysis is not used du
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::418ff6aa5bf872bdc19630e78b12d459
https://doi.org/10.1007/978-3-540-70545-1_36
https://doi.org/10.1007/978-3-540-70545-1_36
Publikováno v:
2008 10th International Conference on Advanced Communication Technology.
We devise an automatic verification tool for embedded Linux driver source code. Our tool can verify whether a device driver is correctly implemented without violating API usage rules, causing pointer errors, and leaking memory. The verification engin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc66a3caa9660a54b1e61df8d2a34af2
https://doi.org/10.1109/icact.2008.4493722
https://doi.org/10.1109/icact.2008.4493722