276 search results - page 19 / 56 » Abstraction and Refinement for Local Reasoning |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
PLILP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
TCS
2008
13 years 7 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...