Adversarial reachability for program-level security analysis

DOI10.1007/978-3-031-30044-8_3MaRDI QIDQ6535227zbMATH OpenFDO

Authors Soline Ducousso, Sébastien Bardin, Marie-Laure Potet

Publication date 24 November 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30044-8_3

zbMATH Keywords

attacker modelfault injectionprogram analysissymbolic execution

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Adversarial logic
• Quantitative fault injection analysis
• Not all bugs are created equal, but robust reachability can tell the difference
• Low-level reachability analysis based on formal logic

Cites work

• Arrays made simpler: an efficient, scalable and thorough preprocessing
• Automata, Languages and Programming
• Bounded model checking using satisfiability solving
• Counterexample-guided abstraction refinement for symbolic model checking
• Cryptographically sound implementations for typed information-flow security
• scientific article; zbMATH DE number 1979271 (Why is no real title available?)
• Modelling metamorphism by abstract interpretation
• Not all bugs are created equal, but robust reachability can tell the difference
• Programming Languages and Systems
• Satisfiability modulo theories
• SymPLFIED: Symbolic Program-Level Fault Injection and Error Detection Framework
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(2)

• scientific article; zbMATH DE number 7774275 (Why is no real title available?)
• Low-level reachability analysis based on formal logic

This page was built for publication: Adversarial reachability for program-level security analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535227)