Automatic abstraction for model checking software systems with interrelated numeric constraints

  • Authors:
  • Yunja Choi;Sanjai Rayadurgam;Mats P.E. Heimdahl

  • Affiliations:
  • Computer Science and Engineering, University of Minnesota, Minneapolis, MN;Computer Science and Engineering, University of Minnesota, Minneapolis, MN;Computer Science and Engineering, University of Minnesota, Minneapolis, MN

  • Venue:
  • Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model checking techniques have not been effective in important classes of software systems characterized by large (or infinite) input domains with interrelated linear and non-linear constraints over the input variables. Various model abstraction techniques have been proposed to address this problem. In this paper, we wish to propose domain abstraction based on data equivalence and trajectory reduction as an alternative and complement to other abstraction techniques. Our technique applies the abstraction to the input domain (environment) instead of the model and is applicable to constraint-free and deterministic constrained data transition system. Our technique is automatable with some minor restrictions.