Nominal Context-Free Behaviour
نویسندگان
چکیده
This thesis investigates and proposes models for programming and verifying adaptive software at different abstraction levels. First, we design the kernel of a programming language, endowed with primitives for programming the adaptation to different working environments. We provide the language with a type and effect system that allows us to statically prove properties of the behaviour of the program when plugged in different execution environments. Then we extend our language to program the use of the resources currently available in the environment. In this case, the identity and the number of resources is unknown a-priori. The previous analysis technique needs to be extended to capture the behaviour of these programs. We exploit nominal techniques in the literature to propose novel automata models that represent the behaviour and the properties of programs that use an unbound number of unknown resources as (regular and context-free) set of traces. The theoretical properties of these automata are investigated and related with static program verification. We prove that we are able to check regular properties of the usage patterns of the resources when resource reuse is inhibited.
منابع مشابه
Towards Nominal Context-Free Model-Checking
Two kinds of automata are introduced, for recognising regular and context-free nominal languages. We compare their expressive power with that of analogous proposals in the literature. Some properties of our languages are proved, in particular that emptiness of a context-free nominal language L is decidable, and that the intersection of L with a regular nominal language is still context-free. Th...
متن کاملOn universal algebra over nominal sets
Nominal sets were introduced by Gabbay and Pitts (Gabbay and Pitts, 1999). This paper describes a step towards universal algebra over nominal sets. There has been some work in this direction, most notably by M.J. Gabbay (Gabbay, 2008). The originality of our approach is that we do not start from the analogy between sets and nominal sets. As shown in (Gabbay, 2008), this is possible, but it requ...
متن کاملPermissive nominal terms and their unification
We introduce permissive nominal terms. Nominal terms extend first-order terms with binding. They lack properties of firstand higher-order terms: Terms must be reasoned on in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; and it is not always possible to ‘alpha-convert a bound variable symbol’. Permissive nominal terms reco...
متن کاملPermissive nominal terms and their unification Gilles
We introduce permissive nominal terms. Nominal terms are one way to extend first-order terms with binding. They lack some properties of firstand higher-order terms: Terms must be reasoned on in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; and it is not always possible to ‘alpha-convert a bound variable symbol’. Permissiv...
متن کاملبرآورد شاخصهای حمایتی صنایع کاغذسازی کشور با تأکید بر اجرای سیاست یکسانسازی نرخ ارز
One of the ways to be informed on the extent of activities in various industries is to measure the rate of nominal protection. This paper tries to calculate the nominal and effective protection in order to examine the exchange rate unification impacts on the protection of pulp and paper industries with the aim of performing the exchange rate unification policy. Therefore, nominal protection rat...
متن کامل