Sciweavers

937 search results - page 24 / 188
» On the Complexity of Partial Order Properties
Sort
View
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
15 years 2 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
ICTAI
2005
IEEE
15 years 3 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
SIGSOFT
2008
ACM
15 years 10 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
IPPS
1998
IEEE
15 years 2 months ago
Testing of Synchronization Conditions for Distributed Real-Time Applications
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...
Ajay D. Kshemkalyani
DATE
2010
IEEE
149views Hardware» more  DATE 2010»
15 years 2 months ago
Efficient decision ordering techniques for SAT-based test generation
Model checking techniques are promising for automated generation of directed tests. However, due to the prohibitively large time and resource requirements, conventional model chec...
Mingsong Chen, Xiaoke Qin, Prabhat Mishra