503 search results - page 1 / 101 » Verifying Quantitative Properties Using Bound Functions |
CHARME
2005
Springer
14 years 19 days ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
EUROCRYPT
2009
Springer
14 years 7 months ago
2009
Springer
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
TLDI
2010
ACM
13 years 7 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...