Descriptive Complexity and Model Checking

Descriptive Complexity [I98] is an approach to complexity that measures the richness of a language or sentence needed to describe a given property. There is a profound relationship between the traditional computational complexity of a problem and the descriptive complexity of the problem. In this setting, the finite object being worked on is treated as a logical structure. Thus descriptive complexity is part of finite model theory [EF95].

[1]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[2]  Neil Immerman.  DSPACE[n k ] = VAR[k+1]. , 1991 .

[3]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[4]  Constance L. Heitmeyer,et al.  Verifying SCR Requirements Specifications Using State Exploration , 1997 .

[5]  Neil Immerman,et al.  Dyn-FO: A Parallel, Dynamic Complexity Class , 1997, J. Comput. Syst. Sci..

[6]  Neil Immerman,et al.  Model Checking and Transitive-Closure Logic , 1997, CAV.

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Robert P. Kurshan.  Formal verification in a commercial setting , 1997, DAC.

[9]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[10]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[11]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[12]  Neil Immerman,et al.  DSPACE (n/sup k/)=VAR(k+1) , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.