检索结果-内蒙古大学图书馆

IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC)

作者： Baruah, Sanjoy Washington Univ St Louis MO 14263 USA

ISBN: (纸本)9781728169583

Model-based design methodologies based on the synchrony assumption are widely used in many safety-critical application domains. The synchrony assumption asserts that actions (such as the execution of code) occur instantaneously;however, physical platforms obviously do not possess this property. This paper considers a scheduling problem that arises when one seeks to implement programs that are written under the synchrony assumption upon actual multiprocessor platforms, and shows that existing results from scheduling theory can be adapted to solve this scheduling problem.

关键词： synchronous programming Multiprocessor scheduling Deadlines Makespan minimization Processor speedup factor

来源：评论

学校读者我要写书评

暂无评论

programming Microcontrollers through High-Level Abstractions 12

Programming Microcontrollers through High-Level Abstractions

引用

12th International Workshop on Virtual Machines and Intermediate Languages (VMIL)

作者： Varoumas, Steven Pesin, Basile Vaugon, Benoit Chailloux, Emmanuel Sorbonne Univ LIP6 CNRS F-75005 Paris France INRIA Paris Paris France Armadillo F-92170 Vanves France

ISBN: (纸本)9781450381901

In this paper, we present an approach for programming microcontrollers that provides more expressivity and safety than a low-level language approach traditionally used to program such devices. To this end, we provide various abstraction layers (abstraction of the microcontroller, of the electronic components of the circuit, and of concurrency) which, while being adapted to the scarce resources of the hardware, offer high-level programming traits for the development of embedded applications. The various presented abstractions make use of an OCaml virtual machine able to run on devices with limited resources and take advantage of the expressivity and extensibility of the language. We illustrate the interest of our work on both entertainment applications and embedded software examples.

关键词： Microcontrollers Virtual machine High-level programming OCaml Functors synchronous programming

来源：评论

学校读者我要写书评

暂无评论

A Generalized Modality for Recursion 18

A Generalized Modality for Recursion

引用

33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) held as part of the Federated Logic Conference (FLoC)

作者： Guatto, Adrien Univ Bamberg Bamberg Germany

ISBN: (纸本)9781450355834

Nakano's later modality allows types to express that the output of a function does not immediately depend on its input, and thus that computing its fixpoint is safe. This idea, guarded recursion, has proved useful in various contexts, from functional programming with infinite data structures to formulations of step-indexing internal to type theory. Categorical models have revealed that the later modality corresponds in essence to a simple reindexing of the discrete time scale. Unfortunately, existing guarded type theories suffer from significant limitations for programming purposes. These limitations stem from the fact that the later modality is not expressive enough to capture precise input-output dependencies of functions. As a consequence, guarded type theories reject many productive definitions. Combining insights from guarded type theories and synchronous programming languages, we propose a new modality for guarded recursion. This modality can apply any well-behaved reindexing of the time scale to a type. We call such reindexings time warps. Several modalities from the literature, including later, correspond to fixed time warps, and thus arise as special cases of ours.

关键词： Guarded Recursion Functional programming Streams Type Systems Category Theory synchronous programming

来源：评论

学校读者我要写书评

暂无评论

Reactive Chatbot programming 5

Reactive Chatbot Programming

引用

5th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and Systems (REBLS)

作者： Baudart, Guillaume Hirzel, Martin Mandel, Louis Shinnar, Avraham Simeon, Jerome IBM Res Yorktown Hts NY 10598 USA Clause Inc Davis CA USA

ISBN: (纸本)9781450360708

Chatbots are reactive applications with a conversational interface. They are usually implemented as compositions of client-side components and cloud-hosted services, including artificial-intelligence technology. Unfortunately, programming such reactive multi-tier applications with traditional programming languages is cumbersome. This paper introduces wcs-ocam1, a new multi-tier chatbot generator library designed for use with the reactive language ReactiveML. The paper explains our library with small didactic examples throughout, and closes with a larger case-study of a chatbot for authoring event-processing rules.

关键词： Chatbot reactive programming synchronous programming

来源：评论

学校读者我要写书评

暂无评论

On Reconciling Concurrency, Sequentiality and Determinacy for Reactive Systems-A Sequentially Constructive Circuit Semantics for Esterel 18

On Reconciling Concurrency, Sequentiality and Determinacy fo...

引用

18th International Conference on Application of Concurrency to System Design (ACSD)

作者： Schulz-Rosengarten, Alexander Smyth, Steven von Hanxleden, Reinhard Mendler, Michael Univ Kiel Dept Comp Sci Kiel Germany Bamberg Univ Fac Informat Syst & Appl Comp Sci Bamberg Germany

ISBN: (纸本)9781538670132

A classic challenge in designing reactive systems is how to reconcile concurrency with determinacy. synchronous languages, such as Esterel, SyncCharts or SCADE, resolve this by providing a semantics that does not depend on run-time scheduling decisions. Esterel's circuit semantics is grounded in physics: An Esterel program is considered valid (constructive) iff it corresponds to a delay-insensitive circuit. The circuit semantics provides on the one hand a mathematically grounded semantics, based on constructive logic, on the other hand it gives a direct path to a data-flow style software implementation. However, Esterel's constructive semantics entails a rather restricted regime for handling sequential accesses to shared data. Thus many programs are rejected as being non-constructive, even though they have a very natural, determinate interpretation. We here present a sequentially constructive circuit semantics (SCC) that lifts this restriction, by distinguishing sequential and concurrent execution contexts. This permits an imperative style familiar to programmers versed in C, for example, without leaving the sound physical foundation of synchronous programming.

关键词： Reactive systems determinacy synchronous programming sequential constructiveness Esterel circuit semantics

来源：评论

学校读者我要写书评

暂无评论

Light-weight synchronous Java (SJL): An approach for programming deterministic reactive systems with Java

引用

COMPUTING 2015年第3期97卷 281-307页

作者： Motika, Christian von Hanxleden, Reinhard Univ Kiel Dept Comp Sci D-24098 Kiel Germany

A key issue in the development of reliable embedded software is the proper handling of reactive control-flow, which typically involves concurrency. Java and its thread concept have only limited provisions for implementing deterministic concurrency. Thus, as has been observed in the past, it is challenging to develop concurrent Java programs without any deadlocks or race conditions. To alleviate this situation, the Light-weight synchronous Java (SJL) approach presented here adopts the key concepts that have been established in the world of synchronous programming for handling reactive control-flow. Thus SJL not only provides deterministic concurrency, but also different variants of deterministic preemption. Furthermore SJL allows concurrent threads to communicate with Esterel-style signals. As a case study for an embedded system usage, we also report on how the SJL concepts have been ported to the ARM-based Lego Mindstorms NXT system. We evaluated the SJL approach to be efficient and provide experimental results comparing it to Java threads.

关键词： Reactive systems Deterministic concurrency Deterministic preemption synchronous programming Light-weight scheduling Java

来源：评论

学校读者我要写书评

暂无评论

Runtime Enforcement of Reactive Systems using synchronous Enforcers 24

Runtime Enforcement of Reactive Systems using Synchronous En...

引用

24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software (SPIN)

作者： Pinisetty, Srinivas Roop, Partha S. Smyth, Steven Tripakis, Stavros von Hanxleden, Reinhard Aalto Univ Helsinki Finland Univ Gothenburg Gothenburg Sweden Univ Auckland Auckland New Zealand Univ Kiel Kiel Germany Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781450350778

synchronous programming is a paradigm of choice for the design of safety-critical reactive systems. Runtime enforcement is a technique to ensure that the output of a black-box system satisfies some desired properties. This paper deals with the problem of runtime enforcement in the context of synchronous programs. We propose a framework where an enforcer monitors both the inputs and the outputs of a synchronous program and (minimally) edits erroneous inputs/outputs in order to guarantee that a given property holds. We define enforceability conditions, develop an online enforcement algorithm, and prove its correctness. We also report on an implementation of the algorithm on top of the KIELER framework for the SCCharts synchronous language. Experimental results show that enforcement has minimal execution time overhead, which decreases proportionally with larger benchmarks.

关键词： Runtime Monitoring Runtime Enforcement Safety Properties Automata synchronous programming SCCharts

来源：评论

学校读者我要写书评

暂无评论

Runtime Enforcement of Cyber-Physical Systems

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2017年第5-Sup期16卷 178-178页

作者： Pinisetty, Srinivas Roop, Partha S. Smyth, Steven Allen, Nathan Tripakis, Stavros Von Hanxleden, Reinhard Aalto Univ Espoo Finland Univ Gothenburg Gothenburg Sweden Univ Auckland Dept Elect & Comp Engn Private Bag 92019 Auckland New Zealand Univ Kiel Kiel Germany Univ Calif Berkeley Berkeley CA USA Chalmers Univ Technol Dept Comp Sci & Engn SE-41296 Gothenburg Sweden Christian Albrechts Univ Kiel Inst Informat Olshausenstr 40 D-24098 Kiel Germany Aalto Univ Dept Comp Sci Konemiehentie 2 Espoo 02150 Finland

Many implantable medical devices, such as pacemakers, have been recalled due to failure of their embedded software. This motivates rethinking their design and certification processes. We propose, for the first time, an additional layer of safety by formalising the problem of run-time enforcement of implantable pacemakers. While recent work has formalised run-time enforcement of reactive systems, the proposed framework generalises existing work along the following directions: (1) we develop bi-directional enforcement, where the enforced policies depend not only on the status of the pacemaker (the controller) but also of the heart (the plant), thus formalising the run-time enforcement problem for cyber-physical systems (2) we express policies using a variant of discrete timed automata (DTA), which can cover all regular properties unlike earlier frameworks limited to safety properties, (3) we are able to ensure the timing safety of implantable devices through the proposed enforcement, and (4) we show that the DTA-based approach is efficient relative to its dense time variant while ensuring that the discretisation error is relatively small and bounded. The developed approach is validated through a prototype system implemented using the open source KIELER framework. The experiments show that the framework incurs minimal runtime overhead.

关键词： Runtime Monitoring Runtime Enforcement Automata Timed Properties Cyber-Physical Systems synchronous programming SCCharts

来源：评论

学校读者我要写书评

暂无评论

Grounding synchronous Deterministic Concurrency in Sequential programming

Grounding Synchronous Deterministic Concurrency in Sequentia...

引用

23rd European Symposium on programming (ESOP)

作者： Aguado, Joaquin Mendler, Michael von Hanxleden, Reinhard Fuhrmann, Insa Otto Friedrich Univ Bamberg Bamberg Germany Univ Kiel Kiel Germany

ISBN: (纸本)9783642548338;9783642548321

Using a new domain-theoretic characterisation we show that Berry's constructive semantics is a conservative approximation of the recently proposed sequentially constructive (SC) model of computation. We prove that every Berry-constructive program is deterministic and deadlock-free under sequentially admissible scheduling. This gives, for the first time, a natural interpretation of Berry-constructiveness for shared-memory, multi-threaded programming in terms of synchronous cycle-based scheduling, where previous results were cast in terms of synchronous circuits. This opens the door to a direct mapping of Esterel's signal mechanism into boolean variables that can be set and reset under the programmer's control within a tick. We illustrate the practical usefulness of this mapping by discussing how signal reincarnation is handled efficiently by this transformation, which is of linear complexity in program size, in contrast to earlier techniques that had quadratic overhead.

关键词： Concurrency Constructiveness Determinism Mealy Reactive Systems synchronous programming Esterel

来源：评论

学校读者我要写书评

暂无评论

Multi-rate System Design Through Integrating synchronous Components 1

引用

12th International Colloquium on Theoretical Aspects of Computing (ICTAC)

作者： Sun, Ke Univ Rennes 1 F-35042 Rennes France

ISBN: (数字)9783319251509

ISBN: (纸本)9783319251509;9783319251493

This paper presents a component-based scheme for the development of multi-rate critical embedded systems. A multi-rate system is formally specified as a modular assembly of several locally mono-clocked components into a globally multi-clocked system. Mono-clocked components are modeled in particular using the synchronous programming language Quartz. Each synchronous component is first transformed into an intermediate model of clocked guarded actions. Based on the abstraction of component behaviors, consistent communication networks can be established, in which the production and consumption of inter-component dataflow are related by affine relations. Furthermore, symbolic component schedules and corresponding minimal buffering requirements are computed.

关键词： synchronous programming Component-based design Affine relation Symbolic schedule

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：