Sciweavers

7988 search results - page 219 / 1598
» A Useful Undecidable Theory
Sort
View
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 5 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
98
Voted
IFL
2001
Springer
142views Formal Methods» more  IFL 2001»
15 years 5 months ago
A Compilation Scheme for a Hierarchy of Array Types
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
Dietmar Kreye
94
Voted
CSL
1999
Springer
15 years 5 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
ICLP
1997
Springer
15 years 4 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
133
Voted
LICS
1993
IEEE
15 years 4 months ago
Verifying Programs with Unreliable Channels
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
Parosh Aziz Abdulla, Bengt Jonsson