Sciweavers

143 search results - page 12 / 29
» Abstract Interpretation and Partial Evaluation in Functional...
Sort
View
PLDI
2011
ACM
12 years 9 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
POPL
2012
ACM
12 years 2 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
LISP
2008
97views more  LISP 2008»
13 years 6 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
LOPSTR
2007
Springer
14 years 26 days ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen
PADL
2005
Springer
14 years 6 days ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel