Scalable compositional reachability analysis of real-time concurrent systems

A description model for high level behavior of a real time concurrent system is presented. A verification algorithm is then devised to take advantage of interaction locality and symmetry and internal operation concealment in the model. A system called VERIFAST implements the algorithm. Experiments show that VERIFAST runs fast and exhibits time complexity linear to the size of concurrency in a benchmark.

[1]  Zohar Manna,et al.  From Timed to Hybrid Systems , 1991, REX Workshop.

[2]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

[3]  R. BurchJ.,et al.  Symbolic model checking , 1992 .

[4]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[5]  Ellis Horowitz,et al.  Fundamentals of programming languages (2. ed.) , 1984, Computer software engineering series.

[6]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[7]  Cliff B. Jones,et al.  Systematic software development using VDM (2. ed.) , 1990, Prentice Hall International Series in Computer Science.

[8]  Farn Wang.  Reachability Analysis at Procedure Level through Timing Coincidence , 1995, CONCUR.

[9]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[10]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[11]  Farn Wang,et al.  Distributed real-time system specification and verification in APTL , 1993, TSEM.

[12]  Zohar Manna,et al.  Verifying Hybrid Systems , 1992, Hybrid Systems.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[15]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[16]  Farn Wang,et al.  Timing behavior analysis for real-time systems , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[17]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[18]  Harvey M. Deitel,et al.  An introduction to operating systems , 1984 .

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.