96 search results - page 19 / 20 » Analyzing recursive programs using a fixed-point calculus |
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
SEKE
2010
Springer
13 years 3 months ago
2010
Springer
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
SDB
1995
13 years 8 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...