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

Adaptive Virtual Organisms: A Compositional Model for Complex Hardware -software Binding

FUNDAMENTA INFORMATICAE 2020年第2-3期173卷 139-176页

作者： Paduraru, Ciprian Ionut Stefanescu, Gheorghe Univ Bucharest Dept Comp Sci Str Acad 14 Bucharest 010014 Romania

The relation between a structure and the function it runs is of interest in many fields, including computer science, biology (organ vs. function) and psychology (body vs. mind). Our paper addresses this question with reference to computer science recent hardware and software advances, particularly in areas as Robotics, Self-Adaptive Systems, IoT, CPS, AI-Hardware, etc. At the modelling, conceptual level our main contribution is the introduction of the concept of "virtual organism" (VO), to populate the intermediary level between reconfigurable hardware agents and intelligent, adaptive software agents. A virtual organism has a structure, resembling the hardware capabilities, and it runs low-level functions, implementing the software requirements. The model is compositional in space (allowing the virtual organisms to aggregate into larger organisms) and in time (allowing the virtual organisms to get composed functionalities). The virtual organisms studied here are in 2D (two dimensions) and their structures are described by 2D patterns (adding time, we get a 3D model). By reconfiguration an organism may change its structure to another structure in the same 2D pattern. We illustrate the VO concept with a few increasingly more complex VO's dealing with flow management or a publisher-subscriber mechanism for handling services. We implemented a simulator for a VO, collecting flow over a tree-structure (TC-VO), and the quantitative results show reconfigurable structures are better suited than fixed structures in dynamically changing environments. Finally, we briefly show how Agapia - a structured parallel, interactive programming language where dataflow and control flow structures can be freely mixed - may be used for getting quick implementations for VO's simulation.

关键词： distributed programming languages Self-organizing autonomic computing Heterogeneous (hybrid) systems Hardware-software binding 2D regular expressions Agapia programming

来源：评论

学校读者我要写书评

暂无评论

KEY CONCEPTS OF THE INCAS MULTICOMPUTER PROJECT

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第8期13卷 913-923页

作者： NEHMER, J HABAN, D MATTERN, F WYBRANIETZ, D ROMBACH, HD UNIV MARYLAND DEPT COMP SCICOLLEGE PKMD 20742

An overview is given of the incremental architecture for distributed systems (INCAS) multicomputer project, which is an attempt to develop a comprehensive methodology for the design and implementation of locally distributed systems. A structuring concept for distributed operating systems has been created and integrated into the system implementation language LADY. The concurrent high-level programming language CSSA, based on the actor model, has been designed for implementing distributed applications. A substantial effort in the INCAS project is aimed at the development of a distributed test methodology. An experimental system has been implemented on a system of 10 MC68000 microcomputers. Preliminary experience with the methodology has been gained from a few prototype applications.

关键词： Multicomputer distributed Operating Systems distributed programming languages distributed Systems distributed Testing Message Passing Multicast Communication

来源：评论

学校读者我要写书评

暂无评论

THE LYNX distributed-programming LANGUAGE - MOTIVATION, DESIGN AND EXPERIENCE

引用

COMPUTER languages 1991年第3-4期16卷 209-233页

作者： SCOTT, ML Department of Computer Science University of Rochester Rochester NY 14627 U.S.A.

A programming language can provide much better support for interprocess communication than a library package can. Most message-passing languages limit this support to communication between the pieces of a single program, but this need not be the case. Lynx facilitates convenient, typesafe message passing not only within applications, but also between applications and among distributed collections of servers. Specifically, it addresses issues of compiler statelessness, late binding, and protection that allow run-time interaction between processes that were developed independently and that do not trust each other. Implementation experience with Lynx has yielded important insights into the relationship between distributed operating systems and language run-time support packages and into the inherent costs of high-level message-passing semantics.

关键词： distributed programming languages MESSAGE PASSING REMOTE PROCEDURE CALL LATE BINDING SERVER PROCESSES LINKS

来源：评论

学校读者我要写书评

暂无评论

Formal verification of a programming logic for a distributed programming language

引用

THEORETICAL COMPUTER SCIENCE 1999年第1-2期216卷 213-235页

作者： Zhang, C Olsson, RA Levitt, KN Calif State Univ Sacramento Dept Comp Sci Sacramento CA 95819 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

This paper presents a method for mechanically proving the soundness of a programming logic for a distributed programming language, in support of the development of verified program verification tools. We focus on: (1) how to formalize the operational semantics of a distributed programming language;(2) how to formalize the concept of program correctness for distributed programs;(3) how to mechanically prove the soundness of a programming logic with respect to the formal semantics of the language;(4) how to use the mechanized and sound logic to develop verification tools with soundness guaranteed;and (5) how to accomplish all above in the same formalism. Our programming logic permits the verification of single processes executing in isolation and, also, the verification of the composition of concurrently executing processes. Our method demonstrates that structuring the specification of operational semantics can ease the creation of a sound and mechanized programming logic for distributed programming languages. We believe that our method can be scaled up to larger distributed programming languages and their programming logics. The Cambridge HOL theorem proving system is used in our research. (C) 1999-Elsevier Science B.V. All rights reserved.

关键词： semantic formalization mechanization of programming logics distributed programming languages machine-checked verification

来源：评论

学校读者我要写书评

暂无评论

CSM - A distributed-programming LANGUAGE

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第4期13卷 497-500页

作者： SUN, ZX LI, XN Department of Computer Science Nanjing University

An overview is presented of a distributed programming language called Communicating Sequential Modules (CSM), intended to support distributed computing. The language is developed from Modula-2 and communicating sequential processes (CSP). From CSP, the language has inherited parallel commands, guarded commands, and communication commands, and from Modula-2, it has inherited most of the rest, including the important module concept. CSM has been implemented on the ZCZ distributed microcomputer system consisting of several LSI-11 microcomputers. Its language is easy to understand. The CSM compiler is composed of a modified Modula-2 compiler and a translator, which is written in Modula-2 with a size of about 2,100 lines. Examples tested show that CSM is an effective tool for distributing programming.

关键词： Networks Commands Communication distributed programming distributed programming languages Modules

来源：评论

学校读者我要写书评

暂无评论

Blame-Correct Support for Receiver Properties in Recursively-Structured Actor Contracts

引用

PROCEEDINGS OF THE ACM ON programming languages-PACMPL 2024年第ICFP期8卷 515-543页

作者： Vandenbogaerde, Bram Stievenart, Quentin De Roover, Coen Vrije Univ Brussel Brussels Belgium Univ Quebec Montreal Montreal PQ Canada

Actor languages model concurrency as processes that communicate through asynchronous message sends. Unfortunately, as the complexity of these systems increases, it becomes more difficult to compose and integrate their components. This is because of assumptions made by components about their communication partners which may not be upheld when they remain implicit. In this paper, we bring design-by-contract programming to actor programs through a contract system that enables expressing constraints on receiver-related properties. Expressing properties about the expected receiver of a message, and about this receiver's communication behavior, requires two novel types of contracts. Through their recursive structure, these contracts can govern entire communication chains. We implement the contract system for an actor extension of Scheme, describe it formally, and show how to assign blame in case of a contract violation. Finally, we prove our contract system and its blame assignment correct by formulating and proving a blame correctness theorem.

关键词： design-by-contract actors distributed programming languages

来源：评论

学校读者我要写书评

暂无评论

A Scripting Language for Practical Agent-Oriented programming 8

A Scripting Language for Practical Agent-Oriented Programmin...

引用

8th ACM SIGPLAN International Workshop on programming Based on Actors, Agents, and Decentralized Control (AGERE)

作者： Bergenti, Federico Monica, Stefania Petrosino, Giuseppe Univ Parma Parma Italy

ISBN: (纸本)9781450360661

This paper describes the features of a scripting language proposed to support the practical implementation of agents and multi-agent systems using an agent-oriented programming approach. Agents are programmed in terms of procedures to be executed when interesting events occur, and the language provides specific constructs to describe managed events and related procedures. Among possible events, those related to communication are supported by specific constructs because of their relevance for the implementation of multi-agent systems. The proposed language is characterised by a strongly expressive syntax largely inspired by modern scripting languages to promote readability and to make agent programs similar to pseudocodes. Such a feature ensures that the programmer can use the language to describe the reactions of agents to events at a high level of abstraction, with all the advantages that it brings in terms of software quality.

关键词： agent-oriented programming software agents distributed programming languages scripting languages

来源：评论

学校读者我要写书评

暂无评论

Soft Verification for Actor Contract Systems 2024

Soft Verification for Actor Contract Systems

引用

33rd ACM SIGSOFT International Conference on Software Testing and Analysis (ISSTA)

作者： Vandenbogaerde, Bram Vrije Univ Brussel Ixelles Belgium

ISBN: (纸本)9798400706127

Design-by-contract is a software engineering practice where programmers annotate program elements with contract specifications that make expectations towards the user and supplier of the program element explicit. This practice has been applied in various contexts such as higher-order programming languages. However, support for contracts in distributed actor programs is limited. Unfortunately, contract specifications need to be checked while executing the program which introduces a substantial overhead. To counter this, soft verification techniques have been proposed to verify (parts of) contract specifications, but have only been applied in the context of sequential programs. The goal of our research is therefore twofold: designing contract languages for distributed actor programs and developing techniques for their soft verification. In this context, we present a work plan and method, and show our preliminary results.

关键词： design-by-contract actors distributed programming languages static program analysis

来源：评论

学校读者我要写书评

暂无评论

A programming language for local computations in graphs: Computational completeness

A programming language for local computations in graphs: Com...

引用

5th Mexican International Conference in Computer Science (ENC 2004)

作者： Mosbah, M Ossamy, R Univ Bordeaux 1 ENSEIRB LaBRI F-33405 Talence France

ISBN: (纸本)0769521606

We have developed a new programming language for implementing distributed algorithms encoded by means of local computations [17]. This language, called Lidia, is based on a two-level transition system model: the first level is used to specify the behavior of each single component, whereas the second level captures their interactions. Transitions are basically expressed in a precondition-effect style. Lidia depends on a logic,L*(infinity) that is used to express the preconditions of each transition. The main topic of this paper is to present the L*(infinity) language and to bring out some of its basic properties. Moreover we will take advantage of these properties to define a class of distributed algorithms encoded by means of local computations, that can be implemented in our programming language. The completeness of Lidia, related to the use of users defined functions, will represent the main result of this paper.

关键词： local computations in graphs distributed programming languages extensions of first-order logic complexity classes finite model theory

来源：评论

学校读者我要写书评

暂无评论

Checking global properties for local computations in graphs with applications to invariant testing

Checking global properties for local computations in graphs ...

引用

5th Mexican International Conference in Computer Science (ENC 2004)

作者： Mosbah, M Ossamy, R Univ Bordeaux 1 ENSEIRB LaBRI F-33405 Talence France

ISBN: (纸本)0769521606

Global predicates in distributed systems are predicates considering the state of more than one process. They are a useful concept for debugging parallel programs, e.g., for specifying assertions, breakpoints or termination. In this paper we propose an algorithm for detecting the validity of local and global state predicates in distributed algorithms encoded by means of local computations. This algorithm is based on ideas introduced by Cooper and Marzullo and on the approach of Garg and Waldecker. It uses the Lamport's happened-before ordering relationship to construct a partial sorted sequence of all the events that have changed the local state of any process during a computation. While the sequence is traversed, all the global states through which the system has passed are computed and the validity of the given properties is checked. Under the same assumptions, our algorithm is significantly more efficient than the algorithms by Cooper and Marzullo and by Garg and Waldecker.

关键词： global predicates detection consistent global states local computations distributed systems distributed programming languages distributed debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：