Sciweavers

222 search results - page 7 / 45
» Efficient assertion based verification using TLM
Sort
View
ASIACRYPT
2010
Springer
14 years 10 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
BPM
2008
Springer
122views Business» more  BPM 2008»
15 years 1 months ago
Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance
Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defe...
Niels Lohmann
PVLDB
2008
108views more  PVLDB 2008»
14 years 11 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
ICTAI
1996
IEEE
15 years 4 months ago
Automatic Diagnoses for Properly Stratified Knowledge-Bases
We present a mechanism for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing ...
Ofer Arieli, Arnon Avron
JAR
2008
98views more  JAR 2008»
14 years 11 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...