Skip to main content
Conference Proceedings

Verification of pushdown systems using omega algebra with domain

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3929 LNCS 188-199
DOI: 10.1007/11734673_15
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Mathieu, V., & Desharnais, J. (2006). Verification of pushdown systems using omega algebra with domain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3929 LNCS, pp. 188–199). https://doi.org/10.1007/11734673_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free