1454 search results - page 212 / 291 » Stateful traits and their formalization |
161
click to vote
JFP
2010
15 years 4 months ago
2010
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
193
click to vote
IANDC
2011
15 years 1 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
232
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
185
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
207
click to vote
VMCAI
2012
Springer
14 years 1 months ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...