Sciweavers

298 search results - page 24 / 60
» Abstract Models of Transfinite Reductions
Sort
View
EUROCRYPT
2007
Springer
15 years 5 months ago
Non-interactive Proofs for Integer Multiplication
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
Ivan Damgård, Rune Thorbek
FUIN
2006
85views more  FUIN 2006»
14 years 11 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
RSP
2003
IEEE
132views Control Systems» more  RSP 2003»
15 years 5 months ago
Rapid Exploration of Pipelined Processors through Automatic Generation of Synthesizable RTL Models
As embedded systems continue to face increasingly higher performance requirements, deeply pipelined processor architectures are being employed to meet desired system performance. ...
Prabhat Mishra, Arun Kejariwal, Nikil Dutt
FM
2009
Springer
169views Formal Methods» more  FM 2009»
15 years 3 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
ESOP
2003
Springer
15 years 5 months ago
A Tail-Recursive Semantics for Stack Inspections
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
John Clements, Matthias Felleisen