276 search results - page 39 / 56 » Abstraction and Refinement for Local Reasoning |
CC
2011
Springer
13 years 10 days ago
2011
Springer
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
ICSE
2000
IEEE-ACM
14 years 10 days ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...
CONTEXT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
CSL
2008
Springer
13 years 10 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...