Temporal logic with predicate λ-abstraction

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2005, Pages 147-155

  Lisitsa, Alexei ^a   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION MECHANISM; AUTOMATED VERIFICATION; COMPUTATIONAL MODEL; COMPUTATIONAL UNIVERSALITY; DYNAMIC SYSTEMS; LINEAR TEMPORAL LOGIC; MEMORY LOCATIONS;

ABSTRACTING; MOBILE AGENTS; SPECIFICATIONS;

TEMPORAL LOGIC;

EID: 66749089280     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2005.34     Document Type: Conference Paper

References (7)

1. J. Cao, X. Feng, J. Lu, and S. K. Das. Mailbox-based scheme for mobile agent communications. IEEE Computer, 35(9):54-60, 2002.
2. M. Fitting. Modal logic between propositional and first order. Journal of Logic and Computation, 12:1017-1026, 2002.
3. D. Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. Journal of the ACM, 33:224-248, 1986.
4. H. Huttel. Undecidable equivalence for basic parallel processes. In Proceedings of TACS-94, Lecture Notes in Computer Scinece 789, pages 454-464. Springer-Verlag, 1994.
5. G. Kucherov and M. Rusinowitch. Undecidability of ground reducibility for word rewriting systems with variables. Information Processing Letters, 53:209-215, 1995.
6. M. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall International, 1967.
7. T. Ball, B. Cook, Das, and S. Rajamani. Refining approximations in software predicate abstraction. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 388-403. Springer-Verlag, 2004.