43 search results - page 7 / 9 » A Typed, Compositional Logic for a Stack-Based Abstract Mach... |
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
SEMWEB
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
FMCAD
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
CADE
2004
Springer
14 years 7 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...