90 search results - page 6 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
DAGSTUHL
2007
13 years 9 months ago
2007
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
PODS
1997
ACM
13 years 11 months ago
1997
ACM
We consider the problem of answering datalog queries using materialized views. The ability to answer queries using views is crucial in the context of information integration. Prev...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
ACTA
2007
13 years 7 months ago
2007
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, an...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...