Sciweavers

258 search results - page 27 / 52
» Proof Styles in Operational Semantics
Sort
View
TYPES
1998
Springer
13 years 11 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
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...
Thomas Kleymann
APAL
2004
78views more  APAL 2004»
13 years 7 months ago
Ternary relations and relevant semantics
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Robert K. Meyer
IFM
2007
Springer
14 years 1 months ago
Unifying Theories of Objects
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...
Michael Anthony Smith, Jeremy Gibbons
FOAL
2007
ACM
13 years 11 months ago
Specializing continuations a model for dynamic join points
By modeling dynamic join points, pointcuts, and advice in a defunctionalized continuation-passing style interpreter, we provide a fundamental account of these AOP mechanisms. Dyna...
Christopher Dutchyn
AUSAI
2003
Springer
14 years 23 days ago
A Defeasible Logic of Policy-Based Intention
Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [...
Guido Governatori, Vineet Padmanabhan