Static analysis of programs using omega algebra with tests

Authors:
Claude Bolduc;Jules Desharnais
Affiliations:
Département d'informatique et de génie logiciel, Université Laval, Québec, QC, Canada;Département d'informatique et de génie logiciel, Université Laval, Québec, QC, Canada
Venue:
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Year:
2005

Citing 6
Cited 1

Patterns in property specifications for finite-state verification

Proceedings of the 21st international conference on Software engineering
Enforceable security policies

ACM Transactions on Information and System Security (TISSEC)
Kleene Algebra with Tests: Completeness and Decidability

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Separation and Reduction

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
From Kleene Algebra to Refinement Algebra

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Some results in dynamic model theory

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)

Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Kozen has proposed a framework based on Kleene algebra with tests for verifying that a program satisfies a security policy specified by a security automaton. A security automaton is used for the specification of linear safety properties on finite and infinite runs. This kind of property is very interesting for most common programs. However, it is not possible to specify liveness properties with security automata. In this paper, we use omega algebra with tests and automata on infinite words to extend the field of properties that can be handled by security automata in Kozen's framework.