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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

45 篇 会议
6 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

33 篇 工学
- 31 篇 计算机科学与技术...
- 29 篇 软件工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 电子科学与技术（可...
6 篇 理学
- 6 篇 数学
3 篇 管理学
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学

主题

6 篇 programming lang...
5 篇 software enginee...
4 篇 computer program...
4 篇 functional progr...
3 篇 object oriented ...
3 篇 programming prof...
3 篇 computer languag...
3 篇 programming tech...
3 篇 artificial intel...
3 篇 logics and meani...
2 篇 computer science
2 篇 message passing
2 篇 database systems
2 篇 theory of comput...
2 篇 programming
2 篇 java
2 篇 computational mo...
2 篇 natural language...
2 篇 protocols
2 篇 specification la...

机构

1 篇 inria
1 篇 institute of ele...
1 篇 computer science...
1 篇 univ copenhagen ...
1 篇 technische unive...
1 篇 roskilde univ ro...
1 篇 univ paris 11 cn...
1 篇 coordinated scie...
1 篇 univ porto dcc f...
1 篇 oak ridge natl l...
1 篇 inria rocquencou...
1 篇 univ of edinburg...
1 篇 section digital ...
1 篇 systems group et...
1 篇 univ oxford oxfo...
1 篇 computer science...
1 篇 univ potsdam pot...
1 篇 tu wien austria
1 篇 delft univ techn...
1 篇 radboud univ nij...

作者

2 篇 dagand pierre-ev...
1 篇 kistijantoro ach...
1 篇 vizzotto juliana...
1 篇 kozen dexter
1 篇 harrison robert ...
1 篇 bill roscoe
1 篇 c. gregoire
1 篇 thier patrick
1 篇 h.h. rubinovitz
1 篇 pierce benjamin
1 篇 andrius armonas
1 篇 morelli ralph
1 篇 beyer dirk
1 篇 remy didier
1 篇 holzer andreas
1 篇 eide eric
1 篇 michael c. loui
1 篇 little mark c.
1 篇 brendan mahony
1 篇 leao j.l.s.

语言

53 篇 英文

检索条件"任意字段=22nd Asian Symposium on Programming Languages and Systems"

共 53 条记录，以下是31-40 订阅

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

详细简洁

排序：

AsynCRFJ: An asynchronous approach to reactive object-oriented programming 18

AsynCRFJ: An asynchronous approach to reactive object-orient...

引用

22nd Brazilian symposium on programming languages, SBLP 2018

作者： Cardoso, Diogo J. Vizzotto, Juliana K. Piveta, Eduardo K. Federal University of Santa Maria Brazil

ISBN: (纸本)9781450364805

While the object-orientation is the most used paradigm for developing general purpose software systems, the use of reactive systems has been growing lately. One of the differences between them is that while the first offers an imperative style, the latter focuses on a functional style. In this paper, we present the semantics for AsyncRFJ, an object-oriented language based on Featherweight Java, created to reason and to develop programs handling reactive data flow in the context of object-oriented programming. Additionally, we provide an interpreter for the proposed semantics and a set of examples designed to illustrate the language. © 2018 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

programming languages and systems 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Matthias Felleisen Philippa Gardner

ISBN: (数字)9783642370366

ISBN: (纸本)9783642370359

This book constitutes the refereed proceedings of the 22nd European symposium on programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013. The 31 papers, presented together with a full-length invited talk, were carefully reviewed and selected from 120 full submissions. The contributions have been organized according to ten topical sections on programming techniques; programming tools; separation logic; gradual typing; shared-memory concurrency and verification; process calculi; taming concurrency; model checking and verification; weak-memory concurrency and verification; and types, inference, and analysis.

关键词： Software Engineering programming languages, Compilers, Interpreters programming Techniques Logics and Meanings of Programs

来源：评论

学校读者我要写书评

暂无评论

Structural decidable extensions of bounded quantification 95

Structural decidable extensions of bounded quantification

引用

22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL'95

作者： Vorobyov, Sergei G. Max-Planck-Inst fuer Informatik Saarbruecken Germany

ISBN: (纸本)9780897916929

We show how the subtype relation of the well-known system F≤, the second-order polymorphic λ-calculus with bounded universal type quantification and subtyping, due to Cardelli, Wegner, Bruce, Longo, Curien, Ghelli [6, 2, 8], proved undecidable by Pierce [12], can be interpreted in the (weak) monadic second-order theory of one (Buechi), two (Rabin), several, or infinitely many successor functions [13, 14]. These (W)SnS-interpretations show that the undecidable system F≤ possesses consistent decidable extensions, i.e., F≤ is not essentially undecidable (Tarski et. al., 1949, [17]). We demonstrate an infinite class of 'structural' decidable extensions of F≤, which combine traditional subtype inference rules with the above (W)SnS-interpretations. All these extensions, which we call systems F≤SnS, are still more powerful than F≤, but less coarse than the direct (W)SnS-interpretations: F≤ ⊂ F≤SnS ⊂ (W)SnS-interpretations The main distinctive features of the systems F≤SnS are: 1) decidability, 2) closure w.r.t. transitivity;3) structuredness, e.g., they never subtype a functional type to a universal one or vice versa, 4) they all contain the powerful rule for subtyping boundedly quantified types: Γ qq τ1 ≤ σ1 Γ, α ≤ τ1 qq σ2 ≤ τ2÷Γ qq (qqα ≤ σ1 · σ2) ≤ (qqα ≤ τ1 · τ2) (All)

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

22nd International symposium on Mathematical Foundations of Computer Science 1997, MFCS 1997

引用

22nd International symposium on Mathematical Foundations of Computer Science, MFCS 1997

ISBN: (纸本)3540634371

The proceedings contain 51 papers. The special focus in this conference is on Mathematical Foundations of Computer Science. The topics include: Game semantics for programming languages;communication complexity;algorithmic techniques and results;positive applications of lattices to cryptography;a tile-based coordination view of asynchronous pi-calculus;communication complexity and sequential computation;lower bounds for a proof system with an exponential speed-up over constant-depth frege systems and over polynomial calculus;computational limitations of stochastic turing machines and arthur-merlin games with small space bounds;learning to perform knowledge-intensive inferences;resolution proofs, exponential bounds, and kolmogorov complexity;the expressiveness of datalog circuits DAC;the complexity of policy evaluation for finite-horizon partially-observable markov decision processes;a category of transition systems and its relations with orthomodular posets;accepting zeno words without time stand still;complexity theoretical results on partitioned nondeterministic binary decision diagrams;specifying computations using hyper transition systems;subtyping calculus of construction;distances between languages and reflexivity of relations;partial characterization of synchronization languages;integrating the specification techniques of graph transformation and temporal logic;on the generation of trees by hyperedge replacement;regulation by valences;simulation as a correct transformation of rewrite systems;on the dilation of interval routing;relating conflict-free stable transition and event models;the giant component threshold for random regular graphs with edge faults;a topological generalization o f propositional linear time temporal logic and complexity of finding short resolution proofs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

State based language for discrete control and the verification of its programs

State based language for discrete control and the verificati...

引用

IEEE International symposium on Circuits and systems 1989, the 22nd ISCAS. Part 1

作者： Leao, J.L.S. Fialho, S.V. Pedroza, A.C.P. PEE-COPPE/Fed Univ of Rio de Janeiro Rio de Janeiro Braz

The CRIS language and a related temporal logic proof scheme are presented. The CRIS language, based on an extended finite-state machine model, is applied to the formal specification and implementation of logic control problems and to discrete event control in general. The associated temporal logic framework allows the verification of properties of programs written in CRIS. An example, the control of a jacketed reactor, is presented, which shows the applicability of CRIS language for logic control problems and its related temporal logic framework as a tool for proving program properties.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

DOAS: An object oriented architecture supporting secure languages 22

DOAS: An object oriented architecture supporting secure lang...

引用

22nd Annual Workshop on Microprogramming and Microarchitecture, MICRO 1989

作者： Van De Goor, A.J. Corporaal, H. Section Digital Systems and Computer Architecture Faculty of Electrical Engineering Delft University of Technology Mekelweg 4 P.O. Box 5031 Delft2600 AG Netherlands

ISBN: (纸本)0897913248

Current software engineering practice heavily relies on the reliability of software implementation languages and underlying architectures. However, both the currently used languages, as well as the traditional architectures suffer from a shortage of built-in security. In this paper, an architecture is presented, which is heavily influenced by two properties of secure languages: coercion and exception handling. It is shown that proper design decisions lead to an architecture having a compact data representation, allowing both generic and nongeneric instructions. The architecture is object oriented, and object addressing is under control of the operand stream, with optimalisation possibilities to bypass descriptor inspection. © 1990 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Information Reuse for Multi-goal Reachability Analyses

Information Reuse for Multi-goal Reachability Analyses

引用

22nd European symposium on programming (ESOP)

作者： Beyer, Dirk Holzer, Andreas Tautschnig, Michael Veith, Helmut Univ Passau Passau Germany Vienna Univ Technol Vienna Austria Univ Oxford Oxford England Queen Mary Univ London London England

ISBN: (纸本)9783642370366

It is known that model checkers can generate test inputs as witnesses for reachability specifications (or, equivalently, as counterexamples for safety properties). While this use of model checkers for testing yields a theoretically sound test-generation procedure, it scales poorly for computing complex test suites for large sets of test goals, because each test goal requires an expensive run of the model checker. We represent test goals as automata and exploit relations between automata in order to reuse existing reachability information for the analysis of subsequent test goals. Exploiting the sharing of sub-automata in a series of reachability queries, we achieve considerable performance improvements over the standard approach. We show the practical use of our multi-goal reachability analysis in a predicate-abstraction-based test-input generator for the test-specification language FQL.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

22nd International symposium on Static Analysis, SAS 2015

22nd International Symposium on Static Analysis, SAS 2015

引用

22nd International Static Analysis symposium, SAS 2015

ISBN: (纸本)9783662482872

The proceedings contain 18 papers. The special focus in this conference is on Static Analysis. The topics include: Static analysis of non-interference in expressive low-level languages;static analysis with set-closure in secrecy;a binary decision tree abstract domain functor;precise data flow analysis in the presence of correlated method calls;may-happen-in-parallel analysis for asynchronous programs with inter-procedural synchronization;shape analysis for unstructured sharing;synthesizing heap manipulations via integer linear programming;effective soundness-guided reflection analysis;a type system for javascript with fixed object layout;refinement type inference via horn constraint optimization;a simple abstraction of arrays and maps by program translation;property-based polynomial invariant generation using sums-of-squares optimization;a case study on the correspondence between top-down and bottom-up analysis;parallel cost analysis of distributed systems;a forward analysis for recurrent sets and unbounded-time analysis of guarded LTI systems with inputs by abstract acceleration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Positive subtyping 95

Positive subtyping

引用

22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL'95

作者： Hofmann, Martin Pierce, Benjamin Univ of Edinburgh Edinburgh United Kingdom

ISBN: (纸本)9780897916929

The statement S ≤ T in a λ-calculus with subtyping is traditionally interpreted by a semantic coercion function of type qqSqq → qqTqq that extracts the 'T part' of an element of S. If the subtyping relation is restricted to covariant positions, this interpretation may be enriched to include both the implicit coercion and an overwriting function put[S,T] Ε qqSqq → qqTqq → qqSqq that updates the T part of an element of S. We give a realizability model and a sound equational theory for a second-order calculus of positive subtyping. Though weaker than familiar calculi of bounded quantification, positive subtyping retains sufficient power to model objects, encapsulation, and message passing. Moreover, inheritance may be implemented very straightforwardly in this setting, using the put functions arising from ordinary subtyping of records in place of the sophisticated systems of record extension and update often used for this purpose. The equational laws relating the behavior of coercions and put functions can be used to prove simple properties of the resulting classes in such a way that proofs for superclasses are 'inherited' by subclasses.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Exploiting Database Management systems and Treewidth for Counting 22nd

Exploiting Database Management Systems and Treewidth for Cou...

引用

22nd International symposium on Practical Aspects of Declarative languages (PADL)

作者： Fichte, Johannes K. Hecher, Markus Thier, Patrick Woltran, Stefan Tech Univ Dresden Dresden Germany TU Wien Vienna Austria Univ Potsdam Potsdam Germany

ISBN: (纸本)9783030391973;9783030391966

Bounded treewidth is one of the most cited combinatorial invariants, which was applied in the literature for solving several counting problems efficiently. A canonical counting problem is #Sat, which asks to count the satisfying assignments of a Boolean formula. Recent work shows that benchmarking instances for #Sat often have reasonably small treewidth. This paper deals with counting problems for instances of small treewidth. We introduce a general framework to solve counting questions based on state-of-the-art database management systems (DBMS). Our framework takes explicitly advantage of small treewidth by solving instances using dynamic programming (DP) on tree decompositions (TD). Therefore, we implement the concept of DP into a DBMS (PostgreSQL), since DP algorithms are already often given in terms of table manipulations in theory. This allows for elegant specifications of DP algorithms and the use of SQL to manipulate records and tables, which gives us a natural approach to bring DP algorithms into practice. To the best of our knowledge, we present the first approach to employ a DBMS for algorithms on TDs. A key advantage of our approach is that DBMS naturally allow to deal with huge tables with a limited amount of main memory (RAM), parallelization, as well as suspending computation.

关键词： Dynamic programming Parameterized algorithmics Bounded treewidth Database systems SQL Relational algebra Counting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：