Sciweavers

2137 search results - page 228 / 428
» Proving Abstract Non-interference
Sort
View
123
Voted
DLOG
2007
15 years 6 months ago
A Proof Theory for DL-Lite
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt
AISC
2008
Springer
15 years 5 months ago
A Tactic Language for Hiproofs
Abstract. We introduce and study a tactic language, Hitac, for constructing hierarchical proofs, known as hiproofs. The idea of hiproofs is to superimpose a labelled hierarchical n...
David Aspinall, Ewen Denney, Christoph Lüth
133
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 5 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
109
Voted
APWEB
2008
Springer
15 years 5 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li
ATVA
2008
Springer
139views Hardware» more  ATVA 2008»
15 years 5 months ago
Compositional Verification for Component-Based Systems and Application
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...