Symbolic algorithmic verification of intransitive generalized noninterference
DOI10.1007/S11432-011-4372-YzbMATH Open1245.68139OpenAlexW2021177341MaRDI QIDQ439858FDOQ439858
Authors: Conghua Zhou, Hailing Wu, Song Chen, Zhifeng Liu, Shi-Guang Ju 
Publication date: 17 August 2012
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4372-y
Recommendations
intransitive generalized noninterferencemulti-level securityquantified Boolean satisfiabilitysymbolic verification
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- An automata based approach for verifying information flow properties
- Title not available (Why is that?)
- QBF-Based Symbolic Model Checking for Knowledge and Time
- Using stochastic local search to solve quantified Boolean formulae
Cited In (5)
- Automated verification of noninterference property
- Automated enforcement for relaxed information release with reference points
- Coupled relational symbolic execution for differential privacy
- Abstract Certification of Global Non-interference in Rewriting Logic
- Dynamic intransitive noninterference revisited
Uses Software
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)
