205 search results - page 32 / 41 » Testing the Equivalence of Regular Languages |
176
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
OOPSLA
2010
Springer
14 years 10 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
SEFM
2006
IEEE
15 years 5 months ago
2006
IEEE
We present an operational model for describing random reactive systems. Some models have already been proposed for this purpose, but they generally aim at performing global reason...