Using dependence graphs to assist verification and testing of information-flow properties

DOI10.1007/978-3-319-92994-1_5MaRDI QIDQ6039392zbMATH OpenOpenAlexFDO

Authors Mihai Herda, Shmuel Tyszberowicz, Bernhard Beckert

Publication date 5 May 2023

Published in Tests and Proofs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-92994-1_5

zbMATH Keywords

testingnoninterferencedeductive verificationinformation flow controlsystem dependence graph

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Information-flow and data-flow analysis of while-programs
• A sound analysis for secure information flow using abstract memory graphs
• Types versus PDGs in information flow analysis
• Content dependent information flow control
• A Logical System for Modular Information Flow Verification

Cited in

(2)

• Using Relational Verification for Program Slicing
• An automata based approach for verifying information flow properties

This page was built for publication: Using dependence graphs to assist verification and testing of information-flow properties

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