Unifying wp and wlp
نویسندگان
چکیده
Boolean-valued predicates over a state space are isomorphic to its characteristic functions into {0, 1}. Enlarging that range to {−1, 0, 1} allows the definition of extended predicates whose associated transformers generalise the conventional wp and wlp. The correspondingly extended healthiness conditions include the new ‘sub-additivity’, an arithmetic inequality over predicates.
منابع مشابه
The Linear Algebra of UTP
We show that the well-known algebra of matrices over a semiring can be used to reason conveniently about predicates as used in the Unifying Theories of Programming (UTP). This allows a simplified treatment of the designs of Hoare and He and the prescriptions of Dunne. In addition we connect the matrix approach with the theory of test and condition semirings and the modal operators diamond and b...
متن کاملwp is wlp
Using only a simple transition relation one cannot model commands that may or may not terminate in a given state. In a more general approach commands are relations enriched with termination vectors. We reconstruct this model in modal Kleene algebra. This links the recursive definition of the do od loop with a combination of the Kleene star and a convergence operator. Moreover, the standard wp o...
متن کاملOn the Translation of Procedures to Finite Machines Abstraction Allows a Clean Proof
ion Allows a Clean Proof Markus Müller-Olm and Andreas Wolf 2 ⋆ 1 Universität Dortmund, Fachbereich Informatik, LS V, 44221 Dortmund, Germany [email protected] 2 Christian-Albrechts-Universität, Institut für Informatik und Praktische Mathematik, Olshausenstraße 40, 24098 Kiel, Germany [email protected] Abstract. We prove the correctness of the translation of a prototypic While...
متن کاملLevel Mapping Characterizations of Selector Generated Models for Logic Programs
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated semantics, to programs with arbitrary formulae in rule heads and bodies. We study this approach by means of a unifying framework for characterizing different logic programming semantics using level mappings (Hitzler and We...
متن کاملOn Excusable and Inexcusable Failures Towards an Adequate Notion of Translation Correctness
The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctness cannot cope adequately with practical questions like optimizations and finiteness of machines. As a step towards a solution we propose more fine-grained correctness notions, which are parameterized in sets of acceptable fail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 59 شماره
صفحات -
تاریخ انتشار 1996