Research operatingsystems are often written in type-safe, high-level languages. these languages perform automatic static and dynamic checks to give basic assurances about run-time behavior. Yet such operatingsystems...
详细信息
ISBN:
(纸本)9781595939227
Research operatingsystems are often written in type-safe, high-level languages. these languages perform automatic static and dynamic checks to give basic assurances about run-time behavior. Yet such operatingsystems still rely on unsafe, low-level code to communicate with hardware, with little or no automated checking of the correctness of the hardware-software interaction. this paper describes experience using the Spec# language and Boogie verifier to statically specify and statically verify the safety of a driver's interaction with a network interface, including the safety of DMA. Copyright 2007 ACM.
the lack of well-defined protocols for interaction withthe operating system is a common source of defects in device drivers. In this paper we investigate the use of a formal language to define these protocols unambig...
详细信息
ISBN:
(纸本)9781595939227
the lack of well-defined protocols for interaction withthe operating system is a common source of defects in device drivers. In this paper we investigate the use of a formal language to define these protocols unambiguously. We present a language that allows us to convey all important requirements for driver behaviour in a compact specification and that can be readily understood by software engineers. It is intended to close the communication gap between OS and driver developers and enable more reliable device drivers. Copyright 2007 ACM.
We describe the implementation of memory protection by means of aspect-oriented programming (AOP) in CiAO, an AUTOSAR-like family of embedded operatingsystems. the use of AOP was originally motivated by the fact that...
详细信息
ISBN:
(纸本)9781595939227
We describe the implementation of memory protection by means of aspect-oriented programming (AOP) in CiAO, an AUTOSAR-like family of embedded operatingsystems. the use of AOP was originally motivated by the fact that memory protection is a cross-cutting policy, which, furthermore, has to be configurable at build-time in AUTOSAR. We learned, however, that besides switching between full protection and no protection, an AOP-based approach also makes it easy to apply completely different models of protection. For the domain of statically configured embedded systems, where certain failure scenarios can often be excluded by means of code analysis or even probability, this facilitates tailored and light-weight "nav-as-vou-use" protection strateaies Copyright 2007 ACM.
the BPEL language is currently the primary candidate for standardising Web Services orchestration. BPEL specifications are meant to be run by BPEL orchestration engines, which are therefore crucial components of today...
详细信息
the BPEL language is currently the primary candidate for standardising Web Services orchestration. BPEL specifications are meant to be run by BPEL orchestration engines, which are therefore crucial components of today's business-to-business infrastructures, carrying the burden of dynamically composing existing services. In this paper, we present the design of a BPEL orchestration engine based on a multi-agent system: while the basic BPEL activities are autonomously executed by agents, workflow aspects are realised by the mediation of ReSpecT tuple centres, a coordination model extending LINDA withthe ability of declaratively programmingthe tuple space behaviour. Our architecture separates the interaction, correlation, and workflow concerns into clearly identified tiers. In particular, we identify the workflow tier as the one encapsulating the core and most critical behaviour of the engine: due to its intrinsic complexity, we tackle its design formally. We introduce a core algebraic language of BPEL dealing with its workflow-related aspects, and provide it with a semantics based on a mapping into a net specification, modelling the dependencies between the activities to be executed by the engine. this mapping plays the role of a formal design, since it directly leads to an implementation of the workflow tier in the orchestration engine. (c) 2007 Elsevier B.V. All rights reserved.
We present a kernel coordination language for mobile agent systemsthat considers as first-class citizens boththe agents and the channels they use to interact with each other. Channels implement distributed, asynchro...
详细信息
We present a kernel coordination language for mobile agent systemsthat considers as first-class citizens boththe agents and the channels they use to interact with each other. Channels implement distributed, asynchronous communications with FIFO ordering and multicast routing. Features related to mobility include agent migration as well as remote cloning. Most importantly, a virtual form of channel mobility inspired by the pi-calculus is also supported. this expressive feature allows mobile agents to adapt dynamically to their changing environment. the language semantics, presented formally, is based on a geometrical model named the Interaction Spaces. this provides an intuitive interpretation of the agent features and capabilities in terms of combined spatial projections and transformations. through spatial composition, we show that standard labeled transition systems and bisimulation-based semantics may be defined above the geometry, enabling reasoning and formal verification. Finally, we describe prototype implementations of the proposed model and language. (c) 2007 Elsevier B.V. All rights reserved.
the proceedings contain 14 papers. the special focus in this conference is on Rewriting, Deduction, and programming. the topics include: Innermost termination of rewrite systems by labeling;decidability of innermost t...
the proceedings contain 14 papers. the special focus in this conference is on Rewriting, Deduction, and programming. the topics include: Innermost termination of rewrite systems by labeling;decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems;termination of lazy rewriting revisited;undecidable properties on length-two string rewriting systems;rules and strategies in java;regular strategies as proof tactics for CIRC;formalizing constructions of abstract machines for functional languages in Coq;on term-graph rewrite strategies;towards a sharing strategy for the graph rewriting calculus;complete laziness;stack-based strategic control;computational soundness of a call by name calculus of recursivelyscoped records;minimality in a linear calculus with iteration;token-passing nets for functional languages.
At SSH Communications Security, we've employed functional programming for a long time in some of our projects. Over the years, we've shipped a number of products written mostly in Scheme, and are about to ship...
详细信息
Modern cars contain a multitude of micro controllers for a wide area of tasks. the diversity of the heterogeneous hardware and software leads to a complicated and expensive integration *** multiple tasks on fewer micr...
详细信息
the paper presents results of the examination of the deterministic network used by the distributed virtual instrument. Software technology applied to control measurement data transfer between the real-time components ...
详细信息
the paper presents results of the examination of the deterministic network used by the distributed virtual instrument. Software technology applied to control measurement data transfer between the real-time components was presented. Configuration of the laboratory test stand, designed to examine deterministic network is described. Results of the research are presented and conclusions, as well as future prospects iterated.
programming wireless sensor network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programmers to use relatively low-level technique...
详细信息
programming wireless sensor network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programmers to use relatively low-level techniques to deal withthe logical concurrency and asynchronous event handling inherent in these applications. In addition, existing general-purpose, node-level programming tools only support the networked nature of WSN applications in a limited way and result in application code that is hardly portable across different software platforms. All of this makes programming a single device a tedious and error-prone task. To address these issues we propose a high-level programming model that allows programmers to express applications as hierarchical state machines and to handle events and application concurrency in a way similar to imperative synchronous languages. Our program execution model is based on static scheduling what allows for standalone application analysis and testing. For deployment, the resulting programs are translated into efficient sequential C code. A prototype compiler for TinyOS has been implemented and its evaluation in described in this paper.
暂无评论