69 search results - page 8 / 14 » Inductive Assertions and Operational Semantics |
FOSSACS
2001
Springer
14 years 1 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
IFM
2007
Springer
14 years 2 months ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
TYPES
1998
Springer
14 years 23 days ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...