Xs are for Trajectory Evaluation, Booleans are for Theorem Proving

@inproceedings{Aagaard1999XsAF,
  title={Xs are for Trajectory Evaluation, Booleans are for Theorem Proving},
  author={Mark Aagaard and Thomas F. Melham and John W. O'Leary},
  booktitle={CHARME},
  year={1999}
}
This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prove a theorem that translates correctness results from trajectory evaluation over a four-valued lattice into a shallow embedding of temporal operators over Boolean streams. This translation connects the specialized world of trajectory evaluation to a general-purpose logic and provides the semantic basis for connecting additional… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Symbolic Trajectory Evaluation

Formal Hardware Verification • 1997
View 10 Excerpts
Highly Influenced

Introduction to HOL: a theorem proving environment for higher order logic

M.J.C. Gordon, T. F. Melham, editors
1993
View 12 Excerpts
Highly Influenced

Automating a model checker for recursive modal assertions in HOL

S. Agerholm, H. Skjødt
Technical Report DAIMI IR-92, • 1990
View 10 Excerpts
Highly Influenced

Program and Abstracts of the BRICS

A. Cheng, K. Larsen, editors
Autumn School on the Verification, • 1996
View 1 Excerpt

Theorem Proving in Higher Order Logics

Lecture Notes in Computer Science • 1996
View 1 Excerpt