A Formally-Verified C Static Analyzer
نویسندگان
چکیده
منابع مشابه
A Formally-Verified Alias Analysis
This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values. The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation. The analysis is d...
متن کاملFormally Verified Modular Semantics
This chapter presents the results of the validation and verification of a crucial component of BOS, a large safety-critical system that decides when to close and open the Maeslantkering, a storm surge barrier near the city of Rotterdam in the Netherlands. BOS was specified in the formal language Z and model checking has been applied to some of its subsystems during its development. A lightweigh...
متن کاملFormally Verified System Initialisation
The safety and security of software systems depends on how they are initially configured. Manually writing program code that establishes such an initial configuration is a tedious and error-prone engineering process. In this paper we present an automatic and formally verified initialiser for component-based systems built on the general-purpose microkernel seL4. The construction principles of th...
متن کاملFormally Verified On-Line Diagnosis
A recon gurable fault tolerant system achieves the attributes of dependability of operations through fault detection fault isolation and recon guration typically referred to as the FDIR paradigm Fault diagnosis is a key component of this approach requiring an accurate deter mination of the health and state of the system An imprecise state assessment can lead to catastrophic failure due to an op...
متن کاملA Formally Verified Register Allocation Framework
When using formal methods to generate compilers it is desirable for all levels of the compiler to be formally specified. Typically, register allocation has been thought to be equivalent to graph coloring. Since graph coloring is NP-Complete most algorithms for register allocation have been ad-hoc. This paper presents a framework for register allocation that has been formally verified using an i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2775051.2676966