Verification of pushdown systems using omega algebra with domain

Authors:
Vincent Mathieu;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 5
Cited 3

A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Kleene algebra with domain

ACM Transactions on Computational Logic (TOCL)

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
Towards a typed omega algebra

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Extended designs algebraically

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for the verification of pushdown systems. These systems can model the interprocedural control flow of computer programs. The framework is based on an extension of Kleene algebra called omega algebra with domain. This allows to formulate behavioural properties that refer to both actions and states.