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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

280 篇 会议
40 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

275 篇 工学
- 269 篇 软件工程
- 141 篇 计算机科学与技术...
- 7 篇 电气工程
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
- 1 篇 生物工程
12 篇 理学
- 10 篇 数学
- 1 篇 化学
- 1 篇 地质学
- 1 篇 生物学
- 1 篇 系统科学
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
3 篇 教育学
- 3 篇 教育学

主题

82 篇 design
76 篇 languages
34 篇 performance
17 篇 algorithms
17 篇 verification
15 篇 functional progr...
14 篇 reliability
14 篇 probabilistic pr...
13 篇 object oriented ...
13 篇 program synthesi...
13 篇 domain-specific ...
11 篇 experimentation
11 篇 java
10 篇 programming lang...
9 篇 type systems
9 篇 theory
9 篇 concurrency
7 篇 compilers
7 篇 optimization
6 篇 modules

机构

9 篇 carnegie mellon ...
8 篇 purdue univ w la...
6 篇 princeton univ p...
5 篇 northeastern uni...
5 篇 yale univ new ha...
5 篇 harvard univ cam...
5 篇 cornell univ ith...
5 篇 univ washington ...
5 篇 univ calif berke...
4 篇 univ wisconsin m...
4 篇 univ calif davis...
4 篇 univ utah salt l...
4 篇 univ penn philad...
4 篇 rice univ housto...
4 篇 univ chicago il ...
4 篇 stanford univ st...
4 篇 univ texas austi...
3 篇 mit csail cambri...
3 篇 univ cambridge c...
3 篇 microsoft res re...

作者

7 篇 walker david
6 篇 foster nate
6 篇 shao zhong
5 篇 gulwani sumit
5 篇 dillig isil
4 篇 rainey mike
4 篇 gu ronghui
4 篇 rompf tiark
4 篇 solar-lezama arm...
4 篇 chaudhuri swarat
4 篇 myers andrew c.
4 篇 wansbrough keith
3 篇 hirschfeld rober...
3 篇 flatt matthew
3 篇 rajamani sriram
3 篇 seshia sanjit a.
3 篇 rajan hridesh
3 篇 huang jeff
3 篇 vechev martin
3 篇 olukotun kunle

语言

286 篇 英文
33 篇 其他
1 篇 中文

检索条件"任意字段=36th ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 320 条记录，以下是201-210 订阅

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

详细简洁

排序：

Classbox/J: Controlling the scope of change in Java

Classbox/J: Controlling the scope of change in Java

引用

20th conference on Object-Oriented programming, Systems, languages and Applications

作者： Bergel, A Ducasse, S Nierstrasz, O Univ Bern Software Composit Grp Bern Switzerland Univ Savoie Language & Software Evolut Grp LISTIC Chambery France

Unanticipated changes to complex software systems can introduce anomalies such as duplicated code, suboptimal inheritance relationships and a proliferation of run-tirne downcasts. Refactoring to eliminate these anomalies may not be an option, at least in certain stages of software evolution. Classboxes are modules that restrict the visibility of changes to selected clients only, thereby offering more freedom in the way unanticipated changes may be implemented, and thus reducing the need for convoluted design anomalies. In this paper we demonstrate how classboxes can be implemented in statically-typed languages like Java. We also present an extended case study of Swing, a Java GUI package built on top of AWT, and we document the ensuing anomalies that Swing introduces. We show how Classbox/J, a prototype implementation of classboxes for Java, is used to provide a cleaner implementation of Swing using local refinement rather than subclassing.

关键词： language design module package open-classes class extension

来源：评论

学校读者我要写书评

暂无评论

SOAP 2021 - Proceedings of the 10th acm sigplan International Workshop on the State of the Art in Program Analysis, co-located with PLDI 2021

SOAP 2021 - Proceedings of the 10th ACM SIGPLAN Internationa...

引用

10th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2021, co-located with the 42nd acm sigplan International conference on programming language design and implementation, PLDI 2021

ISBN: (纸本)9781450384681

the proceedings contain 8 papers. the topics discussed include: static analysis for dummies: experiencing LiSA;security and quality: two sides of the same coin?;program analysis for reversible languages;PerfLens: a data-driven performance bug detection and fix platform;Weldr: fusing binaries for simplified analysis;multi-language static code analysis on the LARA framework;serialization-aware call graph construction;and scalable string analysis: an experience report.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reactive Imperative programming with Dataflow Constraints 11

Reactive Imperative Programming with Dataflow Constraints

引用

2th acm International conference on Systems, programming, languages, and Applications: Software for Humanity (SPLASH)

作者： Demetrescu, Camil Finocchi, Irene Ribichini, Andrea Univ Roma La Sapienza Dept Comp & Syst Sci Rome Italy

ISBN: (纸本)9781450309400

Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environment. Researchers have long investigated how to take advantage of dataflow constraints by embedding them into procedural languages. Previous mixed imperative/dataflow systems, however, require syntactic extensions or libraries of ad hoc data types for binding the imperative program to the dataflow solver. In this paper we propose a novel approach that smoothly combines the two paradigms without placing undue burden on the programmer. In our framework, programmers can define ordinary statements of the imperative host language that enforce constraints between objects stored in special memory locations designated as "reactive". Differently from previous approaches, reactive objects can be of any legal type in the host language, including primitive data types, pointers, arrays, and structures. Statements defining constraints are automatically re-executed every time their input memory locations change, letting a program behave like a spreadsheet where the values of some variables depend upon the values of other variables. the constraint solving mechanism is handled transparently by altering the semantics of elementary operations of the host language for reading and modifying objects. We provide a formal semantics and describe a concrete embodiment of our technique into C/C++, showing how to implement it efficiently in conventional platforms using off-the-shelf compilers. We discuss common coding idioms and relevant applications to reactive scenarios, including incremental computation, observer design pattern, and data structure repair. the performance of our implementation is compared to ad hoc problem-specific change propagation algorithms, as well as to language-centric approaches such as self-adjusting computation and subject/observer communication mechanisms, showing that the proposed approa

关键词： Reactive programming dataflow programming imperative programming constraint solving incremental computation observer design pattern data structure repair

来源：评论

学校读者我要写书评

暂无评论

Pattern matching for object-like structures in the Go programning language

Pattern matching for object-like structures in the Go progra...

引用

6th Workshop on the implementation, Compilation, Optimization of Object-Oriented languages, Programs and Systems, ICOOOLPS 2011 - In Conjunction with the 25th European conference on Object-Oriented programming, ECOOP 2011

作者： Kaewkasi, Chanwit Kaewkasi, Pitchaya School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand

ISBN: (纸本)9781450308946

this paper explores the feasibility of implementing pattern matching for the Go programming language. the design of pattern matching is taken from Scala, and reimplemented using Go's constructs and new language extensions, namely casestruct and trait. the evaluations show that pattern matching allows expressing decomposition for struct in concise forms. the concepts of casestruct and trait are suggested to add to the Go language in order to make it properly supports pattern matching. However, the performance of the current implementation is still slower than hand-written struct decompositions. the evaluations also suggest that performance penalty of the type embedding feature proposed by Go for inheritance-like relationship is found in the GCCGO implementation, but not in another implementation, namely 8g. © 2011 acm.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

SOAP 2024 - Proceedings of the 13th acm sigplan International Workshop on the State Of the Art in Program Analysis, Co-located with: PLDI 2024

SOAP 2024 - Proceedings of the 13th ACM SIGPLAN Internationa...

引用

13th acm sigplan International Workshop on the State of the Art in Program Analysis, SOAP 2024, co-located with the 45th acm sigplan International conference on programming language design and implementation, PLDI 2024

ISBN: (纸本)9798400706219

the proceedings contain 8 papers. the topics discussed include: Dr Wenowdis: specializing dynamic language C extensions using type information;interleaving static analysis and LLM prompting;a better approximation for interleaved Dyck reachability;interactive source-to-source optimizations validated using static resource analysis;when to stop going down the rabbit hole: taming context-sensitivity on the fly;ValBench: benchmarking exact value analysis;static analysis for transitioning to CHERI C/C++;and Misconceptions about Loops in C.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiple instances and symbolic variables in executable sequence charts 02

Multiple instances and symbolic variables in executable sequ...

引用

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Marelly, R Harel, D Kugler, H Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel

ISBN: (纸本)9781581134711

We extend live sequence charts (LSCs), a highly expressive variant of sequence diagrams, and provide the extension with an executable semantics. the extension involves support for instances that can bind to multiple objects and symbolic variables that can bind to arbitrary values. the result is a powerful executable language for expressing behavioral requirements on the level of inter-object interaction. the extension is implemented in full in our play-engine tool, with which one can execute the requirements directly without the need to build or synthesize an intra-object system model. It seems that in addition to many advantages in testing and requirements engineering, for some kinds of systems this could lead to the requirements actually serving as the final implementation.

关键词： design languages verification

来源：评论

学校读者我要写书评

暂无评论

Advanced Automata-Based Algorithms for Program Termination Checking 2018

Advanced Automata-Based Algorithms for Program Termination C...

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Chen, Yu-Fang Heizmann, Matthias Lengal, Ondrej Li, Yong Tsai, Ming-Hsien Turrini, Andrea Zhang, Lijun Acad Sinica Taipei Taiwan Natl Taipei Univ New Taipei Taiwan Univ Freiburg Freiburg Germany Brno Univ Technol FIT IT4Innovat Ctr Excellence Brno Czech Republic Chinese Acad Sci Univ Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China

ISBN: (纸本)9781450356985

In 2014, Heizmann et al. proposed a novel framework for program termination analysis. the analysis starts with a termination proof of a sample path. the path is generalized to a Buchi automaton (BA) whose language (by construction) represents a set of terminating paths. All these paths can be safely removed from the program. the removal of paths is done using automata difference, implemented via BA complementation and intersection. the analysis constructs in this way a set of BAs that jointly "cover" the behavior of the program, thus proving its termination. An implementation of the approach in Ultimate Automizer won the 1st place in the Termination category of SV-Comp 2017. In this paper, we exploit advanced automata-based algorithms and propose several non-trivial improvements of the framework. To alleviate the complementation computation for BAs-one of the most expensive operations in the framework-, we propose a multi-stage generalization construction. We start with generalizations producing subclasses of BAs (such as deterministic BAs) for which efficient complementation algorithms are known, and proceed to more general classes only if necessary. Particularly, we focus on the quite expressive subclass of semideterministic BAs and provide an improved complementation algorithm for this class. Our experimental evaluation shows that the proposed approach significantly improves the power of termination checking within the Ultimate Automizer framework.

关键词： Program Termination Buchi Automata Complementation and language Difference

来源：评论

学校读者我要写书评

暂无评论

SOAP 2022 - Proceedings of the 11th acm sigplan International Workshop on the State Of the Art in Program Analysis, co-located with PLDI 2022

SOAP 2022 - Proceedings of the 11th ACM SIGPLAN Internationa...

引用

11th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2022, co-located with the 43rd acm sigplan International conference on programming language design and implementation, PLDI 2022

ISBN: (纸本)9781450392747

the proceedings contain 7 papers. the topics discussed include: BinFPE: accurate floating-point exception detection for GPU applications;modeling code manipulation in JIT compilers;statically detecting data leakages in data science code;ensuring determinism in blockchain software with GoLiSA: an industrial experience report;ADA: a tool for visualizing the architectural overview of open-source repositories;abstract interpretation of Michelson smart-contracts;and towards an implementation of differential dynamic logic in PVS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Babelsberg/JS A Browser-Based implementation of an Object Constraint language

Babelsberg/JS A Browser-Based Implementation of an Object Co...

引用

28th European conference on Object-Oriented programming (ECOOP)

作者： Felgentreff, Tim Borning, Alan Hirschfeld, Robert Lincke, Jens Ohshima, Yoshiki Freudenberg, Bert Krahn, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany Univ Washington Seattle WA 98195 USA Viewpoints Res Inst Los Angeles CA USA SAP Labs Commun Design Grp San Francisco CA USA

ISBN: (纸本)9783662442029;9783662442012

Constraints provide a useful technique for ensuring that desired properties hold in an application. As a result, they have been used in a wide range of applications, including graphical layout, simulation, scheduling, and problem-solving. We describe the design and implementation of an Object Constraint programming language, an object-oriented language that cleanly integrates constraints with the underlying language in a way that respects encapsulation and standard object-oriented programming techniques, and that runs in browser-based applications. Prior work on Object Constraint programming languages has relied on modifying the underlying Virtual Machine, but that is not an option for web-based applications, which have become increasingly prominent. In this paper, we present an approach to implementing Object Constraint programming without Virtual Machine support, along with an implementation as a JavaScript extension. We demonstrate the resulting language, Babelsberg/JS, on a number of applications and provide performance measurements. Programs without constraints in Babelsberg/JS run at the same speed as pure JavaScript versions, while programs that do have constraints can still be run efficiently. Our design and implementation also incorporate incremental re-solving to support interaction, as well as a cooperating solvers architecture that allows multiple solvers to work together to solve more difficult problems.

关键词： Constraints Object Constraint programming

来源：评论

学校读者我要写书评

暂无评论

CHIUW 2019 - Proceedings of the acm sigplan 6th Chapel Implementers and Users Workshop, co-located with PLDI 2019

CHIUW 2019 - Proceedings of the ACM SIGPLAN 6th Chapel Imple...

引用

acm sigplan 6th Annual Chapel Implementers and Users Workshop, CHIUW 2019, held in conjunction with PLDI 2019

ISBN: (纸本)9781450368001

the proceedings contain 8 papers. the topics discussed include: GPUIterator: bridging the gap between chapel and GPU platforms;calling chapel code: interoperability improvements;towards radix sorting in the chapel standard library;implementing stencil problems in chapel: an experience report;chapel unblocked: recent communication optimizations in chapel;Arkouda: Interactive data exploration backed by chapel;chapel graph library (CGL);and chapel in cray HPO.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：