Measuring behavioral correspondence to a timed concurrent model

Research in formal methods has produced fruitful techniques that can verify global properties of a design of a real-time system, or exact behavioral correspondence to the design. Exactness is often not achieved, however, and yet understanding how close the design and system correspond still would be very valuable to direct further efforts in achieving exactness or to modify the design where the system simply cannot achieve the requirements. The paper describes a method and tool that fills this niche, by quantitatively measuring how closely the behavior of a real-time system corresponds to its specification, given in a timed, concurrent model.

[1]  Alexander L. Wolf,et al.  Event-based detection of concurrency , 1998, SIGSOFT '98/FSE-6.

[2]  Shing-Chi Cheung,et al.  Checking safety properties using compositional reachability analysis , 1999, TSEM.

[3]  Alexander L. Wolf,et al.  Software process validation: quantitatively measuring the correspondence of a process to a model , 1999, TSEM.

[4]  Yingjun Zhang,et al.  Broad-spectrum studies of log file analysis , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[5]  Doron A. Peled,et al.  Using partial-order methods in the formal validation of industrial concurrent programs , 1996, ISSTA '96.

[6]  강문설 [서평]「The Unified Modeling Language User Guide」 , 1999 .

[7]  Alexander L. Wolf,et al.  Cost-Effective Analysis of In-Place Software Processes , 1998, IEEE Trans. Software Eng..

[8]  Miguel Felder,et al.  Verification of real-time designs: combining scheduling theory with automatic formal verification , 1999, ESEC/FSE-7.

[9]  Louise E. Moser,et al.  A graphical environment for the design of concurrent real-time systems , 1997, TSEM.

[10]  Thomas Ball,et al.  The concept of dynamic analysis , 1999, ESEC/FSE-7.

[11]  Rajeev Alur,et al.  Model-Checking of Real-Time Systems: A Telecommunications Application Experience Report , 1997, Proceedings of the (19th) International Conference on Software Engineering.

[12]  George S. Avrunin,et al.  Automated Analysis of Concurrent Systems With the Constrained Expression Toolset , 1991, IEEE Trans. Software Eng..

[13]  Amnon Naamad,et al.  The STATEMATE semantics of statecharts , 1996, TSEM.

[14]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..