Symbolic algorithmic verification of intransitive generalized noninterference
From MaRDI portal
Recommendations
Cites work
- An automata based approach for verifying information flow properties
- scientific article; zbMATH DE number 2166693 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
- QBF-Based Symbolic Model Checking for Knowledge and Time
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Using stochastic local search to solve quantified Boolean formulae
Cited in
(5)- Automated enforcement for relaxed information release with reference points
- Dynamic intransitive noninterference revisited
- Automated verification of noninterference property
- Coupled relational symbolic execution for differential privacy
- Abstract Certification of Global Non-interference in Rewriting Logic
This page was built for publication: Symbolic algorithmic verification of intransitive generalized noninterference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439858)