Underapproximating predicate transformers

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

Abstract

We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic: and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains - two are based on "set inclusion" approximation, and two are based on "quantification" approximation - and we apply the domains to synthesize the most precise, underapproximating pre and pre transformers, in the latter case, introducing a focus operation. We also show why the expected abstractions of post and post are unsound, and we use the powerdomains to guide us to correct, sound underapproximations. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Schmidt, D. A. (2006). Underapproximating predicate transformers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4134 LNCS, pp. 127–143). Springer Verlag. https://doi.org/10.1007/11823230_9

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