3713 search results - page 203 / 743 » Constructing a Calculus of Programs |
186
click to vote
ENTCS
2006
15 years 6 months ago
2006
In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a mode...
173
click to vote
CSL
2007
Springer
16 years 21 days ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
189
click to vote
FOSSACS
2007
Springer
16 years 20 days ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
163
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
227
click to vote
AC
1992
Springer
15 years 10 months ago
1992
Springer
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...