返回
Automatic debugging of real-time systems based on incremental satisfiability counting
DOI:10.1109/TC.2006.97.png)
摘要
En 中文
Real-time logic (RTL) [ 2], [ 3], [ 4] is useful for the verification of a safety assertion with respect to the specification of a real-time system. Since the satisfiability problem for RTL is undecidable, the systematic debugging of a real-time system appears impossible. A first step toward this challenge was presented in [ 1]. With RTL, each propositional formula corresponds to a verification condition. The number of truth assignments of a propositional formula can help us determine the specific constraints which should be added or modified to get the expected solutions. This paper solves an even more challenging problem specified as future work in [ 1], namely, the embedding and the integration of our debugger in autonomous systems which generate real-time control plans on-the-fly, since these specifications must meet timing constraints, but without human interaction. The idea is to consider in advance all the necessary information, such as the designer's guidance. We have implemented a tool ( called ADRTL) that is able to perform automatic debugging. The confidence of our approach is high as we have successfully evaluated ADRTL on several existing industrial-based applications.
Keyword:
real-time system
system development tools
automatic debugging
formal methods
timing constraint
counting SAT problem
incremental computation
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
Synthesis, Characterisation and Catalytic Application of Oxidorhenium Complexes Bearing H‐Spirophosphorane Ligands含h-螺膦配体的氧化铼配合物的合成,表征及催化应用

