261 search results - page 50 / 53 » Formal Proof from UML Models |
196
click to vote
SCN
2010
Springer
15 years 5 months ago
2010
Springer
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
205
click to vote
SIGSOFT
2006
ACM
16 years 8 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
220
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
236
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
260
click to vote
POPL
2011
ACM
14 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...