skip to main content
Volume 41, Issue 6June 2006Proceedings of the 2006 PLDI Conference
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
ISSN:0362-1340
EISSN:1558-1160
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN
Reflects downloads up to 09 Feb 2025Bibliometrics
SESSION: Static analysis
article
Combining abstract interpreters

We present a methodology for automatically combining abstract interpreters over given lattices to construct an abstract interpreter for the combination of those lattices. This lends modularity to the process of design and implementation of abstract ...

article
Refinement-based context-sensitive points-to analysis for Java

We present a scalable and precise context-sensitive points-to analysis with three key properties: (1) filtering out of unrealizable paths, (2) a context-sensitive heap abstraction, and (3) a context-sensitive call graph. Previous work [21] has shown ...

article
Modular verification of assembly code with stack-based control abstractions

Runtime stacks are critical components of any modern software--they are used to implement powerful control structures such as function call/return, stack cutting and unwinding, coroutines, and thread context switch. Stack operations, however, are very ...

article
Termination proofs for systems code

Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and context-sensitive program analysis and provides capacity for large program ...

Subjects

Comments