Sciweavers

13383 search results - page 173 / 2677
» Abstractions from proofs
Sort
View
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
16 years 27 days ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
CSL
2007
Springer
16 years 21 days ago
Propositional Logic for Circuit Classes
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
Klaus Aehlig, Arnold Beckmann
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen
DAC
1996
ACM
15 years 10 months ago
Functional Verification Methodology of Chameleon Processor
- Functional verification of the new generation microprocessor developed by SGS-THOMSON Microelectronics makes extensive use of advanced technologies. This paper presents a global ...
Françoise Casaubieilh, Anthony McIsaac, Mik...
FSTTCS
2000
Springer
15 years 10 months ago
Formal Verification of the Ricart-Agrawala Algorithm
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ar...