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

synchronous programming with Refinement Types

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2024年第ICFP期8卷 938-972页

作者： Chen, Jiawei De Mendonca, Jose Luiz Vargas Ayele, Bereket Shimels Bekele, Bereket Ngussie Jalili, Shayan Sharma, Pranjal Wohlfeil, Nicholas Zhang, Yicheng Jeannin, Jean-Baptiste Univ Michigan Ann Arbor MI 48109 USA Addis Ababa Inst Technol Addis Ababa Ethiopia

Cyber-Physical Systems (CPS) consist of software interacting with the physical world, such as robots, vehicles, and industrial processes. CPS are frequently responsible for the safety of lives, property, or the environment, and so software correctness must be determined with a high degree of certainty. To that end, simply testing a CPS is insufficient, as its interactions with the physical world may be difficult to predict, and unsafe conditions may not be immediately obvious. Formal verification can provide stronger safety guarantees but relies on the accuracy of the verified system in representing the real system. Bringing together verification and implementation can be challenging, as languages that are typically used to implement CPS are not easy to formally verify, and languages that lend themselves well to verification often abstract away low-level implementation details. Translation between verification and implementation languages is possible, but requires additional assurances in the translation process and increases software complexity;having both in a single language is desirable. This paper presents a formalization of MARVeLus, a CPS language which combines verification and implementation. We develop a metatheory for its synchronous refinement type system and demonstrate verified synchronous programs executing on real systems.

关键词： synchronous programming refinement types robotics

来源：评论

学校读者我要写书评

暂无评论

synchronous programming and Refinement Types in Robotics: From Verification to Implementation 8

Synchronous Programming and Refinement Types in Robotics: Fr...

引用

8th International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS)

作者： Chen, Jiawei de Mendonca, Jose Luiz Vargas Jalili, Shayan Ayele, Bereket Bekele, Bereket Ngussie Qu, Zhemin Sharma, Pranjal Shiferaw, Tigist Zhang, Yicheng Jeannin, Jean-Baptiste Univ Michigan Ann Arbor MI 48109 USA Addis Ababa Inst Technol Addis Ababa Ethiopia

ISBN: (纸本)9781450399074

Robots and other cyber-physical systems are held to high standards of safety and reliability, and thus one must be confident in the correctness of their software. Formal verification can provide such confidence, but programming languages that lend themselves well to verification often do not produce executable code, and languages that are executable do not typically have precise enough formal semantics. We present MARVeLus, a stream-based approach to combining verification and execution in a synchronous programming language that allows formal guarantees to be made about implementation-level source code. We then demonstrate the end-to-end process of developing a safe robotics application, from modeling and verification to implementation and execution.

关键词： formal verification synchronous programming refinement types cyber-physical systems robotics

来源：评论

学校读者我要写书评

暂无评论

Propagation and Masking Characteristics of Errors During Software Testing in synchronous programming

引用

IEEE ACCESS 2024年 12卷 146009-146021页

作者： Kim, Young-Mi Choi, Jin-Young Yoo, Seunghoon Park, Myunghwan Korea Univ Dept Comp & Radio Commun Engn Seoul 02841 South Korea Korea Univ Sch Cybersecur Seoul 02841 South Korea Republ Korea Air Force Acad Dept Comp Sci Cheongju 28187 South Korea

During testing, an error in software can either propagate to the output variables or be masked before it reaches them. Error propagation and masking characteristics are crucial in software testing because they directly influence testing effectiveness. The testing community has hence focused on developing test mechanisms to promote the propagation and reduce masking of errors in software under test. However, little is known about how severely the errors propagate and are masked during software execution. Moreover, little is known about what influences software's propagation and masking characteristics. Thus, in this study, we performed experiments to investigate the behavior of errors during software execution. We chose six case examples and created mutants per case example by seeding an error into each one. We then executed the mutants with randomly selected test cases and investigated how many errors were propagated and masked. If an error was masked, we examined the cause. In addition, we investigated what percentage of errors in the mutants reached the output variables. This study provides insight into the characteristics of errors in terms of propagation and masking, which will help testers design test inputs and choose monitoring variables to properly handle the masking of errors during testing.

关键词： Software Testing Measurement uncertainty programming Monitoring Software measurement Computer languages Software testing Java Sensitivity analysis Error masking error propagation synchronous programming Lustre language mutant generation test cases

来源：评论

学校读者我要写书评

暂无评论

Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications

引用

THEORETICAL COMPUTER SCIENCE 2009年第2-3期410卷 168-201页

作者： Field, John Marinescu, Maria-Cristina Stefansen, Christian IBM Res Corp TJ Watson Res Ctr Hawthorne NY 10532 USA Univ Copenhagen DIKU Copenhagen O Denmark

Our aim is to define the kernel of a simple and uniform programming model-the reactor model-which can serve as a foundation for building and evolving internet-scale programs. Such programs are characterized by collections of loosely-coupled distributed components that are assembled on the fly to produce a composite application. A reactor consists of two principal components: mutable state, in the form of a fixed collection of relations, and code, in the form of a fixed collection of rules in the style of Datalog. A reactor's code is executed in response to an external stimulus, which takes the form of an attempted update to the reactor's state. As in classical process calculi, the reactor model accommodates collections of distributed, concurrently executing processes. However, unlike classical process calculi, our observable behaviors are sequences of states, rather than sequences of messages. Similarly, the interface to a reactor is simply its state, rather than a collection of message channels, ports, or methods. One novel feature of our model is the ability to compose behaviors both synchronously and asynchronously. Also, our use of Datalog-style rules allows aspect-like composition of separately-specified functional concerns in a natural way. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Reactors Datalog Actors synchronous programming Asynchronous programming Synchronization Distributed programming

来源：评论

学校读者我要写书评

暂无评论

programming AND VERIFYING REAL-TIME SYSTEMS BY MEANS OF THE synchronous DATA-FLOW LANGUAGE LUSTER

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1992年第9期18卷 785-793页

作者： HALBWACHS, N LAGNIER, F RATEL, C MERLIN GERIN CO SESF-38041 GRENOBLEFRANCE

We investigate the benefits of using a synchronous data-flow language for programming critical real-time systems. These benefits concern ergonomy-since the dataflow approach meets traditional description tools used in this domain-and ability to support formal design and verification methods. We show, on a simple example, how the language LUSTRE, and its associated verification tool LESAR, can be used to design a program, to specify its critical properties, and to verify these properties. As the language LUSTRE and its uses have already been published in several papers (e.g., [11], [18]), we put particular emphasis on program verification. A preliminary version of this paper has been published in [28].

关键词： DATA-FLOW LANGUAGES FORMAL VERIFICATION MODEL CHECKING REACTIVE SYSTEMS synchronous programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

***: (A)synchronous Reactive Web programming 2020

***: (A)Synchronous Reactive Web Programming

引用

41st ACM SIGPLAN Conference on programming Language Design and Implementation (PLDI)

作者： Berry, Gerard Serrano, Manuel Coll France Paris France UCA INRIA Sophia Antipolis France

ISBN: (纸本)9781450376136

We present ***, a synchronous reactive language that adds synchronous concurrency and preemption to JavaScript. Inspired from Esterel, *** simplifies the programming of non-trivial temporal behaviors as found in complex web interfaces or IoT controllers and the cooperation between synchronous and asynchronous activities. *** is compiled into plain sequential JavaScript and executes on unmodified runtime environments. We use three examples to present and discuss ***: a simple web login form to introduce the language and show how it differs from JavaScript, and two real life examples, a medical prescription pillbox and an interactive music system that show why concurrency and preemption help programming such temporal applications.

关键词： Reactive programming synchronous programming Web programming JavaScript

来源：评论

学校读者我要写书评

暂无评论

Spacetime programming A synchronous Language for Composable Search Strategies 19

Spacetime Programming A Synchronous Language for Composable ...

引用

21st International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： Talbot, Pierre Univ Nantes Nantes France

ISBN: (纸本)9781450372497

Search strategies are crucial to efficiently solve constraint satisfaction problems. However, programming search strategies in the existing constraint solvers is a daunting task and constraint-based languages usually have compositionality issues. We propose space-time programming, a paradigm extending the synchronous language Esterel and timed concurrent constraint programming with backtracking, for creating and composing search strategies. In this formalism, the search strategies are composed in the same way as we compose concurrent processes. Our contributions include the design and behavioral semantics of spacetime programming, and the proofs that spacetime programs are deterministic, reactive and extensive functions. Moreover, spacetime programming provides a bridge between the theoretical foundations of constraint-based concurrency and the practical aspects of constraint solving. We developed a prototype of the compiler that produces search strategies with a small overhead compared to the hard-coded ones.

关键词： synchronous programming concurrent constraint programming constraint satisfaction problem search strategy

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Model checking of distributed algorithms using synchronous programs

引用

Theoretical Computer Science 2025年 1045卷

作者： Erwan Jahier Karine Altisen Stéphane Devismes Gabriel B. Sant'Anna Univ. Grenoble Alpes CNRS Grenoble INP VERIMAG Grenoble France Universite de Picardie Jules Verne MIS Amiens France Canonical Brazil

The development of trustworthy distributed algorithms requires the verification of some key properties with respect to the formal specification of the expected system executions. The atomic-state model (ASM) is the most commonly used computational model to reason on self-stabilizing algorithms. In this work, we propose methods and tools to automatically verify the self-stabilization of distributed algorithms defined in that model. To that goal, we exploit the similarities between the ASM and computational models issued from the synchronous programming area to reuse their associated verification tools, and in particular their model checkers. This allows the automatic verification of all safety properties (including bounded liveness) of any algorithm under various asynchrony assumptions (from fully asynchronous to fully synchronous) and regardless of the hypotheses on the network ( e.g. , on its topology, its edge and node labeling).

关键词： Self-stabilization synchronous programming Model-checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：