Titlebook: NASA Formal Methods; 4th International Sy Alwyn E. Goodloe,Suzette Person Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 201

Ligament

Inferring Definite Counterexamples through Under-Approximation,n logic and that only generates legitimate traces that reveal actual defects. The key to tractability lies in modifying an existing projection algorithm to stop prematurely with an under-approximation and by combining various algorithmic techniques to handle loops finitely.

小隔間

Enhancing the Inverse Method with State Merging,h . is guaranteed to behave in an equivalent time-abstract manner. We show that the integration of merging into . leads to the synthesis of larger zones around ... It also often improves the performance of ., both in terms of computational space and time, as shown by our experimental results.

植物茂盛

注視

Conference proceedings 2012odel checking, abstraction and abstraction refinement, compositional verification techniques, static and dynamic analysis techniques, fault protection, cyber security, specification formalisms, requirements analysis and applications of formal techniques.

敘述

Conference proceedings 2012ril 2012. The 36 revised regular papers presented together with 10 short papers, 3 invited talks were carefully reviewed and selected from 93 submissions. The topics are organized in topical sections on theorem proving, symbolic execution, model-based engineering, real-time and stochastic systems, m

fetter

0302-9743 tional verification techniques, static and dynamic analysis techniques, fault protection, cyber security, specification formalisms, requirements analysis and applications of formal techniques.978-3-642-28890-6978-3-642-28891-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

財(cái)政

Rigorous Polynomial Approximation Using Taylor Models in Co,,ry for computing them. We compare the performances of our implementation in Coq with those of the Sollya tool, which contains an implementation of Taylor models written in C. This is a milestone in our long-term goal of providing fully formally proved and efficient Taylor models.

詞根詞綴法

Compositional Verification of Architectural Models,esign, and provide a proof of the soundness of our compositional reasoning approach. An example based on an aircraft flight control system is provided to illustrate the method and supporting analysis tools.

pancreas

Symbolic Execution of Communicating and Hierarchically Composed UML-RT State Machines,n the composition. For illustration, the technique is applied to analyze UML-RT models and the paper shows several analyses options such as reachability checking or test case generation. The presentation of the technique is formal, but we also report on the implementation and we present some experimental results.

不足的東西

PVS Linear Algebra Libraries for Verification of Control Software Algorithms in C/ACSL,e., ellipsoids. Our framework achieves the translation of stability properties expressed on the code to the representation of an associated proof obligation (PO) in PVS. Our library allows us to discharge these POs within PVS.