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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

421 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

323 篇 工学
- 317 篇 计算机科学与技术...
- 154 篇 软件工程
- 43 篇 电子科学与技术（可...
- 17 篇 电气工程
- 16 篇 动力工程及工程热...
- 16 篇 信息与通信工程
- 15 篇 控制科学与工程
- 9 篇 化学工程与技术
- 9 篇 生物工程
- 5 篇 机械工程
- 5 篇 环境科学与工程（可...
- 4 篇 建筑学
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 农业工程
- 3 篇 生物医学工程（可授...
195 篇 理学
- 173 篇 数学
- 19 篇 物理学
- 14 篇 统计学（可授理学、...
- 13 篇 系统科学
- 12 篇 生物学
- 9 篇 化学
- 3 篇 地球物理学
52 篇 管理学
- 31 篇 管理科学与工程(可...
- 25 篇 工商管理
- 21 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学
3 篇 农学
- 3 篇 作物学

主题

51 篇 computer science
34 篇 formal logic
23 篇 polynomials
15 篇 logic programmin...
13 篇 graphics process...
13 篇 logic
11 篇 first-order logi...
10 篇 mathematics
9 篇 linear logic
9 篇 registers
9 篇 bandwidth
9 篇 computational mo...
8 篇 costs
8 篇 hardware
7 篇 approximation al...
7 篇 model checking
7 篇 mapreduce
7 篇 logic circuits
7 篇 algorithm design...
6 篇 parallel process...

机构

5 篇 cnrs
5 篇 rhein westfal th...
4 篇 univ warsaw wars...
3 篇 inria le chesnay
3 篇 univ oxford oxfo...
3 篇 department of co...
3 篇 institute of com...
3 篇 tech univ dresde...
3 篇 department of co...
2 篇 univ warsaw inst...
2 篇 shanghai jiao to...
2 篇 nyu ny 10003 usa
2 篇 department of co...
2 篇 comput & inf sci...
2 篇 european centre ...
2 篇 department of co...
2 篇 stanford univ ca...
2 篇 department of co...
2 篇 department of co...
2 篇 ucl england

作者

4 篇 r. kannan
4 篇 a. frieze
4 篇 tullsen dean m.
3 篇 vardi moshe y.
3 篇 sasao tsutomu
3 篇 chong frederic t...
3 篇 bojanczyk mikola...
3 篇 prasad sushil k.
3 篇 stanković radomi...
3 篇 kiefer sandra
3 篇 worrell james
3 篇 thornton mitchel...
3 篇 drechsler rolf
2 篇 raicu ioan
2 篇 kanovich max i.
2 篇 kolaitis phokion...
2 篇 moraga claudio
2 篇 j.s. vitter
2 篇 zhu michelle m.
2 篇 kim hyesoon

语言

423 篇 英文

检索条件"任意字段=Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science"

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

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

详细简洁

排序：

Adding an Equivalence Relation to the Interval logic ABB: Complexity and Expressiveness 13

Adding an Equivalence Relation to the Interval Logic ABB: Co...

引用

2013 28th annual acm/ieee symposium on logic in computer science, LICS 2013

作者： Montanari, Angelo Sala, Pietro Department of Mathematics and Computer Science University of Udine Italy Department of Pharmacology University of Verona Italy

ISBN: (纸本)9780769550206

Interval temporal logics provide a general frame-work for temporal representation and reasoning, where classical (point-based) linear temporal logics can be recovered as special cases. In this paper, we study the effects of the addition of an equivalence relation ~ to one of the most representative interval temporal logics, namely, the logic ¯ of Allen's relations meets, begun by, and begins. We first prove that the satisfiability problem for the resulting logic ¯ ~ remains decidable over finite linear orders, but it becomes nonprimitive recursive, while decidability is lost over N. We also show that decidability over N can be recovered by restricting to a suitable subset of models. then, we show that ¯ ~ is expressive enough to define -regular languages, thus establishing a promising connection between interval temporal logics and extended regular languages. © 2013 ieee.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Smooth approximations and CSPs over finitely bounded homogeneous structures 22

Smooth approximations and CSPs over finitely bounded homogen...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Mottet, Antoine Pinsker, Michael Tu Hamburg Institute for Theoretical Computer Science Hamburg Germany Tu Wien Institute of Discrete Mathematics and Geometry Vienna Austria

ISBN: (纸本)9781450393515

We introduce the novel machinery of smooth approximations, and apply it to confrm the CSP dichotomy conjecture for frst-order reducts of the random tournament, and to give new short proofs of the conjecture for various homogeneous graphs including the random graph (STOC'11, ICALP'16), and for expansions of the order of the rationals (STOC'08). Apart from obtaining these dichotomy results, we show how our new proof technique allows to unify and signifcantly simplify the previous results from the literature. For all but the last structure, we moreover characterize for the frst time those CSPs which are solvable by local consistency methods, again using the same machinery. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

Hardware and binary modification support for code pointer protection from buffer overflow 37

Hardware and binary modification support for code pointer pr...

引用

37th annual International symposium on Microarchitecture

作者： Tuck, N Calder, B Varghese, G Univ Calif San Diego Dept Comp Sci & Engn San Diego CA 92103 USA

ISBN: (纸本)0769521266

Buffer overflow vulnerabilities are currently the most prevalent security vulnerability;they are responsible for over half of the CERT advisories issued in the last three years. Since many attacks exploit buffer overflow vulnerabilities, techniques that prevent buffer overflow attacks would greatly increase the difficulty of writing a new worm. this paper examines both software and hardware solutions for protecting code pointers from buffer overflow attacks. We first evaluate the performance overhead of the existing Point-Guard software solution for protecting code pointers, and show that it can be applied using binary modification to protect return pointers on the stack. these software techniques guard against write attacks, but not read attacks, where an attacker is attempting to gain information about the pointer protection mechanism in order to later mount a write buffer attack. To address this, we examine encryption hardware to provide security for code pointers from read and write attacks. In addition, we show that pure software solutions can degrade program performance, and the light-weight encryption hardware techniques we examine can be used to provide protection with little performance overhead.

关键词： Hardware Protection Buffer overflow Software performance Cryptography Costs computer science computer security Writing computer worms

来源：评论

学校读者我要写书评

暂无评论

On Computability of logical Approaches to Branching-Time Property Verification of Programs 20

On Computability of Logical Approaches to Branching-Time Pro...

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Tsukada, Takeshi Univ Tokyo Tokyo Japan

ISBN: (纸本)9781450371049

this paper studies the hardness of branching-time property verification of Turing-complete programming languages, as well as logical approaches to the verification problem. As these approaches reduce the verification problem to logical problems, e.g. the satisfiability problem of Horn clauses with certain extensions, it is natural to ask whether the logical problems are as hard as the verification problem or strictly harder. this paper reveals that logical problems used in most approaches are far more difficult than the verification problem;the only exception is the validity problem of first-order arithmetic with fixed-point operators. We also answers some other natural questions, for example, whether the extensions of Horn clauses are necessarily.

关键词： program verification branching-time property computability fixed-point logic constrained Horn clause analytical hierarchy

来源：评论

学校读者我要写书评

暂无评论

First order complexity of finite random structures 24

First order complexity of finite random structures

引用

39th annual acm/ieee symposium on logic in computer science (LICS)

作者： Demin, Danila Zhukovskii, Maksim Moscow Inst Phys & Technol Dolgoprudnyi Russia St Petersburg Univ St Petersburg Russia Univ Sheffield Sheffield S Yorkshire England

ISBN: (纸本)9798400706608

For a sequence of random structures with n-element domains over a relational signature, we define its FO complexity as a certain subset in the Banach space l infinity/c(0). the well-known FO zero-one law and FO convergence law correspond to FO complexities equal to {0, 1} and a subset of R, respectively. We present a hierarchy of FO complexity classes, introduce a stochastic FO reduction that allows to transfer complexity results between different random structures, and deduce using this tool several new logical limit laws for binomial random structures. Finally, we introduce a conditional distribution on graphs, subject to a FO sentence f, that generalises certain well-known random graph models, show instances of this distribution for every complexity class, and prove that the set of all f validating 0-1 law is not recursively enumerable.

关键词： random structures first order logic logical limit laws zero-one laws random graphs logical complexity recursively enumerable languages

来源：评论

学校读者我要写书评

暂无评论

A Nominal Approach to Probabilistic Separation logic 24

A Nominal Approach to Probabilistic Separation Logic

引用

39th annual acm/ieee symposium on logic in computer science (LICS)

作者： Li, John M. Aytac, Jon Johnson-Freyd, Philip Ahmed, Amal Holtzen, Steven Northeastern Univ Boston MA 02115 USA Sandia Natl Labs Livermore CA USA

ISBN: (纸本)9798400706608

Currently, there is a gap between the tools used by probability theorists and those used in formal reasoning about probabilistic programs. On the one hand, a probability theorist decomposes probabilistic state along the simple and natural product of probability spaces. On the other hand, recently developed probabilistic separation logics decompose state via relatively unfamiliar measure-theoretic constructions for computing unions of sigma-algebras and probability measures. We bridge the gap between these two perspectives by showing that these two methods of decomposition are equivalent up to a suitable equivalence of categories. Our main result is a probabilistic analog of the classic equivalence between the category of nominal sets and the Schanuel topos. through this equivalence, we validate design decisions in prior work on probabilistic separation logic and create new connections to nominal-setlike models of probability.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Modal Intuitionistic logics as Dialgebraic logics 20

Modal Intuitionistic Logics as Dialgebraic Logics

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： de Groot, Jim Pattinson, Dirk Australian Natl Univ Coll Engn & Comp Sci Canberra ACT Australia

ISBN: (纸本)9781450371049

Duality is one of the key techniques in the categorical treatment of modal logics. From the duality between (modal) algebras and (descriptive) frames one derives e.g. completeness (via a syntactic characterisation of algebras) or definability (using a suitable version of the Goldblatt-thomason theorem). this is by now well understood for classical modal logics and modal logics based on distributive lattices, via extensions of Stone and Priestley duality, respectively. What is conspicuously absent is a comprehensive treatment of modal intuitionistic logic. this is the gap we are closing in this paper. Our main conceptual insight is that modal intuitionistic logics do not appear as algebra/coalgebra dualities, but instead arise naturally as dialgebras. Our technical contribution is the development of dualities for dialgebras, together with their logics, that instantiate to large class of modal intuitionistic logics and their frames as special cases. We derive completeness and expressiveness results in this general case. For modal intuitionistic logic, this systematises the existing treatment in the literature.

关键词： modal logic coalgebraic logic dialgebras

来源：评论

学校读者我要写书评

暂无评论

Local Temporal Reasoning 14

Local Temporal Reasoning

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Koskinen, Eric Terauchi, Tachio NYU New York NY 10003 USA Japan Adv Inst Sci & Technol Nomi Japan

ISBN: (纸本)9781450328869

We present the first method for reasoning about temporal logic properties of higher-order, infinite-data programs. By distinguishing between the finite traces and infinite traces in the specification, we obtain rules that permit us to reason about the temporal behavior of program parts via a type-and-effect system, which is then able to compose these facts together to prove the overall target property of the program. the type system alone is strong enough to derive many temporal safety properties using refinement types and temporal effects. We also show how existing techniques can be used as oracles to provide liveness information (e.g. termination) about program parts and that the type-and-effect system can combine this information with temporal safety information to derive nontrivial temporal properties. Our work has application toward verification of higher-order software, as well as modular strategies for procedural programs.

关键词： Higher-order programs formal verification temporal logic program analysis model checking

来源：评论

学校读者我要写书评

暂无评论

A Decision Procedure for Satisfiability in Separation logic with Inductive Predicates 14

A Decision Procedure for Satisfiability in Separation Logic ...

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Brotherston, James Fuhs, Carsten Perez, Juan A. Navarro Gorogiannis, Nikos UCL London England Middlesex Univ London London England

ISBN: (纸本)9781450328869

We show that the satisfiability problem for the "symbolic heap" fragment of separation logic with general inductively defined predicates- which includes most fragments employed in program verification - is decidable. Our decision procedure is based on the computation of a certain fixed point from the definition of an inductive predicate, called its "base", that exactly characterises its satisfiability. A complexity analysis of our decision procedure shows that it runs, in the worst case, in exponential time. In fact, we show that the satisfiability problem for our inductive predicates is EXPTIME-complete, and becomes NP-complete when the maximum arity over all predicates is bounded by a constant. Finally, we provide an implementation of our decision procedure, and analyse its performance both on a synthetically generated set of test formulas, and on a second test set harvested from the separation logic literature. For the large majority of these test cases, our tool reports times in the low milliseconds.

关键词： separation logic inductive predicates satisfiability decision procedure

来源：评论

学校读者我要写书评

暂无评论

Semantics of normal logic programs and contested information

Semantics of normal logic programs and contested information

引用

11th annual ieee symposium on logic in computer science (LIVS 96)

作者： Pradhan, S UNIV MARYLAND DEPT COMP SCICOLLEGE PKMD 20742

ISBN: (纸本)0780336542

We propose C4, a four-valued semantics for normal, logic programs. Using this semantics, we define two types of entailment: strong and weak. We show that a normal, logic program strongly entails a sentence under C4 if, and only if, the program entails that sentence under the well founded semantics and it weakly entails a sentence if, and only if, the program entails that sentence under the two-valued stable model semantics in case the program has any stable models. We argue that this shows that the difference between the well founded semantics and the stable model semantics can be characterized in terms of their attitude to what we call contested information. We use this insight to propose a general theory of contested reasoning.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：