Sciweavers

73 search results - page 6 / 15
» Strengthening properties using abstraction refinement
Sort
View
CSR
2006
Springer
15 years 1 months ago
Expressiveness of Metric Modalities for Continuous Time
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
Yoram Hirshfeld, Alexander Moshe Rabinovich
IANDC
2008
81views more  IANDC 2008»
14 years 9 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
TVLSI
2008
124views more  TVLSI 2008»
14 years 9 months ago
A Refinement-Based Compositional Reasoning Framework for Pipelined Machine Verification
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...
Panagiotis Manolios, Sudarshan K. Srinivasan
TCC
2004
Springer
101views Cryptology» more  TCC 2004»
15 years 3 months ago
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
Iftach Haitner
FAC
2010
121views more  FAC 2010»
14 years 7 months ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...