CafeOBJ as a tool for behavioral system verification

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We report on a machine supported method for verifying safety properties of dynamic systems based on the first-order description of underlying state transition systems. By capturing a set of states by a state predicate, we can verify safety properties of infinite-state systems using predicate calculus in the set-theoretic iterative calculation of least fixpoints. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Mori, A., & Futatsugi, K. (2003). CafeOBJ as a tool for behavioral system verification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2609, 461–470. https://doi.org/10.1007/3-540-36532-x_26

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