CafeOBJ as a tool for behavioral system verification

Authors:
Akira Mori;Kokichi Futatsugi
Affiliations:
Japan National Institute of Advanced Industrial Science and Technology;Japan Advanced Institute of Science and Technology
Venue:
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Year:
2002

Citing 5
Cited 3

A hidden agenda

Theoretical Computer Science
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM
Athena: a novel approach to efficient automatic security protocol analysis

Journal of Computer Security
Refining Model Checking by Abstract Interpretation

Automated Software Engineering
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems

Verifying Design with Proof Scores

Verified Software: Theories, Tools, Experiments
Formal Analysis of the Bakery Protocol with Consideration of Nonatomic Reads and Writes

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Fostering proof scores in CafeOBJ

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

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.