Sciweavers

1055 search results - page 132 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
POPL
1995
ACM
14 years 16 days ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
POPL
2006
ACM
14 years 9 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
PEPM
2004
ACM
14 years 2 months ago
Imperative program optimization by partial evaluation
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to ident...
Søren Debois
JAPLL
2007
78views more  JAPLL 2007»
13 years 9 months ago
Execution architectures for program algebra
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
Jan A. Bergstra, Alban Ponse
POPL
2006
ACM
14 years 9 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand