Sciweavers

442 search results - page 34 / 89
» Proof Abstraction for Imperative Languages
Sort
View
ESOP
2000
Springer
14 years 9 days ago
Formalizing Implementation Strategies for First-Class Continuations
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
Olivier Danvy
FMOODS
2007
13 years 10 months ago
Pict Correctness Revisited
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 ...
Philippe Bidinger, Adriana B. Compagnoni
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Undecidability Results for Finite Interactive Systems
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...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
PPSWR
2005
Springer
14 years 2 months ago
Descriptive Typing Rules for Xcerpt
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 ...
Sacha Berger, Emmanuel Coquery, Wlodzimierz Draben...
CP
2004
Springer
14 years 2 months ago
Constraint Propagation as a Proof System
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...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...