Compositional characterization of observable program properties
نویسندگان
چکیده
منابع مشابه
Compositional characterization of observable program properties
In this paper we model both program behaviours and abstractions between them as lax functors, which generalize abstract interpretations by exploiting the natural ordering of program properties. This generalization provides a framework in which correctness (safety) and completeness of abstract interpretations naturally arise from this order. Furthermore, it supports modular and stepwise reenemen...
متن کاملCompositional Control Synthesis for Partially Observable Systems
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint derivation method works in conjunction with an antichain–based, symbolic algorithm for computing weakest strategies in safety games of imperfect information. We demonstrate how the technique allows a reactive controll...
متن کاملFirst-Order Logic Characterization of Program Properties
A program is rst-order reducible (FO-reducible) with respect to (wrt) a set of integrity constraints if there exists a rst-order theory T such that the set of models for T is exactly the set of intended models for the program wrt all possible EDB's. In this case, we say that P is FO-reducible to T wrt IC. For FO-reducible programs, it is possible to characterize, using rst-order logic implicati...
متن کاملObservable Properties of Higher Order
The research reported in this paper is concerned with the problem of reasoning about properties of higher order functions involving state. It is motivated by the desire to identify what, if any, are the diiculties created purely by locality of state, independent of other properties such as side-eeects, exceptional termination and non-termination due to recursion. We consider a simple language (...
متن کاملObservable Properties of Higher Order Functionsthat
The research reported in this paper is concerned with the problem of reasoning about properties of higher order functions involving state. It is motivated by the desire to identify what, if any, are the diiculties created purely by locality of state, independent of other properties such as side-eeects, exceptional termination and non-termination due to recursion. We consider a simple language (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1992
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1992260504031