17 search results - page 3 / 4 » Reasoning about Object-based Calculi in (Co)Inductive Type T... |
PLDI
2003
ACM
13 years 11 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
IGPL
2010
13 years 4 months ago
2010
This paper is a contribution to the formalisation of Thagard’s coherence theory. The term coherence is defined as the quality or the state of cohering, especially a logical, ord...
SIGSOFT
2005
ACM
14 years 7 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
FLAIRS
2008
13 years 8 months ago
2008
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...