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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

179 篇 会议
36 册 图书
13 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

166 篇 工学
- 155 篇 计算机科学与技术...
- 118 篇 软件工程
- 16 篇 电气工程
- 16 篇 信息与通信工程
- 15 篇 控制科学与工程
- 5 篇 土木工程
- 3 篇 建筑学
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
75 篇 理学
- 70 篇 数学
- 8 篇 统计学（可授理学、...
- 6 篇 物理学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 化学
- 1 篇 大气科学
13 篇 管理学
- 10 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
2 篇 法学
- 2 篇 社会学
2 篇 文学
- 2 篇 新闻传播学
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学
1 篇 农学

主题

17 篇 theory of comput...
14 篇 software enginee...
13 篇 mathematical log...
13 篇 semantics
13 篇 artificial intel...
11 篇 computation by a...
10 篇 logics and meani...
10 篇 algorithm analys...
9 篇 programming lang...
9 篇 computer softwar...
8 篇 software enginee...
8 篇 model checking
8 篇 data structures
7 篇 system analysis
6 篇 data structures ...
6 篇 mathematics of c...
5 篇 computer system ...
5 篇 programming tech...
5 篇 differentiation ...
4 篇 computability an...

机构

8 篇 univ leicester d...
6 篇 univ london impe...
4 篇 max planck inst ...
4 篇 rhein westfal th...
3 篇 imperial coll lo...
3 篇 max planck inst ...
3 篇 university of tw...
3 篇 university of ox...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 rhein westfal th...
2 篇 univ bologna dip...
2 篇 fakultät für inf...
2 篇 cnrs
2 篇 cwi dept softwar...
2 篇 univ warwick dep...
2 篇 univ oxford dept...
2 篇 univ london impe...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...

作者

4 篇 pattinson dirk
3 篇 ulidowski irek
3 篇 edalat abbas
3 篇 kurz alexander
3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 heckel reiko
3 篇 phillips iain
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 hu liqiang
2 篇 busi n
2 篇 carlos martín-vi...
2 篇 yoshida nobuko
2 篇 schroeder lutz
2 篇 sagiv mooly
2 篇 noll thomas
2 篇 naoki kobayashi
2 篇 haase christoph
2 篇 katoen joost-pie...

语言

219 篇 英文
5 篇 其他
5 篇 中文

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

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

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

详细简洁

排序：

Graph Transformation - 7th international conference, ICGT 2014, Held as Part of STAF 2014, Proceedings

Graph Transformation - 7th International Conference, ICGT 20...

引用

7th international conference on Graph Transformation, ICGT 2014, Held as Part of software Technologies: Applications and foundations, STAF 2014

ISBN: (纸本)9783319091075

the proceedings contain 18 papers. the topics discussed include: verifying monadic second-order properties of graph programs;generating abstract graph-based procedure summaries for pointer programs;generating inductive predicates for symbolic execution of pointer-manipulating programs;attribute handling for generating preconditions from graph constraints;from core OCL invariants to nested graph constraints;specification and verification of graph-based model transformation properties;a static analysis of non-confluent triple graph grammars for efficient model transformation;transformation and refinement of rigid structures;reversible sesqui-pushout rewriting;on pushouts of partial maps;the subgraph isomorphism problem on a class of hyperedge replacement languages;canonical derivations with negative application conditions;and van kampen squares for graph transformation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RevVis: Visualization of structures and Properties in Reversible Circuits

RevVis: Visualization of Structures and Properties in Revers...

引用

6th international conference on Reversible computation (RC)

作者： Wille, Robert Stoppe, Jannis Schoenborn, Eleonora Datta, Kamalika Drechsler, Rolf Univ Bremen Inst Comp Sci D-28359 Bremen Germany DFKI GmbH Cyber Phys Syst D-28359 Bremen Germany Bengal Engn Dept Informat Technol Howrah India

ISBN: (纸本)9783319084947;9783319084930

the recent interest in reversible computation led to plenty of ( automatic) approaches for the design of the corresponding circuits. While this automation is desired in order to provide a proper support for the design of complex functionality, often a manual consideration and human intuition enable improvements or provide new ideas for design solutions. However, this manual interaction requires a good understanding of the structure or the properties of a reversible cascade which, with increasing circuit size, becomes harder to grasp. Visualization techniques that abstract irrelevant details and focus on intuitively displaying important structures or properties provide a solution to this problem and have already successfully been applied in other domains such as design of conventional software, hardware debugging, or Boolean satisfiability. In this work, we introduce RevVis, a graphical interface which visualizes structures and properties of reversible circuits. RevVis collects relevant data of a given reversible cascade and presents it in a simple but intuitive fashion. By this, RevVis unveils information on characteristic structures and properties of reversible circuits that could be utilized for further optimization. A case study demonstrates this by considering circuits obtained from several synthesis approaches.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Intelligent Systems and Knowledge Engineering, ISKE 2012

7th International Conference on Intelligent Systems and Know...

引用

7th international conference on Intelligent Systems and Knowledge Engineering, ISKE 2012

the proceedings contain 64 papers. the special focus in this conference is on Intelligent Systems and Knowledge Engineering. the topics include: Function set-valued information systems;neutrality in bipolar structures;multirate multisensor data fusion algorithm for state estimation with cross-correlated noises;accurate computation of fingerprint intrinsic images with PDE-based regularization;research on mental coefficient of a multi-agent negotiation model;a signed trust-based recommender approach for personalized government-to-business e-services;aspects of coordinating the bidding strategy in concurrent one-to-many negotiation;relevance in preference structures;segregation and the evolution of cooperation;a model of selecting expert in sensory evaluation;software development method based on structured management of code;a collaborative filtering recommender approach by investigating interactions of interest and trust;probabilistic composite rough set and attribute reduction;AM-FM signal modulation recognition based on the power spectrum;model-based approach for reporting system development;a time dependent model via non-local operator for image restoration;a node importance based label propagation approach for community detection;an object-oriented and aspect-oriented task management toolkit on mobile device;the heuristic methods of dynamic facility layout problem;attitude-based consensus model for heterogeneous group decision making;an application of soft computing techniques to track moving objects in video sequences;key technologies and prospects of individual combat exoskeleton;a femtocell self-configuration deployment scheme in hierarchical networks;reliability and quality in the area of statistical thinking in engineering;a novel fast approach to eye location and face geometric correction;multivariate time series prediction based on multi-output support vector regression;a first approach of a new learning strategy;expert system of ischemia classification bas

关键词：

来源：评论

学校读者我要写书评

暂无评论

JTACO: Test execution for faster bounded verification

引用

8th international conference on Tests and Proofs, TAP 2014, Held as Part of the software Technologies: Applications and foundations, STAF 2014

作者： Kampmann, Alexander Galeotti, Juan Pablo Zeller, Andreas Software Engineering Department Saarland University Saarbrücken Germany Saarbrücken Graduate School of Computer Science Saarland University Saarbrücken Germany

ISBN: (纸本)9783319090986

In bounded program verification a finite set of execution traces is exhaustively checked in order to find violations to a given specification (i.e. errors). SAT-based bounded verifiers rely on SAT-Solvers as their back-end decision procedure, accounting for most of the execution time due to their exponential time complexity. In this paper we sketch a novel approach to improve SAT-based bounded verification. As modern SAT-Solvers work by augmenting partial assignments, the key idea is to translate some of these partial assignments into JUnit test cases during the SAT-Solving process. If the execution of the generated test cases succeeds in finding an error, the SAT-Solver is promptly stopped. We implemented our approach in JTACO, an extension to the TACO bounded verifier, and evaluate our prototype by verifying parameterized unit tests of several complex data structures. © 2014 Springer international Publishing Switzerland.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Fatal Attractors in Parity Games

Fatal Attractors in Parity Games

引用

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

作者： Huth, Michael Kuo, Jim Huan-Pu Piterman, Nir Imperial Coll London Dept Comp London SW7 2AZ England Univ Leicester Dept Comp Sci Leicester LE1 7RH Leics England

ISBN: (纸本)9783642370755;9783642370748

We study a new form of attractor in parity games and use it to define solvers that run in PTIME and are partial in that they do not solve all games completely. Technically, for color c this new attractor determines whether player c%2 can reach a set of nodes X of color c whilst avoiding any nodes of color less than c. Such an attractor is fatal if player c%2 can attract all nodes in X back to X in this manner. Our partial solvers detect fixed-points of nodes based on fatal attractors and correctly classify such nodes as won by player c%2. Experimental results show that our partial solvers completely solve benchmarks that were constructed to challenge existing full solvers. Our partial solvers also have encouraging run times in practice. For one partial solver we prove that its runtime is in O(vertical bar V vertical bar(3)), that its output game is independent of the order in which attractors are computed, and that it solves all Buchi games.([1])

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：