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

加入

Suda Bharadwaj,Steven Carr,Natasha Neogi,Hasan Poonawala,Alejandro Barberia Chueca,Ufuk Topcu

恭維

Allan Blanchard,Frédéric Loulergue,Nikolai Kosmatov

要塞

NIL

Using Binary Analysis Frameworks: The Case for BAP and angr,rand Challenge. We describe a number of experiments to evaluate the capabilities of the two tools. We have implemented a value-set analysis and a call graph comparison algorithm with each tool, and report on their performance, usability, and extensibility for real-world applications.

GOAD

印第安人

Design and Runtime Verification Side-by-Side in eTrice, At the request of the developers of eTrice, we have incorporated model checking in their tool chain, by partly reusing the existing runtime verification architecture. We report on the implementation of the tool, experiments that we conducted, and lessons learned regarding the synergies between the two verification techniques.

assent

sundowning

Clausal Proofs of Mutilated Chessboards,t is much easier to compute and that can be expressed within the recent (clausal) . proof system for?propositional logic. We construct short clausal proofs of mutilated chessboard problems using this new argument and validate them using a formally-verified proof checker.

ethnology

Extracting and Optimizing Formally Verified Code for Systems Programming,ity with memory and runtime performance. By handling effectful and pure functions separately MCQC can generate executable verified code directly from Gallina, reducing the effort of implementing and executing verified systems.

heirloom