• DocumentCode
    415761
  • Title

    Heuristic-based model refinement for FLAVERS

  • Author

    Tan, Jianbin ; Avrunin, George S. ; Clarke, Lori A.

  • Author_Institution
    Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA
  • fYear
    2004
  • fDate
    23-28 May 2004
  • Firstpage
    635
  • Lastpage
    644
  • Abstract
    FLAVERS is a finite-state verification approach that allows an analyst to incrementally add constraints to improve the precision of the model of the system being analyzed. Except for trivial systems, however, it is impractical to compute which constraints should be selected to produce precise results for the least cost. Thus, constraint selection has been a manual task, guided by the intuition of the analyst. In this paper, we investigate several heuristics for selecting task automaton constraints, a kind of constraint that tends to reduce infeasible task interactions. We describe an experiment showing that one of these heuristics is extremely effective at improving the precision of the analysis results without significantly degrading performance.
  • Keywords
    constraint handling; finite state machines; heuristic programming; program verification; FLAVERS; constraint selection; finite-state verification; model refinement; task automaton constraints; task interactions; Automata; Computer science; Costs; Data analysis; Degradation; Information analysis; Laboratories; Performance analysis; Software engineering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering, 2004. ICSE 2004. Proceedings. 26th International Conference on
  • ISSN
    0270-5257
  • Print_ISBN
    0-7695-2163-0
  • Type

    conf

  • DOI
    10.1109/ICSE.2004.1317485
  • Filename
    1317485