Sciweavers

556 search results - page 45 / 112
» Checking Interval Properties of Computations
Sort
View
SPIN
2001
Springer
15 years 8 months ago
From Model Checking to a Temporal Proof
ions Using SPIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 Marsha Chechik, Benet Devereux, Arie Gurfinkel (University of Toronto) Imp...
Doron Peled, Lenore D. Zuck
SEC
2004
15 years 5 months ago
Trusted Computing, Trusted Third Parties, and Verified Communications
Trusted Computing gives rise to a new supply of trusted third parties on which distributed systems can potentially rely. They are the secure system components (hardware and softwa...
Martín Abadi
FSTTCS
2001
Springer
15 years 8 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
APL
1998
ACM
15 years 8 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...