16 search results - page 3 / 4 » Hoare type theory, polymorphism and separation |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
POPL
1996
ACM
13 years 11 months ago
1996
ACM
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
ICTAC
2010
Springer
13 years 5 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 ...
PLPV
2011
ACM
12 years 10 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
ML
2006
ACM
14 years 1 months ago
2006
ACM
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...