Counterexample-guided abstraction refinement

被引:0
|
作者
Clarke, E [1 ]
机构
[1] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The main practical problem in model checking is the combinatorial explosion of system states commonly known as the state explosion problem. Abstraction methods attempt to reduce the size of the state space by employing knowledge about the system and the specification in order to model only relevant features in the Kripke structure. Counterexample-guided abstraction refinement is an automatic abstraction method where, starting with a relatively small skeletal representation of the system to be verified, increasingly precise abstract representations of the system are computed. The key step is to extract informationfrom false negatives ("spurious counterexamples") due to overapproximation.
引用
收藏
页码:7 / 8
页数:2
相关论文
共 50 条
  • [1] Effective Heuristics for Counterexample-Guided Abstraction Refinement
    He, Fei
    Song, Xiaoyu
    Gu, Ming
    Sun, Jiaguang
    [J]. GLSVLSI'07: PROCEEDINGS OF THE 2007 ACM GREAT LAKES SYMPOSIUM ON VLSI, 2007, : 393 - 398
  • [2] Counterexample-guided abstraction refinement for symbolic model checking
    Clarke, E
    Grumberg, O
    Jha, S
    Lu, Y
    Veith, H
    [J]. JOURNAL OF THE ACM, 2003, 50 (05) : 752 - 794
  • [3] Counterexample-guided abstraction refinement for symmetric concurrent programs
    Donaldson, Alastair F.
    Kaiser, Alexander
    Kroening, Daniel
    Tautschnig, Michael
    Wahl, Thomas
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2012, 41 (01) : 25 - 44
  • [4] Counterexample-guided abstraction refinement for linear programs with arrays
    Alessandro Armando
    Massimo Benerecetti
    Jacopo Mantovani
    [J]. Automated Software Engineering, 2014, 21 : 225 - 285
  • [5] Counterexample-guided abstraction refinement for linear programs with arrays
    Armando, Alessandro
    Benerecetti, Massimo
    Mantovani, Jacopo
    [J]. AUTOMATED SOFTWARE ENGINEERING, 2014, 21 (02) : 225 - 285
  • [6] Thread-Modular Counterexample-Guided Abstraction Refinement
    Malkis, Alexander
    Podelski, Andreas
    Rybalchenko, Andrey
    [J]. STATIC ANALYSIS, 2010, 6337 : 356 - +
  • [7] SAT-based counterexample-guided abstraction refinement
    Clarke, EA
    Anubhav, G
    Strichman, O
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2004, 23 (07) : 1113 - 1123
  • [8] Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning
    Seipp, Jendrik
    Helmert, Malte
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2018, 62 : 535 - 577
  • [9] Counterexample-guided abstraction refinement for symmetric concurrent programs
    Alastair F. Donaldson
    Alexander Kaiser
    Daniel Kroening
    Michael Tautschnig
    Thomas Wahl
    [J]. Formal Methods in System Design, 2012, 41 : 25 - 44
  • [10] An Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop
    Nagaoka, Takeshi
    Okano, Kozo
    Kusumoto, Shinji
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (05) : 994 - 1005