Using state space reduction methods for deadlock analysis in Ada tasking
- 1 July 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSOFT Software Engineering Notes
- Vol. 18 (3) , 51-60
- https://doi.org/10.1145/174146.154197
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Checking properties of nets using transformationsPublished by Springer Nature ,2005
- Using partial orders for the efficient verification of deadlock freedom and safety propertiesFormal Methods in System Design, 1993
- Automated analysis of concurrent systems with the constrained expression toolsetIEEE Transactions on Software Engineering, 1991
- Compositional reachability analysis using process algebraPublished by Association for Computing Machinery (ACM) ,1991
- Design and implementation of a Petri net based toolkit for Ada tasking analysisIEEE Transactions on Parallel and Distributed Systems, 1990
- Starvation and critical race analyzers for AdaIEEE Transactions on Software Engineering, 1990
- Integrated concurrency analysis in a software development enviornmentACM SIGSOFT Software Engineering Notes, 1989
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- Detection of Ada static deadlocks using Petri net invariantsIEEE Transactions on Software Engineering, 1989
- A general-purpose algorithm for analyzing concurrent programsCommunications of the ACM, 1983