Verification of temporal properties of processes in a setting with data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1548, Issue , 1998, Pages 74-90

  Groote, Jan Friso ^a,b   Mateescu, Radu ^c  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

DATA VARIABLES; FIRST-ORDER FORMULAS; FIXED POINT OPERATOR; LINEAR PROCESS; PARAMETERIZED; TEMPORAL FORMULAE; TEMPORAL PROPERTY; VERIFICATION OF TEMPORAL PROPERTIES;

SOFTWARE ENGINEERING;

EID: 84958977795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_8     Document Type: Conference Paper

References (22)

1. Andersen, H.R.: Model Checking and Boolean Graphs. Theoretical Com puter Science, 126(1):3–30, 1994.
2. Arnold, A., Crubillé, P.: A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. Information Processing Letters, 29:57–66, 1988.
3. Bezem, M.A., Groote, J.F.: Invariants in Process Algebra with Data. In: Jonsson, B., Parrow, J. (eds.): Proceedings of C ON CUR’ 94 (Uppsal a, Sweden), LNCS 836, pp. 401–416, Springer Verlag, 1994.
4. Bezem, M.A., Groote, J.F.: A Correctness Proof of a One Bit Sliding Window Protocol in µCrl. The Computer Journal, 37(4):289–307, 1994.
5. Bosscher, D., Ponse, A.: Translating a Process Algebra with Symbolic Data Values to Linear Format. In: Engberg, U.H., Larsen, K.G., Skou, A. (eds.), Proceedi ngs of TACAS’95 (Aarhus, Denmark), BRICS Notes Series, pp. 119–130, University of Aarhus, 1995.
6. van Dalen, D.: Logic and Structure. Springer Verlag, 1994.
7. Dam, M.: Model Checking Mobile Processes. Information and Computation, 129:35–51, 1996.
8. Fredlund, L.-Å., Groote, J.F., Korver, H.: Formal Verification of a Leader Election Protocol in Process Algebra. Theoreti cal Com puter Sci ence, 177:459–486, 1997.
9. Groote, J.F.: A Note on n Similar Parallel Processes. In: Gnesi, S., Latella, D. (eds.), Proceedings of the 2nd ERCIM Int. Workshop on Formal Methods for Industrial Critical Systems (Cesena, Italy), pp. 65–75, 1997. (See also Report CS-R9626, CWI, Amsterdam, 1996).
10. Groote, J.F., Mateescu, R.: Verification of Temporal Properties of Processes in a Setting with Data. Technical Report SEN-R9804, CWI, Amsterdam, 1998.
11. Groote, J.F., Monin, F., Springintveld, J.: A Computer Checked Algebraic Verification of a Distributed Summing Protocol. Computer Science Report 97/14, Dept. of Math. and Comp. Sci., Eindhoven University of Technology, 1997.
12. Groote, J.F., van de Pol, J.C.: A Bounded Retransmission Protocol for Large Data Packets. A Case Study in Computer Checked Verification. In: Wirsing, M., Nivat, M. (eds.), Proceedings of AMAST’96 (Munich, Germany), LNCS 1101, pp. 536–550, Springer Verlag, 1996.
13. Groote, J.F., Ponse, A.: The Syntax and Semantics of µCrl. In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.), Algebra of Communicating Processes, Workshops in Computing, pp. 26–62, 1994.
14. Groote, J.F., Springintveld, J.: Focus Points and Convergent Process Operators. A Proof Strategy for Protocol Verification. Technical Report 142, Logic Group Preprint Series, Utrecht University, 1995. (See also Technical Report CS-R9566, CWI, Amsterdam, 1995).
15. Kindler, A., Reisig, W., Völzer, H., Walter, R.: Petri Net Based Verification of Distributed Algorithms: an Example. Formal Aspects of Computing, 9:409–424, 1997.
16. Kozen, D.: Results on the Propositional µ-calculus. T heoretical Computer Sci ence 27, pp. 333–354, 1983.
17. Manna, Z., Pnueli, A.: Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs. Science of Computer Programming 32:257–289, 1984.
18. Queille, J-P., Sifakis, J.: Fairness and Related Properties in Transition Systems — a Temporal Logic to Deal with Fairness. Acta Informatica, 19:195–220, 1983.
19. Rathke, J., Hennessy, M.: Local Model Checking for a Value-Based Modal µ-calculus. Technical Report 5/96, School of Cognitive and Computing Sciences, University of Sussex, 1996.
20. Shankland, C.: The Tree Identify Protocol of IEEE 1394. In: Groote, J.F., Luttik, B., van Wamel, J. (eds.), Proceedings of the 3rd ERCIM Int. Workshop on Formal Methods for Industrial Critical Systems (Amsterdam, The Netherlands), pp. 299–319, 1998.
21. Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics 5, pp. 285–309, 1955.
22. Vergauwen, B., Lewi, J.: A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems. Proceedings of CAAP’92 (Rennes, France), LNCS 581, pp. 322–341, Springer Verlag, 1992.