Symbolic algorithmic verification of generalized noninterference

Authors:
Conghua Zhou
Affiliations:
School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, China
Venue:
WSEAS Transactions on Computers
Year:
2009

Citing 13
Cited 0

The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties

IEEE Transactions on Software Engineering
Evaluating Deadlock Detection Methods for Concurrent Software

IEEE Transactions on Software Engineering
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions

SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A general theory of security properties

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Searching for truth: techniques for satisfiability of boolean formulas

Searching for truth: techniques for satisfiability of boolean formulas
Algorithmic Verification of Noninterference Properties

Electronic Notes in Theoretical Computer Science (ENTCS)
Compressing BMC Encodings with QBF

Electronic Notes in Theoretical Computer Science (ENTCS)
SAT-based Induction for Temporal Safety Properties

Electronic Notes in Theoretical Computer Science (ENTCS)
QBF-based symbolic model checking for knowledge and time

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
QBF reasoning on real-world instances

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Bounded model checking with QBF

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an algorithmic verification technique to check generalized noninterference. Our technique is based on the counterexamples search strategy mainly which generating counterexamples of minimal length. In order to make the verification procedure terminate as soon as possible we also discuss how to integrate the window induction proof strategy in our technique. We further show how to reduce counterexamples search and induction proof to quantified propositional satisfiability. This reduction enables us to use efficient quantified propositional decision procedures to perform generalized noninterference checking.