Static Analysis and Verification of Aerospace Software by Abstract Interpretation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static Analysis and Verification of Aerospace Software by Abstract Interpretation

We discuss the principles of static analysis by abstract interpretation and report on the automatic verification of the absence of runtime errors in large embedded aerospace software by static analysis based on abstract interpretation. The first industrial applications concerned synchronous control/command software in open loop. Recent advances consider imperfectly synchronous programs, paralle...

متن کامل

Static Analysis and Veri cation of Aerospace Software by Abstract Interpretation (Abstract)

The validation of software checks informally (e.g., by code reviews or tests) the conformance of the software executions to a speci cation. More rigorously, the veri cation of software proves formally the conformance of the software semantics (that is, the set of all possible executions in all possible environments) to a speci cation. It is of course di cult to design a sound semantics, to get ...

متن کامل

Avionic Software Verification by Abstract Interpretation

An flight control surface actuation system in avionics is safety critical and complex since it is placed between the pilot's controls (sidesticks, rudder pedals) and the control surfaces of the aircraft, whose movement it controls and monitors. For reliability and dependability, several redundant software and computers are used but each one must be proved to be correct. With the exponential inc...

متن کامل

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming

values in A. This justifies the choice of the backward and forward terminology above. We denote by, respectively, F(C, f) and B(C, f) the set of Fand Bcomplete abstractions of C for f . It is worth noting that in general F(C, f) 6⊆ B(C, f) and F(C, f) 6⊆ B(C, f), namely Band F-completeness are incomparable notions. Example 1. Let Sign be the simple abstraction of 〈℘(Z),⊆〉 for analysing integer ...

متن کامل

Certified Static Analysis by Abstract Interpretation

A certified static analysis is an analysis whose semantic validity has been formally proved correct with a proof assistant. We propose a tutorial on building a certified static analysis in Coq. We study a simple bytecode language for which we propose an interval analysis that allows to verify statically that no array-out-of-bounds accesses will occur.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations and Trends® in Programming Languages

سال: 2015

ISSN: 2325-1107,2325-1131

DOI: 10.1561/2500000002