1894 search results - page 199 / 379 » A TLA Proof System |
134
click to vote
HYBRID
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
121
click to vote
DAGSTUHL
2003
15 years 5 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
110
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
177
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
153
click to vote
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...