Sciweavers

2137 search results - page 426 / 428
» Proving Abstract Non-interference
Sort
View
JCT
2010
79views more  JCT 2010»
15 years 23 days ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
LPAR
2010
Springer
15 years 22 days ago
The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach
Abstract. The paper presents the methodology and the results of checking consistency of the knowledge base of CADIAG-2, a large-scale medical expert system. Such knowledge base con...
Pavel Klinov, Bijan Parsia, David Picado-Mui&ntild...
116
Voted
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 21 days ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
SCN
2010
Springer
187views Communications» more  SCN 2010»
15 years 21 days ago
Searching Keywords with Wildcards on Encrypted Data
Abstract. A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption ke...
Saeed Sedghi, Peter van Liesdonk, Svetla Nikova, P...
144
Voted
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
15 years 20 days ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal