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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 种 纸本馆藏

日期分布

学科分类号

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

主题

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

机构

3 篇 swansea univ dep...
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 篇 univ illinois de...
2 篇 stanford univ st...
1 篇 univ strathclyde...
1 篇 1.department of ...
1 篇 nanyang technol ...
1 篇 univ complutense...
1 篇 russian acad sci...
1 篇 stratify inc mou...
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 篇 jagadeesan r
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.

语言

121 篇 英文
16 篇 其他

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

共 137 条记录，以下是41-50 订阅

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

详细简洁

排序：

GSOS Formalized in Coq

GSOS Formalized in Coq

引用

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

作者： Madlener, Ken Smetsers, Sjaak Radboud Univ Nijmegen Inst Comp & Informat Sci iCIS NL-6525 ED Nijmegen Netherlands

ISBN: (纸本)9780769550534

Structural operational semantics provides a well-known framework to describe the semantics of programming languages, lending itself to formalization in theorem provers. The formalization of syntactic SOS rule formats, which enforce some form of well-behavedness, has so far received less attention. GSOS is a rule format that enjoys the property that the operational semantics and denotational semantics, both derived from the same set of GSOS rules, are consistent. The present paper formalizes the underlying theory in the theorem prover COQ, and proves the consistency property, also known as the adequacy theorem. The inspiration for our work has been drawn from the field of bialgebraic semantics.

关键词： algebra programming language semantics theorem proving

来源：评论

学校读者我要写书评

暂无评论

Oblivious program execution and path-sensitive non-interference

Oblivious program execution and path-sensitive non-interfere...

引用

IEEE 26th Computer Security Foundations Symposium

作者： Planul, Jeremy Mitchell, John C. Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9780769550312

Various cryptographic constructions allow an un-trusted cloud server to compute over encrypted data, without decrypting the data. However, this prevents the cloud server from branching according to encrypted values. We study the constraints imposed by this important scenario by formulating and solving an equivalent information-flow problem, based on assuming an adversary could observe the control path. We develop a type system that prevents control-path information leaks, prove soundness, and compare with traditional implicit information-flow. Because simply preventing programs that leak information severely restricts the language, we define alternate (and easily implemented) semantics that execute multiple paths and combine the results using data operations. This produces a termination problem which we address with a more refined type system that characterizes a useful class of obliviously executable programs. We prove fundamental results about this language, semantics, and type system and conclude by comparing with traditional timing-based information-flow.

关键词： cloud computing cryptography program verification programming language semantics type theory

来源：评论

学校读者我要写书评

暂无评论

Domain-Specific languages and Diagram Customization for a Concurrent Engineering Environment

Domain-Specific Languages and Diagram Customization for a Co...

引用

IEEE Aerospace Conference

作者： Cole, Bjorn Dubos, Greg Banazadeh, Payam Reh, Jonathan Case, Kelley Wang, Yeou-Fang Jones, Susan Picha, Frank CALTECH Jet Prop Lab Pasadena CA 91109 USA

ISBN: (纸本)9781467318112

A major open question for advocates of Model-Based Systems Engineering (MBSE) is the question of how system and subsystem engineers will work together. The Systems Modeling language (SysML), like any language intended for a large audience, is in tension between the desires for simplicity and for expressiveness. In order to be more expressive, many specialized language elements may be introduced, which will unfortunately make a complete understanding of the language a more daunting task. While this may be acceptable for systems modelers, it will increase the challenge of including subsystem engineers in the modeling effort. One possible answer to this situation is the use of Domain-Specific languages (DSL), which are fully supported by the Unified Modeling language (UML). SysML is in fact a DSL for systems engineering. The expressive power of a DSL can be enhanced through the use of diagram customization. Various domains have already developed their own schematic vocabularies. Within the space engineering community, two excellent examples are the propulsion and telecommunication subsystems. A return to simple box-and-line diagrams (e. g., the SysML Internal Block Diagram) are in many ways a step backward. In order allow subsystem engineers to contribute directly to the model, it is necessary to make a system modeling tool at least approximate in accessibility to drawing tools like Microsoft PowerPoint and Visio. The challenge is made more extreme in a concurrent engineering environment, where designs must often be drafted in an hour or two. In the case of the Jet Propulsion Laboratory's Team X concurrent design team, a subsystem is specified using a combination of PowerPoint for drawing and Excel for calculation. A pilot has been undertaken in order to meld the drawing portion and the production of master equipment lists (MELs) via a SysML authoring tool, MagicDraw. Team X currently interacts with its customers in a process of sharing presentations. There are several

关键词： Unified Modeling language aerospace propulsion concurrent engineering programming language semantics systems engineering

来源：评论

学校读者我要写书评

暂无评论

A programming language Approach to Fault Tolerance for Fork-Join Parallelism

A Programming Language Approach to Fault Tolerance for Fork-...

引用

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

作者： Zengin, Mustafa Vafeiadis, Viktor Max Planck Inst Software Syst MPI SWS Saarbrucken Germany

ISBN: (纸本)9780769550534

When running big parallel computations on thousands of processors, the probability that an individual processor will fail during the execution cannot be ignored. Computations should be replicated, or else failures should be detected at run-time and failed subcomputations reexecuted. We follow the latter approach and propose a high-level operational semantics that detects computation failures, and allows failed computations to be restarted from the point of failure. We implement this high-level semantics with a lower-level operational semantics that provides a more accurate account of processor failures, and prove in Coq the correspondence between the high- and low-level semantics.

关键词： checkpointing fault tolerant computing parallel processing programming language semantics

来源：评论

学校读者我要写书评

暂无评论

Assuring the Safety of On-Demand Medical Cyber-Physical Systems

Assuring the Safety of On-Demand Medical Cyber-Physical Syst...

引用

1st IEEE International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)

作者： King, Andrew L. Feng, Lu Sokolsky, Oleg Lee, Insup Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA

ISBN: (纸本)9781479907984

We present an approach to establish safety of on-demand medical cyber-physical systems which are assembled to treat a patient in a specific clinical scenario. We treat such a system as a virtual medial device (VMD) and propose a model-based framework that includes a modeling language with formal semantics and a medical application platform (MAP) that provides the necessary deployment support for the VMD models.

关键词： medical computing patient treatment programming language semantics safety-critical software virtual reality

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On Semantic Issues in Game-theoretic Rough Sets

On Semantic Issues in Game-theoretic Rough Sets

引用

Joint World Congress of the International-Fuzzy-Systems-Association (IFSA) / Annual Meeting of the North-American-Fuzzy-Information-Processing-Society (NAFIPS)

作者： Azam, Nouman Yao, JingTao Univ Regina Dept Comp Sci Regina SK S4S 0A2 Canada

ISBN: (纸本)9781479903481

The game-theoretic rough set (GTRS) model provides a configuration mechanism for determination of thresholds in probabilistic rough sets. The GTRS utilizes different approaches in implementing games for analyzing various applications and problems. The probabilistic thresholds and the key game components such as players and strategies may be interpreted differently based on a particular formulation and the considered application. This paper examines and considers two semantic issues in GTRS, i.e. the interpretation of key game-theoretic constructs and probabilistic thresholds. We address these issues by presenting some semantic descriptions that not only help in understanding the structural components of the model but also clarify the mechanism of transforming an initial pair of thresholds to a finally computed threshold values. An example is provided based on the proposed descriptions in explaining existing formulations.

关键词： game theory probability programming language semantics rough set theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Query Answering over Fact Bases in Fuzzy Propositional Logic

Query Answering over Fact Bases in Fuzzy Propositional Logic

引用

Joint World Congress of the International-Fuzzy-Systems-Association (IFSA) / Annual Meeting of the North-American-Fuzzy-Information-Processing-Society (NAFIPS)

作者： Plesniewicz, Gerald S. Moscow Power Engn Inst Dept Appl Math Moscow 111250 Russia

Let L be a fuzzy propositional logic based on triangular norm min(x,y) (Zadeh's logic). A fact in L is an expression of the form r r and not true E vertical bar= r <= phi <= s' with s' < s. A fac... 详细信息

ISBN: (纸本)9781479903481

Let L be a fuzzy propositional logic based on triangular norm min(x,y) (Zadeh's logic). A fact in L is an expression of the form r <= phi <= s where phi is an element of L and 0 <= r <= s <= 1. In fuzzy interpretation I of L every fact is true or false, and I(r <= phi <= s) = 1 if and only if the two-side inequality r <= I(phi) <= s is satisfied. Thus, the set FL of all facts defines a crisp logic with fuzzy interpretations. Logical consequence "vertical bar=" in the logic FL is defined as usual: for any set E of facts and any fact alpha, E vertical bar= alpha if there are no an interpretation I and a fact beta is an element of E such that I(alpha) = 1 and I(beta p) = 0.. But in the logic FL there is also strong logical consequence vertical bar=*: E vertical bar=* r <= phi <= s if E vertical bar= r <= phi <= s and it is not true that E vertical bar= r' <= phi <= s with r' > r and not true E vertical bar= r <= phi <= s' with s' < s. A fact base is a finite set F of facts: F ={r(i) <= phi(i) <= s(i) vertical bar 1 <= i <= n}. One can consider the set K ={phi(i) vertical bar 1 <= i <= n} as a fuzzy knowledge base and F as an instance of K A query is an expression of the form ?psi where psi is an element of L The answer to the query to the fact base F is the fact r <= psi <= s such that F vertical bar=* r <= psi <= s. The problem of query answering over fact bases in FL can be solved by analytical tableaux method. The method results in an algorithm with the exponential worst-case estimate (relatively to the size of F boolean OR {kappa} where kappa is a query). However, consider the situation when the knowledge base K and the query kappa are fixed but fact bases F are arbitrary instances of K Then, it is possible to answer query kappa to fact bases F quickly. But preliminary we should deal with the parametric fact base associated with K Under a parametric fact we mean an expression of the form a <= phi <= b where a and b are not numbers but parameters - variables with va

关键词： fuzzy logic fuzzy set theory programming language semantics query processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：