Using dynamic pushdown networks to automate a modular information-flow analysis

DOI10.1007/978-3-319-27436-2_12MaRDI QIDQ5743593zbMATH OpenOpenAlexFDO

Authors Heiko Mantel, Markus Müller-Olm, Matthias Perner, Alexander Wenner

Publication date 5 February 2016

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27436-2_12

zbMATH Keywords

concurrencyinformation-flow securitystatic analysis

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• CONCUR 2005 – Concurrency Theory
• Static Analysis
• scientific article; zbMATH DE number 2084343
• scientific article; zbMATH DE number 2064465
• Programming Languages and Systems

Cites work

• An Axiomatic Approach to Information Flow in Programs
• Combining Different Proof Techniques for Verifying Information Flow Security
• scientific article; zbMATH DE number 2084343 (Why is no real title available?)
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints

Cited in

(2)

• Types versus PDGs in information flow analysis
• Taming Message-Passing Communication in Compositional Reasoning About Confidentiality

Describes a project that uses

Uses Software

• JFlow
• Paragon

This page was built for publication: Using dynamic pushdown networks to automate a modular information-flow analysis

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