Checking Models, Proving Programs, and Testing Systems

被引:0
|
作者
Gaudel, Marie-Claude [1 ,2 ]
机构
[1] Univ Paris Sud, Lab LRI, F-91405 Orsay, France
[2] CNRS, F-91405 Orsay, France
来源
TESTS AND PROOFS, TAP 2011 | 2011年 / 6706卷
关键词
software verification; software testing; SYMBOLIC EXECUTION; GENERATION; VERIFICATION; CHALLENGES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We are all faced up to a flowering of concepts and methods in the area of software verification and validation, due to significant advances in the domain. This paper considers the main terms and expressions currently in use on the subjects of model, specification, program, system, proof, checking, testing. Some analysis of the use and combination of these terms is sketched, pointing out some confusions and discrepancies. This leads to a plea for clarification of the taxonomy and terminology. The aim is a better identification of the general concepts and activities in the area, and the development of some uniform basic terminology helping communication and cooperation among the scientific and industrial actors.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 50 条
  • [21] Testing Automation Systems by Means of Model Checking
    Buzhinsky, Igor
    Vyatkin, Valeriy
    2017 22ND IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2017,
  • [22] Types as models: Model checking message-passing programs
    Chaki, S
    Rajamani, SK
    Rehof, J
    ACM SIGPLAN NOTICES, 2002, 37 (01) : 45 - 57
  • [23] Efficient algorithms for checking the equivalence of programs in interrupt handling models
    Shcherbina V.L.
    Zakharov V.A.
    Moscow University Computational Mathematics and Cybernetics, 2008, 32 (2) : 95 - 102
  • [24] ON THE POLYNOMIAL COMPLEXITY OF THE EQUIVALENCE CHECKING PROBLEM IN ALGEBRAIC MODELS OF PROGRAMS
    Podlovchenko, R. I.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (05) : 653 - 659
  • [25] Proving more properties with bounded model checking
    Awedh, M
    Somenzi, F
    COMPUTER AIDED VERIFICATION, 2004, 3114 : 96 - 108
  • [26] Checking Sufficient Completeness by Inductive Theorem Proving
    Meseguer, Jose
    REWRITING LOGIC AND ITS APPLICATIONS, WRLA 2022, 2022, 13252 : 171 - 190
  • [27] PROVING TERMINATION OF COMMUNICATING PROGRAMS
    PACZKOWSKI, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 458 : 416 - 426
  • [28] PROVING MODELS
    Bonner, Robert H.
    MECHANICAL ENGINEERING, 2016, 138 (03) : 9 - 9
  • [29] Proving termination of GHC programs
    Krishna Rao M.R.K.
    Kapur D.
    Shyamasundar R.K.
    New Generation Computing, 1997, 15 (3) : 293 - 338
  • [30] SPECIFICATION AND PROVING OF COMMAND PROGRAMS
    NEUHOLD, EJ
    WELLER, T
    ACTA INFORMATICA, 1976, 6 (01) : 15 - 40