Sciweavers

3758 search results - page 53 / 752
» A Complete Subsumption Algorithm
Sort
View
CAV
2010
Springer
214views Hardware» more  CAV 2010»
13 years 11 months ago
Comfusy: A Tool for Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, P...
PODC
2010
ACM
13 years 9 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
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
JSC
2010
102views more  JSC 2010»
13 years 6 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
DLOG
2004
13 years 9 months ago
Towards Explaining Semantic Matching
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunc...