Abstract
This paper introduces temporal-logic queries for model understanding and model checking. A temporal-logic query is a temporal-logic formula in which a placeholder appears exactly once. Given a model, the semantics of a query is a proposition that can replace the placeholder to result in a formula that holds in the model and is as strong as possible. The author defines a class of CTL queries that can be evaluated in linear time, and show how they can be used to help the user understand the system behaviors and obtain more feedback in model checking.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beer, I., Ben-David, S., Eisner, C.: Efficient detection of vacuity in ACTL formulas. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 279–290. Springer, Heidelberg (1997)
Bensalem, S., Lakhnech, Y.: Automatic generation of invariants. Formal Methods in System Design 15(1), 75–92 (1999)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACMTransactions on Programming Languages and Systems 8(2), 244–263 (1986)
Coudert, O., Berthet, C., Madre, J.C.: Verification of synchronous sequential machines based on symbolic execution. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 365–373. Springer, Heidelberg (1990)
Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and Systems Sciences 30, 1–21 (1985)
Ernst, M., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. In: ICSE99 (ed.) Proceedings of the 1999 International Conference on Software Engineering: ICSE 1999, Los Angeles, USA, pp. 213–224. ACM, New York (1999)
Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences 18, 194–211 (1979)
Govindaraju, S.G., Dill, D.L., Hu, A.J., Horowitz, M.A.: Approximate reachability with BDDs using overlapping projections. In: 35th Design Automation Conference, Proceedings 1998, San Francisco, USA, pp. 451–456. ACM, New York (1998)
Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Transactions on Programming Languages and Systems 16(3), 843–871 (1994)
Jeffords, R., Heitmeyer, C.: Automatic generation of state invariants from requirements specifications. In: FSE6 (ed.) Proceedings of the ACM SIGSOFT 6th International Symposium on the Foundations of Software Engineering: FSE-6, Lake Buena Vista, Florida, USA, November 1998, pp. 56–69 (1998)
Ravi, K., McMillan, K.L., Shiple, T.R., Somenzi, F.: Approximation and decomposition of binary decision diagrams. In: 35th Design Automation Conference, Proceedings 1998, San Francisco, USA, pp. 445–450. ACM, New York (1998)
Vaziri, M., Holzmann, G.: Automatic invariant deduction in Spin. In: Gregoire, J.-C., Holzmann, G.J., Peled, D.A. (eds.) The SPIN Verification System: The 4th International Workshop, Paris, France (November 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, W. (2000). Temporal-logic Queries. In: Emerson, E.A., Sistla, A.P. (eds) Computer Aided Verification. CAV 2000. Lecture Notes in Computer Science, vol 1855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722167_34
Download citation
DOI: https://doi.org/10.1007/10722167_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67770-3
Online ISBN: 978-3-540-45047-4
eBook Packages: Springer Book Archive