Formal Semantics of Runtime Monitoring, Verification, Enforcement and Control

被引:2
作者
Chen, Zhe [1 ]
Wei, Ou [1 ]
Huang, Zhiqiu [1 ]
Xi, Hongwei [2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, 29 Yudao St, Nanjing 210016, Jiangsu, Peoples R China
[2] Boston Univ, Dept Comp Sci, Boston, MA 02215 USA
来源
PROCEEDINGS 2015 INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING | 2015年
关键词
TEMPORAL ASSERTIONS;
D O I
10.1109/TASE.2015.11
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Runtime monitoring can be used to verify, enforce and control the dynamic execution of a target program at runtime to detect property violations, enforce desired properties and actively correct the execution, respectively. However, the state-of-the-art study lacks an appropriate formal program semantics of runtime monitoring. In this paper, we propose a theory of runtime control at an appropriate level of formalization to provide a formal program semantics of instrumented target programs under the control of controlling programs. Our theory provides a complete formal semantics for real implementations of runtime monitoring and control, but still retains a good balance between implementation and generality. Indeed, the theory encompasses the formalization of key implementation techniques, such as program instrumentation, synchronization on passively monitored actions, and synthesis of controlling programs from specifications. On the other hand, the theory is so generic and expressive that many existing formalisms about runtime monitoring can be considered as special cases of our theory.
引用
收藏
页码:63 / 70
页数:8
相关论文
共 21 条
[1]  
Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
[2]   Composing Expressive Runtime Security Policies [J].
Bauer, Lujo ;
Ligatti, Jay ;
Walker, David .
ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2009, 18 (03)
[3]  
Chen F, 2007, OOPSLA: 22ND INTERNATIONAL CONFERENCE ON OBJECT-ORIENTED PROGRAMMING, SYSTEMS, LANGUAGES, AND APPLICATIONS, PROCEEDINGS, P569
[4]   Control Systems on Automata and Grammars [J].
Chen, Zhe .
COMPUTER JOURNAL, 2015, 58 (01) :75-94
[5]   On the Generative Power of ω-Grammars and ω-Automata [J].
Chen, Zhe .
FUNDAMENTA INFORMATICAE, 2011, 111 (02) :119-145
[6]  
Chen Z, 2009, P INT COMP SOFTW APP, P324, DOI 10.1109/COMPSAC.2009.50
[7]   What can you verify and enforce at runtime? [J].
Falcone, Yliès ;
Fernandez, Jean-Claude ;
Mounier, Laurent .
International Journal on Software Tools for Technology Transfer, 2012, 14 (03) :349-382
[8]  
Falcone Y, 2010, LECT NOTES COMPUT SC, V6418, P89, DOI 10.1007/978-3-642-16612-9_9
[9]   Runtime enforcement monitors: composition, synthesis, and enforcement abilities [J].
Falcone, Ylies ;
Mounier, Laurent ;
Fernandez, Jean-Claude ;
Richier, Jean-Luc .
FORMAL METHODS IN SYSTEM DESIGN, 2011, 38 (03) :223-262
[10]   Computability classes for enforcement mechanisms [J].
Hamlen, KW ;
Morrisett, G ;
Schneider, FB .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2006, 28 (01) :175-205