Abstract
Vacuity arises when a logical formula is trivially true in a given model due, for example, to antecedent failure. Beer et al. have recently introduced a logic-independent notion of vacuity and shown that certain logics, i.e., those with polarity, admit an efficient decision procedure for vacuity detection. We show that the modal mu-calculus, a very expressive temporal logic, is a logic with polarity and hence the results of Beer et al. are applicable. We also extend the definition of vacuity to achieve a new notion of redundancy in logical formulas. Redundancy captures several forms of antecedent failure that escape traditional vacuity analysis, including vacuous actions in temporal modalities and unnecessarily strong temporal operators. Furthermore, we have implemented an efficient redundancy checker for the modal mu-calculus in the context of the XMC model checker. Our checker generates diagnostic information in the form of all maximal subformulas that are redundant and exploits the fact that XMC can cache intermediate results in memo tables between model-checking runs. We have applied our redundancy checker to a number of previously published case studies, and found instances of redundancy that have gone unnoticed till now. These findings provide compelling evidence of the importance of redundancy detection in the design process.
This work was supported in part by NSF grants EIA-9705998, CCR-9876242, CCR-9988155; ONR grant N000140110967; and ARO grants DAAD190110003, DAAD190110019.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y. S. Ramakrishna, and D. White. An efficient meta-lock for implementing ubiquitous synchronization. In Proceedings of OOPSLA’ 99, 1999.
S. Basu, S. A. Smolka, and O. R. Ward. Model checking the Java Meta-Locking algorithm. In Proceedings of 7th IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ECBS 2000), Edinburgh, Scotland, April 2000.
D. Beatty and R. Bryant. Formally verifying a multiprocessor using a simulation methodology. In Design Automation Conference’ 94, pages 596–602, 1994.
I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In CAV’ 97, pages 279–290. LNCS 1254, Springer-Verlag, 1997.
I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in temporal model checking. Formal Methods in System Design, 18(2):141–163, March 2001.
J. Bradfield and C. Stirling. Modal logics and mu-calculi: An introduction. In J. A. Bergstra, A. Ponse, and S. A. Smolka, editors, Handbook of Process Algebra. Elsevier, 2001.
T. Chiueh and C. Venkatramani. The design, implementation and evaluation of a software-based real-time ethernet protocol. In Proceedings of ACM SIGCOMM’ 95, pages 27–37, 1995.
E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer-Verlag, 1981.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.
E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4), December 1996.
R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Modeling and verifying distributed systems using priorities: Acase study. Software Concepts and Tools, 17:50–62, 1996.
R. Cleaveland and S. Sims. The NCSU Concurrency Workbench. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification (CAV’ 96), volume 1102 of Lecture Notes in Computer Science, pages 394–397, New Brunswick, New Jersey, July 1996. Springer-Verlag.
X. Du, K. T. McDonnel, E. Nanos, Y. S. Ramakrishna, and S. A. Smolka. Software design, specification, and verification: Lessons learned from the Rether case study. In Proceedings of the Sixth International Conference on Algebraic Methodology and Software Technology (AMAST’ 97), Sydney, Australia, December 1997. Springer-Verlag.
X. Du, S. A. Smolka, and R. Cleaveland. Local model checking and protocol analysis. Software Tools for Technology Transfer, 2(3):219–241, November 1999.
H.-F. Guo, C. R. Ramakrishnan, and I. V. Ramakrishnan. Speculative beats conservative justification. In Proc. of 17th International Conference on Logic Programming (ICLP’ 01), November 2001.
G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, May 1997.
D. Kozen. Results on the propositional ώ-calculus. Theoretical Computer Science, 27:333–354, 1983.
O. Kupferman and M. Y. Vardi. Vacuity detection in temporal model checking. In CHARME 99. LNCS 1703, Springer-Verlag, 1999.
R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. W. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In CAV’ 97, LNCS 1254, Springer-Verlag, 1997.
C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, et al. XMC: A logicprogramming-based verification toolset. In Proceedings of the 12th International Conference on Computer Aided Verification CAV 2000. Springer-Verlag, June 2000.
A. Roychoudhury, C. R. Ramakrishnan, and I. V. Ramakrishnan. Justifying proofs using memo tables. In Proc. of Second International Conference on Principles and Practice of Declarative Programming (PPDP 2000), September 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, Y., Sarna-Starosta, B., Ramakrishnan, C.R., Smolka, S.A. (2002). Vacuity Checking in the Modal Mu-Calculus* . In: Kirchner, H., Ringeissen, C. (eds) Algebraic Methodology and Software Technology. AMAST 2002. Lecture Notes in Computer Science, vol 2422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45719-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-45719-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44144-1
Online ISBN: 978-3-540-45719-0
eBook Packages: Springer Book Archive