Sciweavers

5634 search results - page 158 / 1127
» About Abstract Classes
Sort
View
ECCC
2006
96views more  ECCC 2006»
14 years 11 months ago
An Unconditional Study of Computational Zero Knowledge
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
Salil P. Vadhan
CCE
2005
14 years 11 months ago
Process industry supply chains: Advances and challenges
A large body of work exists in process industry supply chain optimisation. We describe the state of the art of research in infrastructure design, modelling and analysis and planni...
Nilay Shah
JLP
2011
160views more  JLP 2011»
14 years 6 months ago
Axiomatizability of representable domain algebras
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
Robin Hirsch, Szabolcs Mikulás
CADE
2007
Springer
15 years 11 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani
HYBRID
2007
Springer
15 years 3 months ago
Diagnosability Verification for Hybrid Automata
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...