Yung-Pin Cheng
ABSTRACT
Systems composed of many identical processes can sometimes be verified inductively using a network invariant, but systems whose component processes vary in some systematic way are not amenable to direct application of that method. We describe how variations in behavior can be "factored out" into additional processes, thus enabling induction over the number of processes. The process is semi-automatic: The designer must choose from among a set of idiomatic transformations, but each transformation is applied and checked automatically.
- K. R. Apt and D. C. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, pages 207-309, 1986. Google Scholar
Digital Library
- S. C. Cheung and J. Kramer. Checking safety properties using compositional reachability analysis. ACM Transactions on Software Engineering and Methodology, 8:49-78, January 1999. Google ScholarDigital Library
- M. Hennessy. Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing. The MIT Press, Cambridge, Massachusetts, 1988. Google ScholarDigital Library
- C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666-677, August 1978. Google ScholarDigital Library
- R. P. Kurshan and K. L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995. Google ScholarDigital Library
- E. M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks. In ACM Transactions on Programming Languages and Systems, volume 19, pages 726-750, 1997. Google ScholarDigital Library
- B. Sanden. Entity-life modeling and structured analysis in real-time software design---a comparison. Communications of the ACM, 32(12):1458-1466, December 1989. Google ScholarDigital Library
- A. Valmari and I. Kokkarinen. Unbounded verification results by finite-state compositional techniques: 10any states and beyond. In International Conference on Application of Concurrency to System Design, Proceedings, pages 75-85, Aizu-Wakamatsu, Fukushima, Japan, March 1998. Google ScholarDigital Library
- P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In Automatic Verification Methods for Finite State Systems, Volumne 407 Lecture Notes in Computer Science, pages 68-80. Springer-Verlag, June 1989. Google ScholarDigital Library
- W. J. Yeh and M. Young. Re-designing tasking structure of ada programs for analysis:a case study. Software Testing, Verification, and Reliability, 4:223-253, 1994.Google Scholar
Recommendations
Refactoring design models for inductive verification
Systems composed of many identical processes can sometimes be verified inductively using a network invariant, but systems whose component processes vary in some systematic way are not amenable to direct application of that method. We describe how ...
Towards scalable compositional analysis by refactoring design models
ESEC/FSE-11: Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineeringAutomated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower bounds on complexity imply that all of the techniques that have been ...
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower bounds on complexity imply that all of the techniques that have been ...
Comments