108 search results - page 22 / 22 » Specifying and checking component usage |
214
Voted
POPL
2008
ACM
16 years 27 days ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
122
Voted
ICFP
2005
ACM
16 years 16 days ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
98
Voted
CORR
2004
Springer
15 years 13 days ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...