224 search results - page 32 / 45 » A parallel repetition theorem |
103
click to vote
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
128
click to vote
CRYPTO
2007
Springer
15 years 5 months ago
2007
Springer
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
117
Voted
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
95
Voted
IEEEPACT
2007
IEEE
15 years 8 months ago
2007
IEEE
The process of verifying a new microprocessor is a major problem for the computer industry. Currently, architects design processors to be fast, power-efficient, and reliable. Howe...
120
Voted
ARITH
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...