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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,407 篇 会议
49 篇 期刊文献
33 册 图书

馆藏范围

1,487 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

1,114 篇 工学
- 853 篇 计算机科学与技术...
- 501 篇 软件工程
- 120 篇 电气工程
- 112 篇 控制科学与工程
- 83 篇 土木工程
- 77 篇 机械工程
- 74 篇 建筑学
- 67 篇 信息与通信工程
- 42 篇 动力工程及工程热...
- 41 篇 安全科学与工程
- 39 篇 材料科学与工程（可...
- 35 篇 仪器科学与技术
- 33 篇 交通运输工程
- 31 篇 化学工程与技术
- 31 篇 石油与天然气工程
- 29 篇 水利工程
- 23 篇 力学（可授工学、理...
- 22 篇 电子科学与技术（可...
- 22 篇 生物医学工程（可授...
316 篇 理学
- 194 篇 数学
- 63 篇 系统科学
- 55 篇 统计学（可授理学、...
- 43 篇 物理学
- 38 篇 化学
- 30 篇 生物学
198 篇 管理学
- 143 篇 管理科学与工程(可...
- 81 篇 工商管理
- 71 篇 图书情报与档案管...
35 篇 经济学
- 35 篇 应用经济学
28 篇 医学
26 篇 法学
- 24 篇 社会学
23 篇 教育学
9 篇 文学
7 篇 农学
3 篇 艺术学
2 篇 军事学

主题

60 篇 model checking
42 篇 tools
28 篇 static analysis
27 篇 data mining
24 篇 algorithm design...
23 篇 analytical model...
21 篇 stochastic syste...
20 篇 software enginee...
19 篇 artificial intel...
18 篇 semantics
17 篇 real time system...
17 篇 visualization
16 篇 hybrid systems
15 篇 computer archite...
15 篇 big data
15 篇 feature extracti...
15 篇 hardware
15 篇 mathematical mod...
14 篇 machine learning
14 篇 software

机构

12 篇 ludwig maximilia...
7 篇 univ illinois ur...
7 篇 univ twente form...
7 篇 univ penn philad...
6 篇 tech univ munich...
4 篇 verimag ctr equa...
4 篇 rhein westfal th...
4 篇 natl aerosp univ...
4 篇 department of co...
4 篇 suny stony brook...
3 篇 saarland univ sa...
3 篇 university of wa...
3 篇 vienna universit...
3 篇 univ colorado bo...
3 篇 university colle...
3 篇 rwth aachen univ...
3 篇 carnegie mellon ...
3 篇 chinese acad sci...
3 篇 univ oxford dept...
3 篇 iowa state univ ...

作者

13 篇 beyer dirk
8 篇 parker david
8 篇 katoen joost-pie...
8 篇 kwiatkowska mart...
6 篇 hermanns holger
6 篇 yi w
5 篇 majumdar rupak
5 篇 podelski andreas
5 篇 van de pol jaco
5 篇 alur rajeev
5 篇 pettersson p
5 篇 norman gethin
4 篇 behrmann gerd
4 篇 kroening daniel
4 篇 neele thomas
4 篇 bozga marius
4 篇 abdulla parosh a...
4 篇 mateescu radu
4 篇 sharygina natash...
4 篇 groote jan friso

语言

1,443 篇 英文
23 篇 其他
14 篇 德文
7 篇 中文
2 篇 俄文

检索条件"任意字段=12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems"

共 1489 条记录，以下是21-30 订阅

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

详细简洁

排序：

Formal Methods in Requirements Engineering: Survey and Future Directions 12

Formal Methods in Requirements Engineering: Survey and Futur...

引用

IEEE/ACM 12th international conference on Formal Methods in Software Engineering (FormaliSE)

作者： Lorch, Robert Meng, Baoluo Siu, Kit Moitra, Abha Durling, Michael Paul, Saswata Varanasi, Sarat Chandra McMillan, Craig GE Aerosp Res Niskayuna NY 12309 USA GE Aerosp Evendale OH USA

ISBN: (纸本)9798400705892

Requirements engineering plays a pivotal role in the development of safety-critical systems. However, the process is usually a manual one and can lead to errors and inconsistencies in the requirements that are not easily detectable. Formal methods are mathematically rigorous techniques that can aid engineers to detect errors and produce consistent and correct requirements. We survey a variety of requirements capture and analysis tools presented in the literature. Specifically, we focus on tools that incorporate formal methods techniques into their analyses. We discuss the various tools' strengths and weaknesses, identify current trends in requirements engineering research, and highlight open research questions.

关键词： Requirements Engineering Requirements analysis Formal Methods

来源：评论

学校读者我要写书评

暂无评论

On-the-Fly Algorithm for Reachability in Parametric Timed Games 30th

On-The-Fly Algorithm for Reachability in Parametric Timed Ga...

引用

30th international conference on tools and algorithms for the construction and analysis of systems (TACAS) Held as Part of the 27th European Joint conferences on theory and Practice of Software (ETAPS)

作者： Dahlsen-Jensen, Mikael Bisgaard Fievet, Baptiste Petrucci, Laure van de Pol, Jaco Aarhus Univ Aarhus Denmark Univ Sorbonne Paris Nord CNRS UMR 7030 LIPN Villetaneuse France

ISBN: (纸本)9783031572555;9783031572562

Parametric Timed Games (PTG) are an extension of the model of Timed Automata. they allow for the verification and synthesis of real-time systems, reactive to their environment and depending on adjustable parameters. Given a PTG and a reachability objective, we synthesize the values of the parameters such that the game is winning for the controller. We adapt and implement the On-the-Fly algorithm for parameter synthesis for PTG. Several pruning heuristics are introduced, to improve termination and speed of the algorithm. We evaluate the feasibility of parameter synthesis for PTG on two large case studies. Finally, we investigate the correctness guarantee of the algorithm: though the problem is undecidable, our semi-algorithm produces all correct parameter valuations "in the limit".

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

JPF: From 2003 to 2023 30th

JPF: From 2003 to 2023

引用

作者： Artho, Cyrille Parizek, Pavel Qu, Daohan Galgali, Varadraj Yi, Pu (Luke) KTH Royal Inst Technol Stockholm Sweden Charles Univ Prague Prague Czech Republic Nanjing Univ Nanjing Peoples R China Stanford Univ Stanford CA USA

ISBN: (纸本)9783031572487;9783031572494

We give an account of JPF's current architecture as it has evolved over the last 20 years. Key changes include a modular, extensible design, and Java 11 support. Java 11 brought with it fundamental changes in the language and its runtime, in particular, a new modular library system, different compilation of string expressions to bootstrap methods, and changes in many internal interfaces that allow access to the loaded code and the virtual machine state. these changes required numerous adaptations in JPF to ensure a successful compilation and correct behavior under Java 11.

关键词： JPF Java Software model checking Program analysis

来源：评论

学校读者我要写书评

暂无评论

Dissipative quadratizations of polynomial ODE systems 30th

Dissipative quadratizations of polynomial ODE systems

引用

作者： Cai, Yubo Pogudin, Gleb Inst Polytech Paris Ecole Polytech Palaiseau France Inst Polytech Paris Ecole Polytech CNRS LIX Palaiseau France

ISBN: (纸本)9783031572487;9783031572494

Quadratization refers to a transformation of an arbitrary system of polynomial ordinary differential equations to a system with at most quadratic right-hand side. Such a transformation unveils new variables and model structures that facilitate model analysis, simulation, and control and offer a convenient parameterization for data-driven approaches. Quadratization techniques have found applications in diverse fields, including systems theory, fluid mechanics, chemical reaction modeling, and mathematical analysis. In this study, we focus on quadratizations that preserve the stability properties of the original model, specifically dissipativity at given equilibria. this preservation is desirable in many applications of quadratization including reachability analysis and synthetic biology. We establish the existence of dissipativity-preserving quadratizations, develop an algorithm for their computation, and demonstrate it in several case studies.

关键词： differential equations quadratization stability variable transformation

来源：评论

学校读者我要写书评

暂无评论

Mopsa-C: Improved Verification for C Programs, Simple Validation of Correctness Witnesses (Competition Contribution) 30th

Mopsa-C: Improved Verification for C Programs, Simple Valida...

引用

作者： Monat, Raphael Milanese, Marco Parolini, Francesco Boillot, Jerome Ouadjaout, Abdelraouf Mine, Antoine Univ Lille INRIA CNRS Cent LilleUMR 9189CRIStAL F-59000 Lille France Sorbonne Univ LIP6 F-75005 Paris France Univ PSL Ecole Normale Super F-75005 Paris France

ISBN: (纸本)9783031572555;9783031572562

We present advances we brought to Mopsa for SV-Comp 2024. We significantly improved the precision of our verifier in the presence of dynamic memory allocation, library calls such as memset, goto-based loops, and integer abstractions. We introduced a witness validator for correctness witnesses. thanks to these improvements, Mopsa won SV-Comp's Softwaresystems category by a large margin, scoring 2.5 times more points than the silver medalist, Bubaak-SpLit.

关键词： Static analysis Abstract Interpretation Competition on Software Verification SV-Comp

来源：评论

学校读者我要写书评

暂无评论

RANDOM SPARSE LIFTS: construction, analysis AND CONVERGENCE OF FINITE SPARSE NETWORKS 12

RANDOM SPARSE LIFTS: CONSTRUCTION, ANALYSIS AND CONVERGENCE ...

引用

12th international conference on Learning Representations, ICLR 2024

作者： Robin, David A.R. Scaman, Kevin Lelarge, Marc INRIA ENS Paris PSL Research University France

We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global optimality of non-convex optimization, this new form of convergence, and the techniques introduced to prove such convergence, pave the way for a usable deep learning convergence theory in the near future, without overparameterization assumptions relating the number of parameters and training samples. We define these architectures from a simple computation graph and a mechanism to lift it, thus increasing the number of parameters, generalizing the idea of increasing the widths of multi-layer perceptrons. We show that architectures similar to most common deep learning models are present in this class, obtained by sparsifying the weight tensors of usual architectures at initialization. Leveraging tools of algebraic topology and random graph theory, we use the computation graph's geometry to propagate properties guaranteeing convergence to any precision for these large sparse models. © 2024 12th international conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

SootUp: A Redesign of the Soot Static analysis Framework 30th

SootUp: A Redesign of the Soot Static Analysis Framework

引用

作者： Karakaya, Kadiray Schott, Stefan Klauke, Jonas Bodden, Eric Schmidt, Markus Luo, Linghui He, Dongjie Paderborn Univ Heinz Nixdorf Inst Paderborn Germany Fraunhofer IEM Paderborn Germany Amazon Web Serv Berlin Germany Chongqing Univ Chongqing Peoples R China

ISBN: (纸本)9783031572456;9783031572463

Since its inception two decades ago, SOOT has become one of the most widely used open-source static analysis frameworks. Over time it has been extended with the contributions of countless researchers. Yet, at the same time, the requirements for SOOT have changed over the years and become increasingly at odds with some of the major design decisions that underlie it. In this work, we thus present SooTUP, a complete reimplementation of SOOT that seeks to fulfill these requirements with a novel design, while at the same time keeping elements that SOOT users have grown accustomed to.

关键词： Static program analysis Soot SootUp

来源：评论

学校读者我要写书评

暂无评论

Knor: reactive synthesis using Oink 30th

Knor: reactive synthesis using Oink

引用

作者： van Dijk, Tom van Abbema, Feije Tomov, Naum Univ Twente Formal Methods & Tools Enschede Netherlands

ISBN: (纸本)9783031572456;9783031572463

We present an innovative approach to the reactive synthesis of parity automaton specifications, which plays a pivotal role in the synthesis of linear temporal logic. We find that our method efficiently solves the SYNTCOMP synthesis competition benchmarks for parity automata from LTL specifications, solving all 288 models in under a minute. We therefore direct our attention to optimizing the circuit size and propose several methods to reduce the size of the constructed circuits: (1) leveraging different parity game solvers, (2) applying bisimulation minimisation to the winning strategy, (3) using alternative encodings from the strategy to an and-inverter graph, (4) integrating post-processing with the ABC tool. We implement these methods in the Knor tool, which has secured us multiple victories in the PGAME track of the SYNTCOMP competition.

关键词： Reactive synthesis Parity games Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

24th international conference on tools and algorithms for the construction and analysis of systems, TACAS 2018 Held as Part of the European Joint conferences on theory and Practice of Software, ETAPS 2018

24th International Conference on Tools and Algorithms for th...

引用

24th international conference on tools and algorithms for the construction and analysis of systems, TACAS 2018 Held as Part of the European Joint conferences on theory and Practice of Software, ETAPS 2018

ISBN: (纸本)9783319899596

the proceedings contain 54 papers. the special focus in this conference is on. the topics include: A verified implementation of the bounded list container;automating deductive verification for weak-memory programs;property checking array programs using loop shrinking;invariant synthesis for incomplete verification engines;accelerating syntax-guided invariant synthesis;daisy - framework for analysis and optimization of numerical programs (tool paper);oink: An implementation and evaluation of modern parity game solvers;More scalable LTL model checking via discovering design-space dependencies (D3);Generation of minimum tree-like witnesses for existential CTL;from natural projection to partial model checking and back;efficient verification of imperative programs using auto2;ICE-based refinement type discovery for higher-order functional programs;strategy representation by decision trees in reactive synthesis;feature-guided black-box safety testing of deep neural networks;frame inference for inductive entailment proofs in separation logic;verified model checking of timed automata;chain reduction for binary and zero-suppressed decision diagrams;CDCLSym: Introducing effective symmetry breaking in SAT solving;automatic generation of precise and useful commutativity conditions;bit-vector model counting using statistical estimation;hoare logics for time bounds: A study in meta theory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

24th International Conference on Tools and Algorithms for th...

引用

ISBN: (纸本)9783319899626

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：