Sciweavers

793 search results - page 61 / 159
» Argumentation and standards of proof
Sort
View
86
Voted
CONCUR
2006
Springer
15 years 4 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous
100
Voted
EUROCRYPT
2006
Springer
15 years 4 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
118
Voted
CADE
2010
Springer
15 years 1 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
120
Voted
CDC
2009
IEEE
128views Control Systems» more  CDC 2009»
15 years 1 months ago
Feedback generation of quantum Fock states by discrete QND measures
A feedback scheme for preparation of photon number states in a microwave cavity is proposed. Quantum Non Demolition (QND) measurement of the cavity field provides information on it...
Mazyar Mirrahimi, Igor Dotsenko, Pierre Rouchon
APAL
2008
104views more  APAL 2008»
15 years 27 days ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy