55 search results - page 7 / 11 » A Temporal-Logic Approach to Binding-Time Analysis |
SIGSOFT
2003
ACM
14 years 22 days ago
2003
ACM
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
FORMATS
2003
Springer
14 years 21 days ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
ISSTA
2000
ACM
13 years 12 months ago
2000
ACM
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...