259 search results - page 37 / 52 » Bounded Model Checking for Timed Automata |
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
ASE
2002
14 years 11 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
106
click to vote
IANDC
2011
14 years 6 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
ICALP
1994
Springer
15 years 3 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
IPPS
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...