4 search results - page 1 / 1 » Modular reasoning about invariants over shared state with in... |
PLPV
2010
ACM
14 years 1 months ago
2010
ACM
Reasoning about object-oriented programs is difficult since such programs usually involve aliasing, and it is not easy to identify the ways objects can relate to each other and t...
ECOOP
2008
Springer
13 years 5 months ago
2008
Springer
Shared mutable objects pose grave challenges in reasoning, especially for data abstraction and modularity. This paper presents a novel logic for erroravoiding partial correctness o...
ICTAC
2010
Springer
13 years 2 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...