Abstract
We report about recent enhancements of the Cadp verification tool set that allow to check the correctness of event traces obtained by simulating or executing complex, industrial-size systems. Correctness properties are expressed using either regular expressions or modal μ-calculus formulas, and verified efficiently on very large traces.
This research was partially funded by Bull S.A. and the European Ist -2001-32360 project “ArchWare”.
This is a preview of subscription content, log in via an institution to check access.
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
Andersen, H.R.: Model checking and boolean graphs. TCS 126(1), 3–30 (1994)
Armoni, R., Fix, L., Flaisher, A., Gerth, R., Ginsburg, B., Kanza, T., Landver, A., Mador-Haim, S., Singerman, E., Tiemeyer, A., Vardi, M.Y., Zbar, Y.: The ForSpec Temporal Logic: A New Temporal Property-Specification Language. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 296–311. Springer, Heidelberg (2002)
Arts, T., Fredlund, L.-A.: Trace Analysis of Erlang Programs. In: ACM SIGPLAN Erlang Workshop, Pittsburgh, PA, USA (2002)
Beer, I., Ben-David, S., Eisner, C., Fisman, D., Gringauze, A., Rodeh, Y.: The Temporal Logic Sugar. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 363–367. Springer, Heidelberg (2001)
Cleaveland, R., Steffen, B.: A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. FMSD 2, 121–147 (1993)
Dam, M.: Ctl ∗ and Ectl ∗ as fragments of the modal μ-calculus. TCS 126(1), 77–96 (1994)
Emerson, E.A., Lei, C.-L.: Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In: LICS 1986, pp. 267–278 (1986)
Garavel, H.: OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation, and Testing. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 68–84. Springer, Heidelberg (1998); Full version available as INRIA Research Report RR-3352
Garavel, H., Lang, F., Mateescu, R.: An Overview of CADP 2001. EASST Newsletter 4, 13–24 (2002); Also available as INRIA Technical Report RT-0254
Havelund, K., Goldberg, A., Filman, R., Rosu, G.: Program Instrumentation and Trace Analysis. In: Monterey Workshop, Venice, Italy (2002)
Mateescu, R.: Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 281–295. Springer, Heidelberg (2002); Full version available as INRIA Research Report RR-4430
Mateescu, R.: A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 81–96. Springer, Heidelberg (2003)
Mateescu, R., Sighireanu, M.: Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-Calculus. SCP 46(3), 255–281 (2003)
De Nicola, R., Vaandrager, F.W.: Action versus State based Logics for Transition Systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 407–419. Springer, Heidelberg (1990)
Vloavic, S., Davidson, E.: TAXI: Trace Analysis for X86 Implementation. In: ICCD 2002, Freiburg, Germany (2002)
Ziv, A.: Using Temporal Checkers for Functional Coverage. In: MTV 2002, Austin, Texas, USA (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garavel, H., Mateescu, R. (2004). SEQ.OPEN: A Tool for Efficient Trace-Based Verification. In: Graf, S., Mounier, L. (eds) Model Checking Software. SPIN 2004. Lecture Notes in Computer Science, vol 2989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24732-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24732-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21314-7
Online ISBN: 978-3-540-24732-6
eBook Packages: Springer Book Archive