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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

76 篇 期刊文献
60 篇 会议
1 篇 学位论文

馆藏范围

137 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

131 篇 工学
- 108 篇 计算机科学与技术...
- 63 篇 软件工程
- 28 篇 电气工程
- 12 篇 控制科学与工程
- 4 篇 机械工程
- 4 篇 信息与通信工程
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 生物工程
28 篇 理学
- 26 篇 数学
- 5 篇 系统科学
- 1 篇 生物学
17 篇 管理学
- 16 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
2 篇 教育学
- 1 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 理论经济学
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

137 篇 programming lang...
20 篇 semantics
13 篇 semiotics
12 篇 formal verificat...
11 篇 formal specifica...
7 篇 denotational sem...
7 篇 language
6 篇 program verifica...
6 篇 rewriting logic
6 篇 specification la...
6 篇 concurrency
6 篇 formal specifica...
5 篇 software archite...
5 篇 syntax
5 篇 algebra
5 篇 functional progr...
4 篇 syntax in progra...
4 篇 programming
4 篇 type theory
4 篇 real-time system...

机构

3 篇 swansea univ dep...
3 篇 univ illinois de...
2 篇 saab ab jarfalla
2 篇 univ utrecht dep...
2 篇 portland state u...
2 篇 univ illinois ur...
2 篇 monash univ dept...
2 篇 alexandru ioan c...
2 篇 kth royal inst t...
2 篇 univ missouri co...
2 篇 stanford univ st...
1 篇 univ strathclyde...
1 篇 massachusetts in...
1 篇 1.department of ...
1 篇 nanyang technol ...
1 篇 univ complutense...
1 篇 russian acad sci...
1 篇 caltech jet prop...
1 篇 iit bhubaneshwar...
1 篇 univ birmingham ...

作者

4 篇 rosu grigore
3 篇 mosses peter d.
2 篇 hathhorn chris
2 篇 guanciale robert...
2 篇 lundberg didrik
2 篇 bruza peter d.
2 篇 alshnakat anoud
2 篇 palamidessi c
2 篇 dam mads
2 篇 gabbrielli m
2 篇 meseguer jose
2 篇 falaschi m
2 篇 hills mark
2 篇 ciobaca stefan
2 篇 marriott k
1 篇 mills hd
1 篇 king andrew l.
1 篇 hongwei sun
1 篇 ramesh s.
1 篇 simpson alex

语言

122 篇 英文
15 篇 其他

检索条件"主题词=programming language semantics"

共 137 条记录，以下是81-90 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Data-Type Checking of IEC61131-3 ST and IL Applications

Data-Type Checking of IEC61131-3 ST and IL Applications

引用

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

作者： de Souza, Mario Univ Porto Fac Engn P-4200 Oporto Portugal

ISBN: (纸本)9781467347372

The IEC 61508 standard recognizes the programming languages defined in IEC 61131-3 as being appropriate for safety-related applications, and suggests the use of static data type analysis of the source code. In this context, we have added a data type semantic verifier to the MatIEC compiler - an open source ST, IL and SFC code translator to ANSI C. In so doing, we have identified several issues related to the definition of the semantics of the IL and ST programming languages, as well as with the data type model defined in IEC 61131-3. In this paper we describe the issues we uncovered, explain how the data type static analyzer of the MatIEC was implemented, explain the options we took, and suggest how the IEC 61131-3 standard could be made more explicit.

关键词： C language program compilers program diagnostics program verification programming language semantics public domain software safety-critical software source coding

来源：评论

学校读者我要写书评

暂无评论

Learning Deep semantics for Test Completion 23

Learning Deep Semantics for Test Completion

引用

45th IEEE/ACM International Conference on Software Engineering (ICSE)

作者： Nie, Pengyu Banerjee, Rahul Li, Junyi Jessy Mooney, Raymond J. Gligoric, Milos UT Austin Austin TX 78712 USA

ISBN: (纸本)9781665457019

Writing tests is a time-consuming yet essential task during software development. We propose to leverage recent advances in deep learning for text and code generation to assist developers in writing tests. We formalize the novel task of test completion to automatically complete the next statement in a test method based on the context of prior statements and the code under test. We develop TECO-a deep learning model using code semantics for test completion. The key insight underlying TECO is that predicting the next statement in a test method requires reasoning about code execution, which is hard to do with only syntax-level data that existing code completion models use. TECO extracts and uses six kinds of code semantics data, including the execution result of prior statements and the execution context of the test method. To provide a testbed for this new task, as well as to evaluate TECO, we collect a corpus of 130,934 test methods from 1,270 open-source Java projects. Our results show that TECO achieves an exact-match accuracy of 18, which is 29% higher than the best baseline using syntax-level data only. When measuring functional correctness of generated next statement, TECO can generate runnable code in 29% of the cases compared to 18% obtained by the best baseline. Moreover, TECO is significantly better than prior work on test oracle generation.

关键词： test completion deep neural networks programming language semantics

来源：评论

学校读者我要写书评

暂无评论

Semantic Investigation of a Control-Flow Subset of BPMN 2.0 11

Semantic Investigation of a Control-Flow Subset of BPMN 2.0

引用

11th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)

作者： Todoran, Eneia Nicolae Mitrea, Paulina Tech Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

ISBN: (纸本)9781467382007

Business Process Model and Notation (BPMN), now at version 2.0.2, provides a standard graphical representation for specifying business processes. In this paper we report on the first stage of a semantic investigation of BPMN, using methods in the tradition of programming languages semantics. We consider a control-flow subset of BPMN and an execution architecture based on an intermediate language that we name L-BPMN. The execution architecture comprises two main components: a translator which takes as input a BPMN model and generates L-BPMN code, and an interpreter for L-BPMN. L-BPMN is a process oriented imperative language providing a combination of concepts, including maximal parallelism and durational activities. We employ the mathematical methodology of metric semantics in designing and relating an operational semantics O and a denotational semantics D for L-BPMN. We establish the formal relation between O and D by using an abstraction operator and a fixed point argument. In this way we prove the correctness of the denotational semantics with respect to the operational semantics. We focus on the semantic investigation of BPMN. We also explain how the operational semantics can serve as a blueprint for an implementation on a client-server architecture.

关键词： business data processing program compilers program interpreters programming language semantics ?BPMN code generation ?BPMN language BPMN 2.0 abstraction operator business process model-and-notation business process specification client-server architecture control-flow subset denotational semantics durational activities execution architecture fixed point argument formal relation interpreter mathematical methodology maximal parallelism metric semantics operational semantics process oriented imperative language programming languages semantics standard graphical representation translator Business Clocks Computer architecture semantics Syntactics Yttrium programming language semantics translator semantics Client Server Architecture interpreters compilers business data processing semiotics Computer Architecture Timing devices Business Rare earths yttrium Fixed point

来源：评论

学校读者我要写书评

暂无评论

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes 13

Intensional Type Theory with Guarded Recursive Types qua Fix...

引用

28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)

作者： Birkedal, Lars Mogelberg, Rasmus Ejlers Aarhus Univ Dept Comp Sci DK-8000 Aarhus C Denmark IT Univ Copenhagen Copenhagen Denmark

ISBN: (纸本)9781479904136

Guarded recursive functions and types are useful for giving semantics to advanced programming languages and for higher-order programming with infinite data types, such as streams, e.g., for modeling reactive systems. We propose an extension of intensional type theory with rules for forming fixed points of guarded recursive functions. Guarded recursive types can be formed simply by taking fixed points of guarded recursive functions on the universe of types. Moreover, we present a general model construction for constructing models of the intensional type theory with guarded recursive functions and types. When applied to the groupoid model of intensional type theory with the universe of small discrete groupoids, the construction gives a model of guarded recursion for which there is a one-to-one correspondence between fixed points of functions on the universe of types and fixed points of (suitable) operators on types. In particular, we find that the functor category Grpd omega(op) from the preordered set of natural numbers to the category of groupoids is a model of intensional type theory with guarded recursive types.

关键词： category theory group theory programming language semantics recursive functions type theory

来源：评论

学校读者我要写书评

暂无评论

Desynchronization: From Macro-step to Micro-step 18

Desynchronization: From Macro-step to Micro-step

引用

16th ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)

作者： Bai, Yu Hebei Univ Sci & Technol Yuxiangjie 26 Shijiazhuang 050018 Hebei Peoples R China

ISBN: (纸本)9781538661956

Desynchronization is a central technique for the deployment of synchronous models in distributed environments. In the past decade, various notions of desynchronization as well as concurrency of synchronous systems have been developed. However most works consider only the macro-step semantics of the synchronous systems, therefore are not applicable to those with micro-step semantics like Esterel and Statechart. In particular, macro-step notations lack of the capability to describe deadlocks which are available only via micro-step level modeling. In this paper, we present a desynchronization framework that covers both abstract levels of macro-step and micro-step. In particular, we use labeled transition system to model the operational semantics of general process networks, and further developed the macro-step synchronous modeling. Based on this notion, each transition relation is further decorated with causal pre-orders to model micro-steps within a macro-step, which are then explicitly modeled as transition relations after a desynchronization transformation. Based on this framework, we re-examined some previous macro-step level desynchronization techniques and established new theories that are necessary for their micro-step level adaptation.

关键词： formal specification programming language semantics specification languages synchronisation programming language semantics specification description language Formal specifications semantics semiotics Esterel synchronous system Dosage Form Not Applicable

来源：评论

学校读者我要写书评

暂无评论

Capturing Assertions from Natural language Descriptions

Capturing Assertions from Natural Language Descriptions

引用

1st International Workshop on Natural language Analysis in Software Engineering (NaturaLiSE)

作者： Harris, Ian G. Univ Calif Irvine Dept Comp Sci Irvine CA 92717 USA

ISBN: (纸本)9781467362719

We present a technique to automatically generate formal, executable assertions from natural language assertion descriptions written in English. Assertions are program invariants which are commonly used for result checking in the hardware verification process. We present an attribute grammar which captures the semantics of a subset of English language assertion descriptions. Using the attribute grammar, we parse assertion descriptions and generate semantically equivalent formal models. We have evaluated our technique using a large set of industrial assertion descriptions. We present the successful assertion generation results, as well as the limitations of our approach and methods to address those limitations in the future.

关键词： formal languages formal verification grammars natural language processing programming language semantics

来源：评论

学校读者我要写书评

暂无评论

JSPick - A server pages design recovery tool

JSPick - A server pages design recovery tool

引用

7th European Conference on Software Maintenance and Reengineering (CSMR 2003)

作者： Draheim, D Fehr, E Weber, G Free Univ Berlin Inst Comp Sci D-1000 Berlin Germany

This paper presents the reverse engineering tool JSPick, which recovers page signatures and form types from server pages based presentation layers. A formal semantics of the tool is given in pseudo-evaluation style.

ISBN: (纸本)0769519024

关键词： reverse engineering Java programming language semantics distributed programming object-oriented programming software maintenance software tools JSPick server pages design recovery tool reverse engineering tool server pages based presentation la

来源：评论

学校读者我要写书评

暂无评论

Implementing a reactive semantics using OpenRTM-aist

Implementing a reactive semantics using OpenRTM-aist

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Biggs, Geoffrey MacDonald, Bruce A. Natl Inst Adv Ind Sci & Technol Intelligent Syst Res Inst Tsukuba Ibaraki Japan Univ Auckland Dept Elect & Comp Engn Auckland New Zealand

ISBN: (纸本)9781424466757

The expression of reactive behaviour is a significant and important requirement in robotic software engineering, since robots must cope with a wide range of unpredictable events and environments. However it is important that the semantics for reactive expression can be used across different architectures and languages. The RADAR robot programming language provides architecture- and language-independent semantics for managing the reactive parts of robot software together with the deliberative parts, allowing greater interaction between the two. We evaluate the architecture-independence of RADAR, as an example, by implementing its reactive semantics using the OpenRTM-aist component-based, distributed architecture. Our goal is to evaluate what limitations the choice of implementation environment may place on the capabilities of such an architecture-independent semantics. In our implementation, we aimed to produce a standard OpenRTM-aist system using the RADAR semantics. We have found that the architecture-independent semantics concept works well in the case of RADAR, although some specific improvements are needed for full interaction between deliberative and reactive sections of robotic software.

关键词： OpenRTM-aist RADAR robot programming language architecture-independent semantics component-based distributed architecture language-independent semantics object-oriented programming programming language semantics reactive expression reactive semantics robot programming robotic software engineering software architecture

来源：评论

学校读者我要写书评

暂无评论

Verifying bigraphical models of architectural reconfigurations

Verifying bigraphical models of architectural reconfiguratio...

引用

7th International Symposium on Theoretical Aspects of Software Engineering (TASE)

作者： Sanchez, Alejandro Soares Barbosa, Luis Riesco, Daniel Univ Nacl San Luis Dept Informat San Luis Argentina Univ Minho INESC TEC HASLab Braga Portugal

ISBN: (纸本)9780769550534

ARCHERY is an architectural description language for modelling and reasoning about distributed, heterogeneous and dynamically reconfigurable systems. This paper proposes a structural semantics for ARCHERY, and a method for deriving labelled transition systems (LTS) in which states and transitions represent configurations and reconfiguration operations, respectively. Architectures are modelled by bigraphs and their dynamics by parametric reaction rules. The resulting LTSs can be regarded as Kripke frames, appropriate for verifying reconfiguration constraints over architectural patterns expressed in a modal logic. The derivation method proposed here applies the approach in [1] twice, and combines the results of each application to obtain a label representing a reconfiguration operation and its actual parameters. Labels obtained in this way are minimal and yield LTSs in which bisimulation is a congruence.

关键词： bisimulation equivalence formal specification formal verification graph grammars programming language semantics reasoning about programs software architecture specification languages

来源：评论

学校读者我要写书评

暂无评论

Towards a refinement calculus for object systems 1

Towards a refinement calculus for object systems

引用

1st IEEE International Conference on Cognitive Informatics (ICCI 2002)

作者： He, JF Liu, ZM Li, XS UN Univ Int Inst Software Technol Macau Peoples R China

ISBN: (纸本)0769517242

This paper presents a refinement calculus for object systems with visibility, dynamic binding and mutual dependency. The intention is to support effective use of a relational model for specifying and reasoning in activities of an object system development process. The semantics framework will define the meaning of the combinators in the exactly same way as their counterparts in the imperative programming languages. This makes the approach more accessible to the users who are already familiar with the algebraic laws and the verification tools developed for these languages. The paper also provides a set of transformation rules in support of object system refinement.

关键词： refinement calculus object-oriented programming object-oriented methods software agents multi-agent systems formal specification formal verification programming language semantics refinement calculus object systems visibility dynamic binding mutual dependency relational model specification reasoning object system development process semantics framework combinators imperative programming languages verification tools transformation rules object system refinement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：