Tutorial 1: Abstraction and refinement of concurrent programs and formal specification - A practical view

被引：0
|
作者：
Cansell, D
机构：
[1] Univ Nancy 1, LORIA, F-54506 Vandoeuvre Les Nancy, France
[2] Ctr Etud Saclay, CEA, DEIN, SLA, F-91191 Gif Sur Yvette, France
来源：
PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS | 2000年 / 1800卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1037 / 1038
页数：2
相关论文
共 7 条
  • [1] A FORMAL SYSTEM FOR SPECIFICATION ANALYSIS OF CONCURRENT PROGRAMS
    HIROSE, K
    TAKAHASHI, M
    [J]. PUBLICATIONS OF THE RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES, 1983, 19 (03) : 911 - 926
  • [2] A formal transformation and refinement method for concurrent programs
    Younger, EJ
    Bennett, KH
    Luo, Z
    [J]. INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, PROCEEDINGS, 1997, : 287 - 294
  • [3] Verification of Concurrent Programs Using Trace Abstraction Refinement
    Cassez, Franck
    Ziegler, Frowin
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 233 - 248
  • [4] 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
  • [5] Non-monotonic Refinement of Control Abstraction for Concurrent Programs
    Gupta, Ashutosh
    Popeea, Corneliu
    Rybalchenko, Andrey
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 188 - 202
  • [6] 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
  • [7] Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API
    Li, Guodong
    Palmer, Robert
    DeLisi, Michael
    Gopalakrishnan, Ganesh
    Kirby, Robert M.
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2011, 76 (02) : 65 - 81
1