Sciweavers

2145 search results - page 92 / 429
» Lax Logical Relations
Sort
View
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 10 months ago
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These ...
Dietrich Kuske
JSYML
2007
85views more  JSYML 2007»
13 years 10 months ago
Lower bounds for modal logics
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
Pavel Hrubes
POPL
2006
ACM
14 years 10 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 10 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
PEPM
2011
ACM
13 years 1 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura