5084 search results - page 296 / 1017 » Proving Possibility Properties |
169
click to vote
SPIN
2005
Springer
16 years 3 days ago
2005
Springer
We describe a method for the specification and verification of the dynamic behaviour of component systems. Building applications using a component framework allows the developers...
181
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
205
click to vote
DC
2010
15 years 6 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
179
click to vote
JACM
2007
15 years 6 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
234
click to vote
KI
2010
Springer
15 years 1 months ago
2010
Springer
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...