A higher order modal fixed point logic

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

Volumn 3170, Issue , 2004, Pages 512-528

  Viswanathan, Mahesh ^a   Viswanathan, Ramesh ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; MODEL CHECKING; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

FIXED POINT OPERATOR; FIXED-POINT LOGIC; HIGHER ORDER FUNCTIONS; INFINITE TRANSITION SYSTEMS; MODAL MU CALCULUS; MODEL CHECKING PROBLEM; MONOTONIC FUNCTIONS; PUSH-DOWN AUTOMATA;

COMPUTER CIRCUITS;

EID: 26844443462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_33     Document Type: Article

References (17)

1. Müller-Olm, M.: A Modal Fixpoint Logic with Chop. In: Proceedings of the Symposium on the Theoretical Aspects of Computer Science volume 1563 of Lecture Notes in Computer Science., Springer (1999) 510-520
2. Pnueli. A.: In transition from global to modular temporal reasoning about programs. In: Logics and Models of Concurrent Systems. NATO ASI Series. SpringerVerlag (1984) 123-144
3. Misra, J., Chandy, K.M.: Proofs of network processes. IEEE Transactions on Software Engineering SE-7 (1981) 417-426
4. Abadi, M., Lamport, L.: Composing specifications. ACM Transactions on Programming Languages and Systems 15 (1993) 73-132
5. Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems 17 (1995) 507-534
6. McMillan, K.: Circular compositional reasoning about liveness. In Pierre, L., Kropf, T., eds.: CHARME 99: Correct Hardware Design and Verification. volume 1703 of Lecture Notes in Computer Science., Springer-Verlag (1999) 342-345
7. Henzinger, T.A., Qadeer, S., Rajamani, S.K., Tasiran, S.: An assume-guarantee rule for checking simulation. In: Gopalakrishnan, G., and Windley, P., eds: FMCAD 98: Formal Methods in Computer-aided Design, volume 1522 of Lecture Notes in Computer Science., Springer-Verlag (1998) 421-432
8. Viswanathan, M., Viswanathan, R.: Foundations of Circular Compositional Reasoning. In: Proceedings of the International Colloquim on Automata, Languages and Programming. Lecture Notes in Computer Science, Springer (2001)
9. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science, 27 (1983) 333-354
10. Stirling, C.: Modal and Temporal Logics. In Handbook of Logic in Computer Science. volume 2. Claredon Press, Oxford, UK (1992) 477-563
11. Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the μ-calculus and its fragments. Theoretical Computer Science 258 (2001) 491-522
12. Lange, M., Stirling, C.: Model Checking Fixed Point Logic with Chop. In: Proceedings of the Foundations of Software Science and Computation Structures. volume 2303 of Lecture Notes in Computer Science.,Springer (2002) 250-263
13. Lange, M.: Local model checking games for fixed point logic with chop. In: Proceedings of the Conference on Concurrency Theory, CONCUR'02. volume 2421 of Lecture Notes in Computer Science., Springer (2002) 240-254
14. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
15. Burkart, O. Caucal, D., Moller, F., Steffen, B.: Verification on Infinite Structures. In: Handbook of Process Algebra. Elsevier Science Publishers (2001) 545-62316. Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 15 (1996) 143-159
16. Sénizergues, G.: Decidability of bisimulation equivalence for equations graphs of finite out-degree. In: Proceedings of the IEEE Sysmposium on the Foundations of Computer Science. (1998) 120-129
17. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5 (1955) 285-309.