2896 search results - page 305 / 580 » Curricula Modeling and Checking |
166
click to vote
CHARME
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
196
click to vote
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper presents our experience implementing the memory management extensions in the Real-Time Specification for Java. These extensions are designed to given real-tim...
168
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
173
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
190
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...