Skip to main content
Conference ProceedingsOPEN ACCESS

A semantics driven temporal verification system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 300 LNCS 21-33
DOI: 10.1007/3-540-19027-9_2
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present an overview of SMG, a generic state machine generator, which interfaces to various temporal logic model checkers and provides a practical generic temporal verification system. SMG transforms programs written in user-definable languages to suitable finite state models. thus enabling fast verification of temporal properties of the input program. It can be applied, in particular, to the verification of temporal properties of concurrent and reactive systems.

Cite

CITATION STYLE

APA

Gough, G. D., & Barringer, H. (1988). A semantics driven temporal verification system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 300 LNCS, pp. 21–33). Springer Verlag. https://doi.org/10.1007/3-540-19027-9_2

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