169 search results - page 17 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
ISOLA
2007
Springer
14 years 1 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
TASE
2008
IEEE
14 years 1 months ago
2008
IEEE
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
JSS
2010
13 years 2 months ago
2010
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
ENTCS
2000
13 years 7 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...