Sciweavers

77 search results - page 9 / 16
» Imperative program optimization by partial evaluation
Sort
View
CSUR
1999
114views more  CSUR 1999»
13 years 7 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
ATAL
2006
Springer
13 years 11 months ago
Solving POMDPs using quadratically constrained linear programs
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
ENTCS
2006
101views more  ENTCS 2006»
13 years 7 months ago
Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language
We describe our efforts to use rule-based programming to produce a model of Jumbo, a run-time program generation (RTPG) system for Java. Jumbo incorporates RTPG following the simp...
Baris Aktemur, Samuel N. Kamin
FROCOS
2005
Springer
14 years 1 months ago
A Concurrent Lambda Calculus with Futures
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
Joachim Niehren, Jan Schwinghammer, Gert Smolka
LISP
2008
97views more  LISP 2008»
13 years 7 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