Sciweavers

662 search results - page 6 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
ATVA
2006
Springer
191views Hardware» more  ATVA 2006»
15 years 1 months ago
Automatic Verification of Hybrid Systems with Large Discrete State Space
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang,...
RTSS
1997
IEEE
15 years 1 months ago
On-the-fly symbolic model checking for real-time systems
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
Ahmed Bouajjani, Stavros Tripakis, Sergio Yovine
SPIN
2004
Springer
15 years 2 months ago
Verifying Commit-Atomicity Using Model-Checking
The notion that certain procedures are atomic provides a valuable partial specification for many multithreaded software systems. Several existing tools verify atomicity by showing...
Cormac Flanagan
TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
15 years 2 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....
FOSSACS
2010
Springer
15 years 21 days ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi