We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
In this paper we present a modeling technique for security protocols using Abstract State Machines [BS03,Gur95] (ASMs). We describe how we model the different agents in the scenar...
Dominik Haneberg, Holger Grandy, Wolfgang Reif, Ge...
We consider a specific kind of Abstract State Machines. It is shown how the machines can be used to provide a low-level formal semantics for a tiny object-oriented language, inclu...
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...