ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. ...
Ontology modeling requires modeling languages expressive enough to represent various definition types. A definition type which seems to be of particular significance is that provid...
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett