632 search results - page 58 / 127 » Combining programming with theorem proving |
126
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
168
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
132
Voted
APLAS
2001
ACM
15 years 7 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
140
Voted
LOPSTR
2009
Springer
15 years 10 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
141
Voted
FPCA
1989
15 years 7 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...