Titlebook: NASA Formal Methods; 11th International S Julia M. Badger,Kristin Yvonne Rozier Conference proceedings 2019 Springer Nature Switzerland AG

Certainty

一致性

grudging

Towards a Two-Layer Framework for Verifying Autonomous Vehicles, ensured through formal verification. To facilitate the verification, it is beneficial to decouple the static high-level planning from the dynamic functions like collision avoidance. In this paper, we propose a conceptual two-layer framework for verifying autonomous vehicles, which consists of a sta

gentle

Clausal Proofs of Mutilated Chessboards,in exponential runtime of current SAT solvers. Although there exists a well-known short argument for solving mutilated chessboard problems, this argument is based on an abstraction that is challenging to discover by automated-reasoning techniques. In this paper, we present another short argument tha

seroma

Practical Causal Models for Cyber-Physical Systems,d social context, rendering these faults harder to diagnose. To complicate matters further, knowledge about the behavior and failure modes of a system are often collected in different models. We show how three of those models, namely attack trees, fault trees, and timed failure propagation graphs ca

商店街

新義

Structured Synthesis for Probabilistic Systems,system configuration. We define the structured synthesis problem as a nonlinear programming problem (NLP) with integer variables. As solving NLPs is not feasible in general, we present an alternative approach. A transformation of models specified in the PRISM probabilistic programming language creat

incontinence

Design and Runtime Verification Side-by-Side in eTrice,lopment of solutions for domains such as health, heavy machinery and the automotive. eTrice natively incorporates mechanisms for runtime verification. At the request of the developers of eTrice, we have incorporated model checking in their tool chain, by partly reusing the existing runtime verificat

abduction

Data Independence for Software Transactional Memory,ly, programmers can specify . (reading from and writing to shared state) which then execute in a “seeming” atomicity. This property is captured in a correctness criterion called .. For model checking the opacity of an STM algorithm, we – in principle – need to check opacity for all possible combinat

electrolyte

Transaction Protocol Verification with Labeled Synchronization Logic, the type of the used synchronization objects and associates labels to method calls to explicitly capture their intra-thread order. We use the language to capture architecture independent representations of transactional memory (TM) algorithms. We present a novel logic that enables reasoning about s