Sciweavers

499 search results - page 93 / 100
» LTL satisfiability checking
Sort
View
ICDT
2010
ACM
193views Database» more  ICDT 2010»
14 years 12 months ago
Data correspondence, exchange and repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet
DLOG
2009
14 years 7 months ago
Model-Based Most Specific Concepts in Some Inexpressive Description Logics
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
Felix Distel
POPL
2005
ACM
15 years 9 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
COMPSAC
2004
IEEE
15 years 1 months ago
Testing Context-Sensitive Middleware-Based Software Applications
Context-sensitive middleware-based software is an emerging kind of ubiquitous computing application. The components of such software communicate proactively among themselves accor...
T. H. Tse, Stephen S. Yau, W. K. Chan, Heng Lu, Ts...
ESORICS
2008
Springer
14 years 11 months ago
Termination-Insensitive Noninterference Leaks More Than Just a Bit
Current tools for analysing information flow in programs build upon ideas going back to Denning's work from the 70's. These systems enforce an imperfect notion of informa...
Aslan Askarov, Sebastian Hunt, Andrei Sabelfeld, D...