Sciweavers

615 search results - page 9 / 123
» Completeness of Combinations of Constructor Systems
Sort
View
DBSEC
2006
160views Database» more  DBSEC 2006»
13 years 9 months ago
On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
Joachim Biskup, Lena Wiese
CC
2008
Springer
137views System Software» more  CC 2008»
13 years 9 months ago
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...
Francesco Logozzo, Manuel Fähndrich
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IJCAI
1993
13 years 8 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
CSL
2004
Springer
14 years 27 days ago
Subtyping Union Types
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
Jerome Vouillon