POPL
2007
ACM
15 years 22 days ago
2007
ACM
POPL
2007
ACM
15 years 22 days ago
2007
ACM
104
click to vote
POPL
2007
ACM
15 years 22 days ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
POPL
2007
ACM
15 years 22 days ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
POPL
2007
ACM
15 years 22 days ago
2007
ACM
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
103
click to vote
POPL
2007
ACM
15 years 22 days ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
POPL
2007
ACM
15 years 22 days ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
106
click to vote
POPL
2007
ACM
15 years 22 days ago
2007
ACM
Race detection algorithms for multi-threaded programs using the common lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a p...
POPL
2007
ACM
15 years 22 days ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
POPL
2007
ACM
15 years 22 days ago
2007
ACM
