1452 search results - page 173 / 291 » Algorithmic Analysis of Array-Accessing Programs |
204
Voted
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
113
click to vote
IJCAI
2003
15 years 2 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
SAS
1997
Springer
15 years 4 months ago
1997
Springer
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
WIA
1997
Springer
15 years 4 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
103
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...