Techniques for Abstracting SDL Specifications

Abstracting the behaviour of a specification is a key technique for dealing with the complexity of such tasks as reachability analysis and test generation. We adapted classical data-flow analysis techniques to abstract variables in SDL processes and addressed the problem of finding conservative state abstractions. Prototype tools have been developed to implement those techniques and applied to simple applications from the field of telecommunications.

[1]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[2]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[3]  Joseph Sifakis,et al.  IF: An intermediate representation for SDL and its applications , 1999, SDL Forum.

[4]  G. Bochmann,et al.  Fault Models in Testing , 1991, Protocol Test Systems.

[5]  R. Lathe.  Phd by thesis , 1988, Nature.

[6]  Stephan Merz,et al.  Model Checking , 2000 .

[7]  Kostas N. Oikonomou.  Abstractions of finite-state machines and optimality with respect to immediately-detectable next-state faults , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[8]  Thierry Jéron,et al.  Automated test generation from SDL specifications , 1999, SDL Forum.

[9]  Alexandre Petrenko,et al.  Test Generation for CEFSM Combining Specification and Fault Coverage , 2002, TestCom.

[10]  Dieter Hogrefe,et al.  Dealing with the complexity of state space exploration algorithms for SDL systems , 1996 .

[11]  Marius Bozga,et al.  State space reduction based on live variables analysis , 2003, Sci. Comput. Program..

[12]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[13]  Jacob A. Abraham,et al.  Abstraction Techniques for Validation Coverage Analysis and Test Generation , 1998, IEEE Trans. Computers.

[14]  Thierry Jéron,et al.  An Approach to Symbolic Test Generation , 2000, IFM.

[15]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[16]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[17]  Alexandre Petrenko,et al.  Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography , 2000, MOVEP.

[18]  Alexandre Petrenko,et al.  Confirming configurations in EFSM , 1999, FORTE.

[19]  Arthur Gill,et al.  Introduction to the theory of finite-state machines , 1962 .

[20]  Dorel Marius Bozga.  Vérification symbolique pour les protocoles de communication , 1999 .

[21]  Nina Yevtushenko,et al.  Test Suite Generation from a FSM with a Given Type of Implementation Errors , 1992, PSTV.