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

15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Ferrandiz-Colmeiro, Antonio Gilart-Iglesias, Virgilio Macia-Perez, Francisco Univ Alicante Dept Comp Sci Alicante Spain

ISBN: (纸本)9781424468508

This paper presents a proposal enabling the modelling of manufacturing processes independently of the structure and composition of the industrial plant where these processes will ultimately be implemented. The rationale for the proposal is in the incorporation of knowledge, supported by ontologies regarding manufacturing processes, industrial machinery and the industrial plants involved. With this knowledge, process engineers can focus their efforts exclusively to define the activities to be performed on the raw material (abstract model), allowing the system to infer what other activities should be incorporated in the abstract model to obtain a particular manufacturing process tailored to a particular industrial plant. To refine the proposal, a case study is put forward in which the management system was able to infer the way for the raw material to be processed according to the abstract model and automatically composed the activities necessary for achieving it. Finally, an implementation of this management system for processes is presented together with the design of two models of industrial plant that demonstrate the validity of our proposal.

关键词： industrial machinery industrial plant machinery manufacturing processes manufacturing processes ontologies ontologies (artificial intelligence) processes management system production engineering computing programming language semantics raw material semantic processes modelling

来源：评论

学校读者我要写书评

暂无评论

Containment Domains: A Scalable, Efficient, and Flexible Resilience Scheme for Exascale Systems

Containment Domains: A Scalable, Efficient, and Flexible Res...

引用

25th ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC)

作者： Chung, Jinsuk Lee, Ikhwan Sullivan, Michael Ryoo, Jee Ho Kim, Dong Wan Yoon, Doe Hyun Kaplan, Larry Erez, Mattan Univ Texas Austin Austin TX 78712 USA HP Labs Bristol Avon England Cray Inc Seattle WA USA

ISBN: (纸本)9781467308052;9781467308045

This paper describes and evaluates a scalable and efficient resilience scheme based on the concept of containment domains. Containment domains are a programming construct that enable applications to express resilience needs and to interact with the system to tune and specialize error detection, state preservation and restoration, and recovery schemes. Containment domains have weak transactional semantics and are nested to take advantage of the machine and application hierarchies and to enable hierarchical state preservation, restoration, and recovery. We evaluate the scalability and efficiency of containment domains using generalized trace-driven simulation and analytical analysis and show that containment domains are superior to both checkpoint restart and redundant execution approaches.

关键词： application program interfaces error detection programming language semantics software performance evaluation system recovery

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of composite types for Decompilation

Reconstruction of composite types for Decompilation

引用

10th IEEE Working Conference on Source Code Analysis and Manipulation (SCAM)

作者： Troshina, K. Derevenets, Y. Chernov, A. Russian Acad Sci Inst Syst Programming 25 A Solzhenitsyn St Moscow Russia Moscow MV Lomonosov State Univ Computat Math & Cybernet Dept Moscow Russia

ISBN: (纸本)9780769541785

Decompilation is reconstruction of a program in a high-level language from a program in a low-level language. This paper presents a method for automatic reconstruction of composite types (structures, arrays and combinations of them) in a high-level program during decompilation. Assembly code is obtained by disassembling a binary code or traces collected by a simulator. The proposed method is based on expressing memory access operations as pairs (base + offset), then building equivalence classes for the bases used in the program and accumulating offsets for each equivalence class. For Strictly conforming C programs our approach is substantiated by the C language semantics as defined in the international standard. However, experimental results have revealed that it is applicable for real-world programs also. Experimental results are obtained for a number of open-source programs as well as for traces collected from them. The method is an essential part of the tool for program decompilation TyDec being developed by the authors. Decompiler TyDec can be used as a standalone tool or as a plug-in for Interactive Trace Explorer TrEx being developed in Institute for System programming, Russian Academy of Sciences.

关键词： C language C language semantics TyDec decompilation assembly code composite types reconstruction data type reconstruction decompilation equivalence classes high level language high level languages high level program interactive trace explorer TrEx open source programs program assemblers program reconstruction programming language semantics public domain software reverse engineering strictly conforming C programs

来源：评论

学校读者我要写书评

暂无评论

Equivalence of Formal semantics Definition Methods

引用

Formal Aspects of Computing 1997年第1期9卷 68-77页

作者： Caswell, M.J.A. Dept. of Computer Studies Loughborough University Loughborough Leicestershire United Kingdom

There are numerous methods of formally defining the semantics of computer languages. Each method has been designed to fulfil a different purpose. For example, some have been designed to make reasoning about languages as easy as possible;others have been designed to be accessible to a large audience and some have been designed to ease implementation of languages. Given two semantics definitions of a language written using two separate semantics definition methods, we must be able to show that the two are in fact equivalent. If we cannot do this then we either have an error in one of the semantics definitions, or more seriously we have a problem with the semantics definition methods themselves. Three methods of defining the semantics of computer languages have been considered, i.e. Denotational semantics, Structural Operational semantics and Action semantics. An equivalence between these three is shown for a specific example language by first defining its semantics using each of the three definition methods. The proof of the equivalence is then constructed by selecting pairs of the semantics definitions and showing that they define the same language.

关键词： Action semantics Denotational semantics Equivalence programming language semantics Structural operational semantics

来源：评论

学校读者我要写书评

暂无评论

Architectural semantics of AADL using Event-B

Architectural Semantics of AADL using Event-B

引用

proc 2014 inter conf contemporary comp informatics (ic3i)

作者： D'Souza, Meenakshi Ramesh, S. Satpathy, Manoranjan IIIT Bangalore Bangalore 560100 Karnataka India Gen Motors R&D Warren MI USA IIT Bhubaneshwar Sch Elect Sci Bhubaneswar 751013 Orissa India

ISBN: (纸本)9781479966295

AADL (Architectural Analysis and Design language) can describe the architecture of an embedded control system at various levels of abstraction. In addition, AADL supports refinement mechanisms for refining abstract models to more detailed ones. However, the refinement mechanism in AADL is of informal nature. Event-B is an independent formal modelling notation for rigorous development of software systems. In Event-B, consistency of a model and refinement relationship can be formally verified. In this paper, we consider a meaningful subset of AADL, and give its semantics in terms of refinement and model decomposition mechanism of Event-B. An AADL model at any level of abstraction can be mapped to an Event-B model, and in the process, the informal refinement relationship between AADL models can be formalized in Event-B. In addition, the decomposition of a component into sub-components can be mapped to Event-B decomposition. We discuss our approach by referring to the case study of a simplified Cruise Controller.

关键词： formal verification programming language semantics software architecture specification languages AADL Event-B decomposition architectural analysis and design language architectural semantics embedded control system formal modelling refinement mechanism Abstracts Computational modeling Computer architecture Instruction sets semantics Switches Vehicles

来源：评论

学校读者我要写书评

暂无评论

Formally specifying the syntax and semantics of a visual query language for the domain of high energy physics data analysis

Formally specifying the syntax and semantics of a visual que...

引用

IEEE Symposium on Visual languages and Human-Centric Computing

作者： Amaral, V Helmer, S Moerkotte, G Univ Nova Lisboa P-1200 Lisbon Portugal

ISBN: (纸本)0769524435

Currently, physicists working in High Energy Physics experiments have to write their queries in general purpose programming languages using complex frameworks for accessing the data. This distracts them from their actual work, namely data analysis, and reduces their productivity significantly. We have improved this situation by designing and implementing the first visual query language specific to this domain. Our goal was to provide a tool enabling physicists to formulate queries in their own terms and notation. In this paper we focus on the formal definition of our visual query language (including syntax and semantics). The meanings of our operators are well-defined by means of translational semantics;i.e., we map all elements of our language to a well-known NF2 algebra. We conclude with a discussion of the advantages of this formal design approach.

关键词： data analysis formal specification physics computing programming language semantics query formulation query languages visual languages NF2 algebra data access formal design high energy physics data analysis high energy physics experi data base language physics computing programming language semantics visual languages search strategies Data analysis Access to Information information retrieval Formal specifications syntax Particle physics semantics Statistical analysis semiotics

来源：评论

学校读者我要写书评

暂无评论

The semantics of Multicopy Atomic ARMv8 and RISC-V

The Semantics of Multicopy Atomic ARMv8 and RISC-V

引用

作者： Pulte, Christopher University of Cambridge

学位级别：博士

Previous work has established precise operational concurrency models for Power and ARMv8, in an abstract micro-architectural style based on detailed discussion with IBM and ARM staff and extensive hardware testing. To account for the precise architectural behaviour these models are complex. This thesis aims to provide a better understanding for the relaxed memory concurrency models of the architectures ARMv8, RISC-V, and (to a lesser degree) Power. Power and early versions of ARMv8 have non-multicopy-atomic (non-MCA) concurrency models. This thesis provides abstraction results for these, including a more abstract non-MCA ARMv8 storage subsystem model, and characterisations of the behaviour of mixed-size Power and non-MCA ARMv8 programs when using barriers or release/acquire instructions for all memory accesses, with respect to notions of Sequential Consistency for mixed-size programs. During the course of this PhD project, and partly due to our extended collaboration with ARM, ARM have shifted to a much simplified multicopy-atomic concurrency architecture that also includes a formal axiomatic concurrency model. We develop a correspondingly simplified operational model based on the previous non-MCA models, and, as the main result of this thesis, prove equivalence between the simplified operational and the reference axiomatic model. We have also been actively involved in the RISC-V Memory Model Task Group. RISC-V has adopted a multicopy atomic model closely following that of ARMv8, but which incorporates some changes motivated by issues raised in our operational modelling of ARMv8. We develop an adapted RISC-V operational concurrency model that is now part of the official architecture documentation. Finally, in order to give a simpler explanation of the MCA ARMv8 and RISC-V concurrency models for programmers, we develop an equivalent operational concurrency model in a different style. The \promisingarmriscv model, based on the C11 Promising model, gives up the micro-a

关键词： programming language semantics relaxed memory concurrency processor architectures

来源：评论

学校读者我要写书评

暂无评论

A Text-Based Fully Automated Architecture for the Semantic Annotation and Retrieval of Turkish News Videos

A Text-Based Fully Automated Architecture for the Semantic A...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Kucuk, Dilek Yazici, Adnan TUBITAK UZAY Power Elect Grp Ankara Turkey Middle East Tech Univ Dept Comp Engn Ankara Turkey

ISBN: (纸本)9781424469208

Video texts are known to constitute an important source of information for semantic summaries of video archives. In this study, we propose a fully automated architecture for semantic annotation and later retrieval of Turkish news videos based on the corresponding video texts. At the core of the architecture is a named entity recognizer, the output of which on video texts is used as semantic annotations for the corresponding videos. The architecture also comprises components for news story segmentation, sliding text recognition, and video retrieval in addition to a news video database. The news story segmentation module makes use of the audio waveforms of the raw video files to detect the boundaries of individual news stories. The sliding text recognizer is then executed on the video segments corresponding to these news stories to extract their texts. The texts are then fed into the named entity recognizer for Turkish news texts to extract the named entities which are to be used as semantic annotations or index terms for the retrieval of these news videos. Finally, the retrieval interface of the overall architecture enables access to the annotated videos and video segments through boolean queries formed by using the previously extracted named entities. This study is significant for its proposing the first fully automated architecture for the semantic annotation and retrieval of Turkish news video archives.

关键词： Turkish news videos automated architecture boolean queries image recognition image segmentation programming language semantics semantic annotation sliding text recognizer text analysis video archives video retrieval video segmentation video texts retrieval

来源：评论

学校读者我要写书评

暂无评论

Tool Support for Component-Based semantics 2016

Tool Support for Component-Based Semantics

引用

15th International Conference on Modularity (MODULARITY)

作者： van Binsbergen, L. Thomas Sculthorpe, Neil Mosses, Peter D. Royal Holloway Univ London Dept Comp Sci London England Swansea Univ Dept Comp Sci Swansea W Glam Wales

ISBN: (纸本)9781450340335

The developers of a programming language need to document its intended syntax and semantics, and to update the documentation when the language evolves. They use formal grammars to define context-free syntax, but usually give only an informal description of semantics. Use of formal semantics could greatly increase the consistency and completeness of language documentation, support rapid prototyping, and allow empirical validation. Modularity of semantics is essential for practicality when scaling up to definitions of larger languages. Component-based semantics takes modularity to the highest possible level. In this approach, the semantics of a language is defined by equations translating its constructs (compositionally) to combinations of so-called fundamental constructs, or 'funcons'. The definition of each funcon is a small, highly reusable component. The PLANCOMPS project has defined a substantial library of funcons, and shown their reusability in several case studies. We have designed a meta-language called CBS for component-based semantics, and an IDE to support development, rapid prototyping, and validation of definitions in CBS. After introducing and motivating CBS, we demonstrate how the IDE can be used to browse and edit the CBS definition of a toy language, to generate a prototype implementation of the language, and to parse and run programs.

关键词： programming language semantics modularity reusability tool support rapid prototyping

来源：评论

学校读者我要写书评

暂无评论

HOL4P4: semantics for a Verified Data Plane 5

HOL4P4: Semantics for a Verified Data Plane

引用

5th International Workshop on P4 in Europe (EuroP4) Part of 18th International Conference on Emerging Networking Experiments and Technologies (ACM CoNEXT)

作者： Alshnakat, Anoud Lundberg, Didrik Guanciale, Roberto Dam, Mads Palmskog, Karl KTH Royal Inst Technol Stockholm Sweden Saab AB Jarfalla Sweden

ISBN: (纸本)9781450399357

We introduce a formal semantics of P4 for the HOL4 interactive theorem prover. We exploit properties of the language, like the absence of call by reference and the copy-in/copy-out mechanism, to define a heapless small-step semantics that is abstract enough to simplify verification, but that covers the main aspects of the language: interaction with the architecture via externs, table match, and parsers. Our formalization is written in the Ott metalanguage, which allows us to export definitions to multiple interactive theorem provers. The exported HOL4 semantics allows us to establish machine-checkable proofs regarding the semantics, properties of P4 programs, and soundness of analysis tools.

关键词： P4 programming language semantics interactive theorem proving formal verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：