Titlebook: NASA Formal Methods; 6th International Sy Julia M. Badger,Kristin Yvonne Rozier Conference proceedings 2014 Springer International Publishi

Indolent

策略

Combining PVSio with Stateflow,PVS verification. The effectiveness of the approach is demonstrated on a medical device prototype, which consists of a user interface developed in PVS and a software controller implemented in Stateflow. Simulation on the prototype shows that simulation data produced is exchanged smoothly between in PVSio and Stateflow.

革新

A Compositional Monitoring Framework for Hard Real-Time Systems,nal monitoring framework coupled with guarantees that include time isolation and the response time of a monitor for a predicted violation. The kind of monitors that we propose are automatically generated by synthesizing logic formulas of a timed temporal logic, and their correctness is ensured by construction.

填滿

lambaste

Refinement Types for ,,,on types, we obtain type annotations on top of an untyped specification language, getting the best of both the typed and untyped approaches. After implementing the type inference algorithm, we show that the resulting typing discipline improves the verification capabilities of the proof system.

構(gòu)想

Using Lightweight Theorem Proving in an Asynchronous Systems Context,ation safely upheld coherency and freshness. We believe that the resulting program code forms a good example of how easily linear and dependent types can be applied in practice to prove useful properties of low-level concurrent systems programming, while leaving no traces of runtime overhead.

CRAMP

Qed. Computing What Remains to Be Proved,n extensible simplification engine. We illustrate the power of our framework by the implementation of non-trivial simplifications inside the . plug-in of .. These optimizations have been used to prove industrial, critical embedded softwares.

STING

Conference proceedings 2014 – May 1, 2014. The 20 revised regular papers presented together with 9 short papers were carefully reviewed and selected from 107 submissions. The topics include model checking, theorem proving, static analysis, model-based development, runtime monitoring, formal approaches to fault tolerance, appl

肌肉

On Proving Recoverability of Smart Electrical Grids, and refinement capabilities that support correct-by-construction stepwise development of models; also, Event-B is tool supported. Being able to prove various properties for such critical systems is fundamental nowadays, as our society is increasingly powered by dynamic digital solutions to traditional problems.

褪色

Formally Verified Computation of Enclosures of Solutions of Ordinary Differential Equations,th statically fixed precision and is based on the well-known Euler method. We abstract discretization and round-off errors in the domain of affine forms. Code can be extracted from the verified algorithm and experiments indicate that the extracted code exhibits reasonable efficiency.