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

10th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems

作者： Yang, D Zhang, SS Shanghai Jiao Tong Univ Dept Comp CIT Lab Shanghai 200030 Peoples R China

ISBN: (纸本)0769519172

This paper presents an approach for modeling workflow using statechart, a visual language for describing complex, reactive systems. The statechart is an extended finite state machines combined with hierarchy, concurrency and communication. In contracts to other modeling approaches, statechart is a concise, expressive languages with rigorous semantics. The main advantages of statechart-based workflow modeling have: (1) visual language facilitates the understanding and communication between common users, experts, and modeler. (2) Event-base communication as well as priority among states provide more advanced means of expressing complex business process logic. (2) workflow models are of well-defined operational semantics, thus making it possible to verify and check workflow models. Finally, a eased study is illustrated to model workflow using statechart based on the approaches mentioned in this paper.

关键词： visual languages formal verification workflow management software real-time systems finite state machines concurrency control programming language semantics modeling workflow process models statechart visual language complex reactive systems extended finite state machine hierarchy concurrency communication concise expressive language event-based communication verification state priority complex business process logic operational semantics

来源：评论

学校读者我要写书评

暂无评论

Operational semantics for Declarative Networking

引用

11th International Symposium on Practical Aspects of Declarative languages

作者： Navarro, Juan A. Rybalchenko, Andrey Max Planck Institute for Software Systems Germany

ISBN: (纸本)9783540929949

Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a computer network. It has already been used to implement various networked systems, e.g., network overlays, Byzantine fault tolerance protocols, and distributed hash tables. Declarative Networking relies upon a rule-based programming language that resembles Datalog and allows one to declaratively specify the flow of networking events. However, the presence of asynchronous communication, distribution, and imperative modification of the program state in Declarative Networking applications have been an obstacle for defining its semantics. Currently, the reference semantics is determined by the runtime environment only, which hinders further application development and makes any efforts to develop program analysis and verification tools impossible. In this paper, we propose an operational semantics for Declarative Networking that addresses these problems. The semantics is parameterized to keep open a design space required at the current stage of the language development. We also report on our first experience with an interpreter for Declarative Networking applications that implements the proposed semantics.

关键词： Declarative networking programming language semantics distributed systems

来源：评论

学校读者我要写书评

暂无评论

Deployment and Scheduling Synthesis for Mixed-Critical Shared-Memory Applications

Deployment and Scheduling Synthesis for Mixed-Critical Share...

引用

20th Annual IEEE International Conference and Workshops on the Engineering of Computer Based Systems (ECBS)

作者： Voss, Sebastian Schaetz, Bernhard Fortiss GmbH D-80805 Munich Germany

ISBN: (纸本)9780769549910

This paper presents an efficient approach for generating suitable system architectures for embedded systems efficiently. Thereby, we focus on a joint generation of schedules and deployment for mixed-criticality multicore architectures using shared memory. The presented approach computes task and message schedules that are optimized with respect to a global discrete time base. As part of the solution, our approach generates an optimized assignment of tasks to computation resources (cores) concerning local memory constraints of cores and criticality constraints of tasks. This approach is integrated into the AUTOFOCUS 3 tool-chain, using a formally defined model of computation with explicit data-flow and discrete-time semantics to develop multi-criticality embedded systems. Our approach relies on a symbolic encoding scheme, based on a system model that is derived from the system architecture. This paper provides a formalization describing the scheduling problem as a satisfiability problem using boolean formulas and linear arithmetic constraints. A state-of-the-art satisfiability modulo theory (SMT) solver is used to compute the joint schedule and deployment for such architectures. This paper demonstrates that state-of-the art satisfiability modulo theory solvers can be used to efficiently compute (safety-oriented) deployments including real-time task and communication schedules for mixed-criticality applications.

关键词： Boolean functions computability embedded systems processor scheduling programming language semantics shared memory systems

来源：评论

学校读者我要写书评

暂无评论

Interval temporal logics with chop-like operators

Interval temporal logics with chop-like operators

引用

17th International Symposium on Temporal Representation and Reasoning, TIME 2010

作者： Hodkinson, Ian Imperial College London United Kingdom

This paper is talking about temporal logics with semantics based on intervals of time. Interval operators allow wide choice of temporal operators which includes unary operators with semantics and binary operators are ... 详细信息

ISBN: (纸本)9780769541877

关键词： binary operator chop like operator interval operator interval temporal logic mathematical operators programming language semantics temporal logic unary operator

来源：评论

学校读者我要写书评

暂无评论

Creating languages in Racket

引用

COMMUNICATIONS OF THE ACM 2012年第1期55卷 48-+页

作者： Flatt, Matthew Univ Utah Sch Comp Salt Lake City UT 84112 USA

Sometimes you just have to make a better mousetrap.

关键词： programming languages (Electronic computers) programming language semantics SYNTAX in programming languages COMPUTER programming COMPUTER software COMPUTER science

来源：评论

学校读者我要写书评

暂无评论

Abstraction preservation and subtyping in distributed languages

引用

ACM SIGPLAN NOTICES 2006年第9期41卷 286-297页

作者： Denielou, Pierre-Malo Leifer, James J. INRIA Rocquencourt France

In most programming languages, type abstraction is guaranteed by syntactic scoping in a single program, but is not preserved by marshalling during distributed communication. A solution is to generate hash types at compile time that consist of a fingerprint of the source code implementing the data type. These hash types can be tupled with a marshalled value and compared efficiently at unmar-shall time to guarantee abstraction safety. In this paper, we extend a core calculus of ML-like modules, functions, distributed communication, and hash types, to integrate structural subtyping, user-declared subtyping between abstract types, and bounded existential types. Our semantics makes two contributions: (1) the explicit tracking of the interaction between abstraction boundaries and subtyping;(2) support for user-declared module upgrades with propagation of the resulting subhashing relation throughout the network during communication. We prove type preservation, progress, determinacy, and erasure for our system.

关键词： languages design programming language semantics serialisation and distributed computation module systems type theory subtyping

来源：评论

学校读者我要写书评

暂无评论

AN OPERATIONAL INTERPRETATION OF COINDUCTIVE TYPES

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2020年第1期16卷

作者： Czajka, Lukasz TU Dortmund Univ Dortmund Germany

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and generalization of the notion of productivity in term rewriting to a setting with higher-order functions and with data specified by nested higher-order inductive and coinductive definitions. Intuitively, we interpret lazy data structures in a higher-order functional language by potentially infinite terms corresponding to their complete unfoldings. We prove an approximation theorem which essentially states that if a term reduces to an arbitrarily large finite approximation of an infinite object in the interpretation of a coinductive type, then it infinitarily (i.e. in the "limit") reduces to an infinite object in the interpretation of this type. We introduce a sufficient syntactic correctness criterion, in the form of a type system, for finite terms decorated with type information. Using the approximation theorem, we show that each well-typed term has a well-defined interpretation in our semantics.

关键词： coinductive types productivity infinitary rewriting programming language semantics functional programming

来源：评论

学校读者我要写书评

暂无评论

Hardware Trojan detection via rewriting logic

引用

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN programming 2022年 127卷

作者： Asavoae, Irina Mariuca Shirazi, Ramtine Tofighi Riesco, Adrian Yasuyoshi, Uemura Thales Grp Trusted Labs Meudon France Univ Complutense Madrid Madrid Spain Elect Commerce Secur Technol Assoc Tokyo Japan

Hardware security studies, discovers, and classifies hardware attacks as well as defense strategies such as prevention and protection methods along the entire hardware production chain. Hardware Trojans represents a hardware attack model that emerged in the last decades in the hardware security community. In this paper, we present a methodology for achieving a scalable approach to detect hardware Trojans at the design stage using program transformation in a rewrite-based environment. We note that the hardware Trojan attack considered here assumes the vulnerability introduction during the hardware design stage while the payload is obtained as information leakage during the hardware usage. The main contribution in our work is the methodology correctness proof for a high security evaluation assurance level. We also benchmark the effectiveness of our methodology on industrial hardware designs, e.g., Advanced Encryption Standard cores, which is widely used and deployed for numerous devices and applications. (c) 2022 Published by Elsevier Inc.

关键词： Hardware Trojans Information leakage Verilog Rewriting logic programming language semantics specifications Program transformation

来源：评论

学校读者我要写书评

暂无评论

Continuously generated fixed points in Pω

引用

Fundamenta Informaticae 1980年第4期3卷 477-489页

作者： Bracho, Felipe Mathematical Institute Oxford

In this paper we investigate the fixed points of functions that can be obtained by continuous fixed point operators in Pω. We also introduce an operator Cgn that generates all of these fixed points for any continuous function. In the last two sections of the paper we study the fixed points of λa.a∘a (retracts) and of λy λf.f((y)(f)) (fixed point operators).

关键词： programming language semantics lattice algebraic lattice retract continuous function fixed points

来源：评论

学校读者我要写书评

暂无评论

A LAYERED OBJECT-ORIENTED programming language

GEC JOURNAL OF RESEARCH

引用

GEC JOURNAL OF RESEARCH 1994年第3期11卷 173-180页

作者： CLARK, AN

A layered object-oriented programming language (OOPL) is defined using a simple functional notation that has been equipped with a collection of features common to many OOPLs. The I resulting language provides a framew... 详细信息

关键词： OBJECT-ORIENTED programming languageS FUNCTIONAL programming programming language semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：