Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis

DOI10.1007/978-3-319-27436-2_12zbMath1473.68049OpenAlexW2398006786MaRDI QIDQ5743593

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

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

static analysisconcurrencyinformation-flow security

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)

Related Items (1)

Taming Message-Passing Communication in Compositional Reasoning About Confidentiality

Uses Software

• Paragon
• JFlow

Cites Work

• Combining Different Proof Techniques for Verifying Information Flow Security
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
• An Axiomatic Approach to Information Flow in Programs
• Unnamed Item

This page was built for publication: Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis