8132 search results - page 255 / 1627 » Dependability, Abstraction, and Programming |
202
click to vote
APSEC
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper, we propose four slicing methods using both static and dynamic analysis information. (1) StatementMark Slice : removes the unnecessary statements using an execution ...
147
click to vote
FMICS
2009
Springer
16 years 1 months ago
2009
Springer
In joint work with Cristiano Calcagno, Peter O’Hearn, and Hongseok Yang, we have introduced bi-abductive inference and its use in reasoning about heap manipulating programs [5]. ...
176
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
174
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
185
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...