442 search results - page 34 / 89 » Proof Abstraction for Imperative Languages |
147
click to vote
ESOP
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
126
click to vote
FMOODS
2007
15 years 7 months ago
2007
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any ...
189
click to vote
SYNASC
2008
IEEE
16 years 12 days ago
2008
IEEE
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
259
click to vote
PPSWR
2005
Springer
15 years 11 months ago
2005
Springer
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
141
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...