43 search results - page 7 / 9 » A Typed, Compositional Logic for a Stack-Based Abstract Mach... |
110
click to vote
ICFP
2002
ACM
16 years 2 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...
131
click to vote
SEMWEB
2004
Springer
15 years 8 months 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...
141
Voted
FMCAD
2004
Springer
15 years 8 months 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...
111
click to vote
ESOP
2001
Springer
15 years 7 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...
133
Voted
CADE
2004
Springer
16 years 3 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...