Skip to main content
Conference ProceedingsOPEN ACCESS

SAT-based assistance in abstraction refinement for symbolic trajectory evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4144 LNCS 175-189
DOI: 10.1007/11817963_19
9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a SAT-based algorithm for assisting users of Symbolic Trajectory Evaluation (STE) in manual abstraction refinement. As a case study, we demonstrate the usefulness of the algorithm by showing how to refine and verify an STE specification of a CAM. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Roorda, J. W., & Claessen, K. (2006). SAT-based assistance in abstraction refinement for symbolic trajectory evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4144 LNCS, pp. 175–189). Springer Verlag. https://doi.org/10.1007/11817963_19

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