Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On local reasoning in verification
C Ihlemann, S Jacobs… - … Conference on Tools and …, 2008 - Springer
We present a general framework which allows to identify complex theories important in
verification for which efficient reasoning methods exist. The framework we present is based …
verification for which efficient reasoning methods exist. The framework we present is based …
Application of formal methods in train control system
CAO Yuan, T Tao, X Tian-Hua… - 交通运输工程 …, 2010 - transport.chd.edu.cn
To ensure the correctness of train control system design and development, the ways of
simulation, test and formalization were compared. According to the safe critical attribute of …
simulation, test and formalization were compared. According to the safe critical attribute of …
Towards complete reasoning about axiomatic specifications
To support verification of expressive properties of functional programs, we consider
algebraic style specifications that may relate multiple user-defined functions, and compare …
algebraic style specifications that may relate multiple user-defined functions, and compare …
形式化方法在列车运行控制系统中的应用
为了确保列车运行控制系统设计和开发的**确性, 比较了仿真, 测试和形式化3
种能够验证系统设计**确性的方式. 根据列车运行控制系统对安全的苛求性, 提出了4 …
种能够验证系统设计**确性的方式. 根据列车运行控制系统对安全的苛求性, 提出了4 …
Hierarchical reasoning for the verification of parametric systems
V Sofronie-Stokkermans - … 5th International Joint Conference, IJCAR 2010 …, 2010 - Springer
We study certain classes of verification problems for parametric reactive and hybrid systems,
and identify the types of logical theories which can be used for modeling such systems and …
and identify the types of logical theories which can be used for modeling such systems and …
Verifying CSP-OZ-DC specifications with complex data types and timing parameters
We extend existing verification methods for CSP-OZ-DC to reason about real-time systems
with complex data types and timing parameters. We show that important properties of …
with complex data types and timing parameters. We show that important properties of …
An SMT approach to bounded reachability analysis of model programs
Abstract Model programs represent transition systems that are used to specify expected
behavior of systems at a high level of abstraction. The main application area is application …
behavior of systems at a high level of abstraction. The main application area is application …
Automatic verification of parametric specifications with complex topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity
at various levels: in specification, in verification, and structurally. For specifications, we use …
at various levels: in specification, in verification, and structurally. For specifications, we use …
Incremental instance generation in local reasoning
S Jacobs - … Aided Verification: 21st International Conference, CAV …, 2009 - Springer
Many verification approaches use SMT solvers in some form, and are limited by their
incomplete handling of quantified formulas. Local reasoning allows to handle SMT problems …
incomplete handling of quantified formulas. Local reasoning allows to handle SMT problems …
Hierarchical and modular reasoning in complex theories: The case of local theory extensions
V Sofronie-Stokkermans - … Symposium on Frontiers of Combining Systems, 2007 - Springer
We present an overview of results on hierarchical and modular reasoning in complex
theories. We show that for a special type of extensions of a base theory, which we call local …
theories. We show that for a special type of extensions of a base theory, which we call local …