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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

156 篇 会议
43 册 图书
14 篇 期刊文献

馆藏范围

211 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

146 篇 工学
- 138 篇 计算机科学与技术...
- 100 篇 软件工程
- 13 篇 电气工程
- 13 篇 信息与通信工程
- 10 篇 控制科学与工程
- 5 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 轻工技术与工程
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
56 篇 理学
- 52 篇 数学
- 6 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 生物学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 大气科学
- 1 篇 地球物理学
10 篇 管理学
- 9 篇 图书情报与档案管...
2 篇 医学
- 2 篇 基础医学(可授医学...
- 1 篇 临床医学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学
1 篇 农学
- 1 篇 作物学

主题

22 篇 theory of comput...
22 篇 software enginee...
16 篇 software enginee...
15 篇 logics and meani...
13 篇 mathematical log...
12 篇 programming lang...
11 篇 semantics
10 篇 artificial intel...
10 篇 computation by a...
9 篇 computer softwar...
8 篇 computer system ...
8 篇 programming tech...
8 篇 data structures
8 篇 data structures ...
7 篇 system analysis
6 篇 computer communi...
6 篇 mathematics of c...
5 篇 model checking
5 篇 algorithm analys...
4 篇 discrete mathema...

机构

4 篇 max planck inst ...
3 篇 max planck inst ...
3 篇 univ leicester d...
3 篇 university of ox...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 univ london impe...
2 篇 univ bologna dip...
2 篇 cwi dept softwar...
2 篇 univ warwick dep...
2 篇 rwth aachen univ...
2 篇 queen mary univ ...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...
2 篇 univ oxford dept...
2 篇 imdea software i...
2 篇 the university o...
2 篇 university of ca...
2 篇 univ paris 07 li...
2 篇 univ london quee...

作者

3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 chistikov dmitry
3 篇 o'hearn p
2 篇 ulidowski irek
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 busi n
2 篇 sagiv mooly
2 篇 naoki kobayashi
2 篇 anna ingólfsdótt...
2 篇 luca aceto
2 篇 haase christoph
2 篇 furio honsell
2 篇 kurz alexander
2 篇 aceto luca
2 篇 pfenning frank
2 篇 boneva i
2 篇 plump detlef
2 篇 mogens nielsen

语言

204 篇 英文
5 篇 其他
4 篇 中文

检索条件"任意字段=4th International Conference on Foundations of Software Science and Computation Structures"

共 213 条记录，以下是71-80 订阅

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

详细简洁

排序：

Comparator: A Tool for Quantifying Behavioural Compatibility

Comparator: A Tool for Quantifying Behavioural Compatibility

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Ouederni, Meriem Salaun, Gwen Camara, Javier Pimentel, Ernesto IRIT Toulouse INP Toulouse France INRIA Grenoble INP Le Chesnay Rocquencourt France Carnegie Mellon Univ Inst Software Res Pittsburgh PA 15213 USA Univ Malaga Dept Comp Sci Malaga Spain

We present Comparator, a tool that measures the compatibility between two behavioural interfaces. Comparator can be used as a stand-alone Web application, and is also integrated into a model-based adaptation toolbox.

ISBN: (纸本)9783642548048;9783642548031

关键词： Comparators (optical)

来源：评论

学校读者我要写书评

暂无评论

Polymorphic Single-Pushout Graph Transformation

Polymorphic Single-Pushout Graph Transformation

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Loewe, Michael Koenig, Harald Schulz, Christoph FHDW Hannover Freundallee 15 D-30173 Hannover Germany

ISBN: (纸本)9783642548048;9783642548031

the paper extends single-pushout graph transformation by polymorphism, a key concept in object-oriented design. the notions sub-rule and remainder, well-known in single-pushout rewriting, are applied in order to model dynamic rule extension and type dependent rule application. this extension mechanism qualifies graph transformation as a modelling technique for extendable frameworks. therefore, it contributes to the applicability of graph transformation in software engineering.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Family-Based Performance Analysis of Variant-Rich software Systems

Family-Based Performance Analysis of Variant-Rich Software S...

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Kowal, Matthias Schaefer, Ina Tribastone, Mirco Tech Univ Carolo Wilhelmina Braunschweig Braunschweig Germany Univ Southampton Southampton Hants England

ISBN: (纸本)9783642548048;9783642548031

We study models of software systems with variants that stem from a specific choice of configuration parameters with a direct impact on performance properties. Using UML activity diagrams with quantitative annotations, we model such systems as a product line. the efficiency of a product-based evaluation is typically low because each product must be analyzed in isolation, making difficult the re-use of computations across variants. Here, we propose a family-based approach based on symbolic computation. A numerical assessment on large activity diagrams shows that this approach can be up to three orders of magnitude faster than product-based analysis in large models, thus enabling computationally efficient explorations of large parameter spaces.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

Transformation of Attributed structures with Cloning

Transformation of Attributed Structures with Cloning

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Duval, Dominique Echahed, Rachid Prost, Frederic Ribeiro, Leila Univ Grenoble LJK Grenoble France Univ Grenoble LIG Grenoble France Univ Fed Rio Grande do Sul INF Porto Alegre RS Brazil

ISBN: (纸本)9783642548048;9783642548031

Copying, or cloning, is a basic operation used in the specification of many applications in computer science. However, when dealing with complex structures, like graphs, cloning is not a straightforward operation since a copy of a single vertex may involve (implicitly) copying many edges. therefore, most graph transformation approaches forbid the possibility of cloning. We tackle this problem by providing a framework for graph transformations with cloning. We use attributed graphs and allow rules to change attributes. these two features (cloning/changing attributes) together give rise to a powerful formal specification approach. In order to handle different kinds of graphs and attributes, we first define the notion of attributed structures in an abstract way. then we generalise the sesqui-pushout approach of graph transformation in the proposed general framework and give appropriate conditions under which attributed structures can be transformed. Finally, we instantiate our general framework with different examples, showing that many structures can be handled and that the proposed framework allows one to specify complex operations in a natural way.

关键词： Cloning

来源：评论

学校读者我要写书评

暂无评论

Automatic Program Repair by Fixing Contracts

Automatic Program Repair by Fixing Contracts

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Pei, Yu Furia, Carlo A. Nordio, Martin Meyer, Bertrand Swiss Fed Inst Technol Chair Software Engn Zurich Switzerland

ISBN: (纸本)9783642548048;9783642548031

While most debugging techniques focus on patching implementations, there are bugs whose most appropriate corrections consist in fixing the specification to prevent invalid executions-such as to define the correct input domain of a function. In this paper, we present a fully automatic technique that fixes bugs by proposing changes to contracts (simple executable specification elements such as pre- and postconditions). the technique relies on dynamic analysis to understand the source of buggy behavior, to infer changes to the contracts that emend the bugs, and to validate the changes against general usage. We have implemented the technique in a tool called SpeciFix, which works on programs written in Eiffel, and evaluated it on 44 bugs found in standard data-structure libraries. Manual analysis by human programmers found that SpeciFix suggested repairs that are deployable for 25% of the faults;in most cases, these contract repairs were preferred over fixes for the same bugs that change the implementation.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Mining the Categorized software Repositories to Improve the Analysis of Security Vulnerabilities

Mining the Categorized Software Repositories to Improve the ...

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Sadeghi, Alireza Esfahani, Naeem Malek, Sam George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

ISBN: (纸本)9783642548048;9783642548031

Security has become the Achilles' heel of most modern software systems. Techniques ranging from the manual inspection to automated static and dynamic analyses are commonly employed to identify security vulnerabilities prior to the release of the software. However, these techniques are time consuming and cannot keep up with the complexity of ever-growing software repositories (e.g., Google Play and Apple App Store). In this paper, we aim to improve the status quo and increase the efficiency of static analysis by mining relevant information from vulnerabilities found in the categorized software repositories. the approach relies on the fact that many modern software systems are developed using rich application development frameworks (ADF), allowing us to raise the level of abstraction for detecting vulnerabilities and thereby making it possible to classify the types of vulnerabilities that are encountered in a given category of application. We used open-source software repositories comprising more than 7 million lines of code to demonstrate how our approach can improve the efficiency of static analysis, and in turn, vulnerability detection.

关键词： Security Vulnerability Mining software Repositories software Analysis

来源：评论

学校读者我要写书评

暂无评论

Target Oriented Relational Model Finding

Target Oriented Relational Model Finding

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Cunha, Alcino Macedo, Nuno Guimaraes, Tiago INESC TEC HASLab High Assurance Software Lab Braga Portugal Univ Minho Braga Portugal

ISBN: (纸本)9783642548048;9783642548031

Model finders are becoming useful in many software engineering problems. Kodkod [19] is one of the most popular, due to its support for relational logic (a combination of first order logic with relational algebra operators and transitive closure), allowing a simpler specification of constraints, and support for partial instances, allowing the specification of a priori (exact, but potentially partial) knowledge about a problem's solution. However, in some software engineering problems, such as model repair or bidirectional model transformation, knowledge about the solution is not exact, but instead there is a known target that the solution should approximate. In this paper we extend Kodkod's partial instances to allow the specification of such targets, and show how its model finding procedure can be adapted to support them (using both PMax-SAT solvers or SAT solvers with cardinality constraints). Two case studies are also presented, including a careful performance evaluation to assess the effectiveness of the proposed extension.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Generating Abstract Graph-Based Procedure Summaries for Pointer Programs

Generating Abstract Graph-Based Procedure Summaries for Poin...

引用

7th international conference on Graph Transformation (ICGT) Held as Part of conference on software Technologies - Applications and foundations (STAF)

作者： Jansen, Christina Noll, thomas Rhein Westfal TH Aachen Software Modeling & Verificat Grp Aachen Germany

ISBN: (纸本)9783319091082;9783319091075

the automated analysis and verification of pointer-manipulating programs operating on a heap is a challenging task. It requires abstraction techniques for dealing with complex program behaviour and unbounded state spaces that arise from both dynamic data structures and recursive procedures. In previous work it was shown that hyperedge replacement grammars provide an intuitive and versatile concept for defining and implementing such abstractions. Here we extend this approach towards a modular way of reasoning about programs with (possibly recursive) procedures featuring local variables. We propose an interprocedural dataflow analysis to automatically derive procedure contracts, i.e., graph transformations that concisely capture the overall effect of a procedure. Besides its modularity, another advantage of this analysis is that it relieves us from explicitly modelling the call stack on the heap, i.e., heap and control abstraction are clearly separated. the former can now be specified by simple and intuitive hyperedge replacement grammars describing the data structures only, while the latter is realised by automatically generated procedure contracts.

关键词： Hypergraphs Hyperedge Replacement Grammars Heap Abstraction Procedure Contracts Interprocedural Dataflow Analysis

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of Medical Device User Interfaces Using PVS

Formal Verification of Medical Device User Interfaces Using ...

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Masci, Paolo Zhang, Yi Jones, Paul Curzon, Paul thimbleby, Harold Queen Mary Univ London Sch Elect Engn & Comp Sci London England US FDA Ctr Device & Radiol Hlth Silver Spring MD USA Swansea Univ Future Interact Technol Lab FIT Lab Swansea W Glam Wales

ISBN: (纸本)9783642548048;9783642548031

We present a formal verification approach for detecting design issues related to user interaction, with a focus on user interface of medical devices. the approach makes a novel use of configuration diagrams proposed by Rushby to formally verify important human factors properties of user interface implementation. In particular, it first translates the software implementation of user interface into an equivalent formal specification, from which a behavioral model is constructed using theorem proving;human factors properties are then verified against the behavioral model;lastly, a comprehensive set of test inputs are produced by exploring the behavioral model, which can be used to challenge the real interface implementation and to ensure that the issues detected in the behavior model do apply to the implementation. We have prototyped the approach based on the PVS proof system, and applied it to analyze the user interface of a real medical device. the analysis detected several interaction design issues in the device, which may potentially lead to severe consequences.

关键词： software verification Medical devices User interfaces

来源：评论

学校读者我要写书评

暂无评论

One time-traveling bit is as good as logarithmically many 34

One time-traveling bit is as good as logarithmically many

引用

34th international conference on foundations of software Technology and theoretical Computer science, FSTTCS 2014

作者： O'Donnell, Ryan Say, A. C. Cem Computer Science Department Carnegie Mellon University Pittsburgh United States Department of Computer Engineering Bogaziçi University Istanbul Turkey

ISBN: (纸本)9783939897774

We consider computation in the presence of closed timelike curves (CTCs), as proposed by Deutsch. We focus on the case in which the CTCs carry classical bits (as opposed to qubits). Previously, Aaronson and Watrous showed that computation with polynomially many CTC bits is equivalent in power to PSPACE. On the other hand, Say and Yakaryilmaz showed that computation with just 1 classical CTC bit gives the power of "postselection", thereby upgrading classical randomized computation (BPP) to the complexity class BPPpath and standard quantum computation (BQP) to the complexity class PP. It is natural to ask whether increasing the number of CTC bits from 1 to 2 (or 3, 4, etc.) leads to increased computational power. We show that the answer is no: randomized computation with logarithmically many CTC bits (i.e., polynomially many CTC states) is equivalent to BPPpath. (Similarly, quantum computation augmented with logarithmically many classical CTC bits is equivalent to PP.) Spoilsports with no interest in time travel may view our results as concerning the robustness of the class BPPpath and the computational complexity of sampling from an implicitly defined Markov chain.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：