17 search results - page 2 / 4 » aplas 2005 |
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
APLAS
2005
ACM
15 years 1 months ago
2005
ACM
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
101
click to vote
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment...
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...