论文信息 - First-Order-CTL Model Checking

First-Order-CTL Model Checking

This work presents a first-order model checking procedure that verifies systems with large or even infinite data spaces with respect to first-order CTL specifications. The procedure relies on a partition of the system variables into control and data. While control values are expanded into BDD-representations, data values enter in form of their properties relevant to the verification task. The algorithm is completely automatic. If the algorithm terminates, it has generated a first-order verification condition on the data space which characterizes the system’s correctness. Termination can be guaranteed for a class that properly includes the data-independent systems, defined in [10].

[1] Armin Biere,et al. Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification , 1998, FMCAD.

[2] Xiaoyu Song,et al. Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs , 1998, CAV.

[3] David L. Dill,et al. Automatic verification of Pipelined Microprocessor Control , 1994, CAV.

[4] Pierre Wolper,et al. An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) , 1994, CAV.

[5] Robert K. Brayton,et al. Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory , 1998, CAV.

[6] Edmund M. Clarke,et al. Model checking and abstraction , 1994, TOPL.

[7] Susanne Graf,et al. Verification of a Distributed Cache Memory by Using Abstractions , 1994, CAV.

[8] Hardi Hungar,et al. What if model checking must be truly symbolic , 1995, CHARME.

[9] Pierre Wolper,et al. An automata-theoretic approach to branching-time model checking , 2000, JACM.

[10] Pierre Wolper,et al. Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.

[11] Jürgen Dingel,et al. Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving , 1995, CAV.