The Boundary Between Decidability and Undecidability for Transitive-Closure Logics

To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from a program’s variables. On the other hand, with a few notable exceptions, adding transitive closure to even very tame logics makes them undecidable.

[1]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[2]  Nils Klarlund,et al.  Mona: Monadic Second-Order Logic in Practice , 1995, TACAS.

[3]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[4]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[5]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[6]  Neil Immerman,et al.  Verification via Structure Simulation , 2004, CAV.

[7]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[8]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[9]  Thomas W. Reps,et al.  Symbolically Computing Most-Precise Abstract Operations for Shape Analysis , 2004, TACAS.

[10]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[11]  Jianwen Su,et al.  Space-bounded FOIES (extended abstract) , 1995, PODS '95.

[12]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[13]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[14]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[15]  Martin Otto,et al.  Undecidability Results on Two-Variable Logics , 1997, STACS.

[16]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[17]  李幼升,et al.  Ph , 1989 .

[18]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.