Titlebook: NASA Formal Methods; 13th International S Aaron Dutle,Mariano M. Moscato,Ivan Perez Conference proceedings 2021 Springer Nature Switzerland

paleolithic

Program Sketching Using Lifted Analysis for Numerical Program Families,n abstract interpretation, which is used for analyzing program families with numerical features. It takes as input the common code base, which encodes all variants of a program family, and produces precise results for all variants in a single analysis run. The elements of the underlying lifted analy

傀儡

Specification Decomposition for Reactive Synthesis,rified programs and hardware. Despite recent advances, reactive synthesis is still not practical when the specified systems reach a certain bound in size and complexity. In this paper, we present a modular synthesis algorithm that decomposes the specification into smaller subspecifications. For them

逢迎白雪

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols,property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative . approach that does not prescribe, ., a specific quantifier pr

neutralize

Integrating Runtime Verification into a Sounding Rocket Control System,ely ending the team’s participation. The ACS engaged incorrectly before motor burnout, altering the rocket’s trajectory and leading to a dangerous crash. The ability to detect this fault in real time on-board the ACS’s Arduino microcontroller would have prevented an uncontrolled landing and rapid un

半球

Verification of Functional Correctness of Code Diversification Techniques,nal properties, such as whether the technique improves security. This paper provides a methodology to verify functional equivalence between the original and a diversified binary. We present a formal notion of binary equivalence resilient to diversification. Moreover, an algorithm is presented that c

BATE

Scalable Reliability Analysis by Lazy Verification,in a conservative and an optimistic manner. By considering unexplored states as being always operational or, dually, already failed, our analysis yields sound upper- and lower-bounds on the system’s reliability. This approach is applied in an iterative manner until the desired precision is obtained.

比喻好

Robustifying Controller Specifications of Cyber-Physical Systems Against Perceptual Uncertainty,account perceptual uncertainty. To address this, we propose an automated workflow that takes an Event-B model of an uncertainty-unaware controller and a specification of uncertainty as input. First, our workflow automatically injects the uncertainty into the original model to obtain an uncertainty-a

壁畫(huà)

鬼魂

fleeting