Abstract
We present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the verification problem under investigation. Formal basis for this methodology are Modal Transition Systems allowing loose state-based specifications, which can be refined by successively adding constraints. Key concepts of our method are projective views, separation of proof obligations, Skolemization and abstraction. Central to the method is the use of Parametrized Modal Transition Systems. The method easily transfers to real-time systems, where the main problem are parameters in timing constraints.
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
H. Andersen, C. Stirling, G. Winskel. A Compositional Proof System for the Modal Mu-Calculus. in: Proc. LICS 1994.
R. Alur, D.L. Dill. A Theory of Timed Automata. in: Theoretical Computer Science Vol. 126, No. 2, April 1994, pp. 183–236.
R. Alur, T.A. Henzinger, M.Y. Vardi. Parametric real-time reasoning. Proc. 25th STOC, ACM Press 1993, pp. 592–601.
M. Broy, L. Lamport. Specification Problem. Case study for the Dagstuhl Seminar 9439, 1994.
R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. in: IEEE Transactions on Computation, 35 (8). 1986.
J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang. Symbolic Model Checking: 1020 States and Beyond. in: Proc. LICS'90.
J. Bradfield, C.Stirling. Local Model Checking for Finite State Spaces. LFCS Report Series ECS-LFCS-90-115, June 1990
E. Clarke, E.A. Emerson, A.P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. In Proc. 10th POPL'83
K. Čerāns, J.C. Godesken, K.G. Larsen. Timed Modal Specification — Theory and Tools. in: C. Courcoubetis (Ed.), Proc. 5th CAV, 1993. LNCS 697, Springer Berlin 1993, pp. 253–267.
E. Clarke, O. Grumber, D. Long. Model Checking and Abstraction. in: Proc. XIX POPL'92.
E. Clarke, D. Long, K. McMillan. Compositional Model Checking, in: Proc. LICS'89.
P. Cousot, R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. in: Proc. POPL'77.
R. Enders, T. Filkorn, D. Taubner. Generating BDDs for Symbolic Model Checking in CCS. in: Proceedings CAV'91, LNCS 575, 1991, pp. 203–213
E. Emerson, J. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proc. LICS'86, pp. 267–278.
P. Godefroid, P. Wolper. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. in: Proc. CAV'91, LNCS 575, pp. 332–342.
P. Godefroid, D. Pirottin. Refining Dependencies Improves Partial-Order Verification Methods. in: Proceedings CAV'93, LNCS 697, 1991, pp. 438–449.
S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction. in: Proceedings FASE/TAPSOFT'93.
S. Graf, B. Steffen. Using Interface Specifications for Compositional Minimization of Finite State Systems. in: Proc. CAV'90.
D. Kozen. Results on the Propositional mu-Calculus. TCS 27, 333–354, 1983
H. Hüttel and K. Larsen. The use of static constructs in a modal process logic. Proceedings of Logic at Botik'89. LNCS 363, 1989.
K.G. Larsen. Modal specifications. In: Automatic Verification Methods for Finite State Systems LNCS 407, 1990.
K. Larsen and B. Thomsen. A modal process logic. In: Proceedings LICS'88, 1988.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
D. Park. Concurrency and automata on infinite sequences. In P. Deussen (ed.), LNCS 104, pp. 167–183, 1981.
B. Steffen. Characteristic Formulae. In Proc. ICALP'89, LNCS 372, 1989
B. Steffen. Generating data flow analysis algorithms from modal specifications. in: Science of Computer Programming 21, (1993), 115–139.
A. Valmari. On-The-Fly Verification with Stubborn Sets. in: C. Courcoubetis (Ed.), Proc. 5th CAV, 1993. LNCS 697, pp. 397–408.
W. Yi. CCS+Time=an Interleaving Model for Real-Time Systems, Proc. 18th Int. Coll. on Automata, Languages and Programming (ICALP), Madrid, July 1991. LNCS 510, Springer New York 1991, pp. 217–228.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsen, K.G., Steffen, B., Weise, C. (1995). A constraint oriented proof methodology based on modal transition systems. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1995. Lecture Notes in Computer Science, vol 1019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60630-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-60630-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60630-7
Online ISBN: 978-3-540-48509-4
eBook Packages: Springer Book Archive