2722 search results - page 214 / 545 » The Model Evolution Calculus |
116
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
148
Voted
FOSSACS
2007
Springer
15 years 9 months 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...
125
Voted
TLCA
2005
Springer
15 years 9 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...
142
click to vote
CSL
2000
Springer
15 years 7 months ago
2000
Springer
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
115
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...