Certifying deadlock-freedom for BIP models
Abstract
References
Index Terms
- Certifying deadlock-freedom for BIP models
Recommendations
Certifying Model Checkers
CAV '01: Proceedings of the 13th International Conference on Computer Aided VerificationModel Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample computation if the check fails. This computation acts as a "certificate" of ...
Global and Local Deadlock Freedom in BIP
We present a criterion for checking local and global deadlock freedom of finite state systems expressed in BIP: a component-based framework for constructing complex distributed systems. Our criterion is evaluated by model-checking a set of subsystems of ...
Parameterized verification of deadlock freedom in symmetric cache coherence protocols
FMCAD '11: Proceedings of the International Conference on Formal Methods in Computer-Aided DesignAn important problem in the verification of hardware protocols is that of proving deadlock freedom. We view deadlock freedom as the property that for all reachable states, there exists some path to a quiescent state, i.e. one wherein all resources of ...
Comments
Information & Contributors
Information
Published In
Sponsors
- EDAA: European Design Automation Association
- PREDATOR European FP7 Project
- ArtistDesign European NoE
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Conference
- EDAA
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 117Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in