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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

136 篇 会议
11 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

119 篇 工学
- 118 篇 计算机科学与技术...
- 66 篇 软件工程
- 5 篇 电气工程
- 4 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
37 篇 理学
- 36 篇 数学
- 1 篇 生物学
4 篇 管理学
- 3 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

37 篇 logic programmin...
10 篇 program transfor...
8 篇 computer circuit...
8 篇 semantics
8 篇 logics and meani...
7 篇 artificial intel...
6 篇 mathematical log...
5 篇 program analysis
5 篇 programming tech...
4 篇 program synthesi...
4 篇 software enginee...
4 篇 software enginee...
4 篇 constraint handl...
4 篇 programming lang...
3 篇 static analysis
3 篇 source-to-source...
2 篇 program debuggin...
2 篇 floating-point n...
2 篇 concurrent const...
2 篇 types

机构

4 篇 katholieke univ ...
4 篇 univ politecn va...
3 篇 nagoya inst tech...
2 篇 univ politecn ma...
2 篇 univ fed rio gra...
2 篇 univ politecn va...
2 篇 katholieke univ ...
2 篇 univ southern de...
2 篇 rhein westfal th...
2 篇 univ complutense...
2 篇 univ north texas...
2 篇 tech u madrid sc...
2 篇 imdea software i...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...
2 篇 univ ulm d-89069...
2 篇 ecole polytech i...
2 篇 german univ cair...
2 篇 nagoya institute...

作者

6 篇 vidal german
4 篇 schneider-kamp p...
4 篇 silva josep
4 篇 falaschi moreno
4 篇 seki hirohisa
4 篇 abdennadher slim
4 篇 giesl juergen
3 篇 proietti maurizi...
3 篇 de schreye danny
3 篇 leuschel michael
3 篇 lucas salvador
3 篇 meseguer jose
2 篇 puebla german
2 篇 vanhoof w
2 篇 bruynooghe mauri...
2 篇 senni valerio
2 篇 michael hanus
2 篇 gallagher john p...
2 篇 komendantskaya e...
2 篇 sharaf nada

语言

145 篇 英文
3 篇 中文

检索条件"任意字段=18th International Symposium on Logic-Based Program Synthesis and Transformation"

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

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

详细简洁

排序：

Concolic Execution in Functional programming by program Instrumentation 25th

Concolic Execution in Functional Programming by Program Inst...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Palacios, Adrian Vidal, German Univ Politecn Valencia DSIC MiST Camino Vera S-N E-46022 Valencia Spain

ISBN: (纸本)9783319274362;9783319274355

Concolic execution, a combination of concrete and symbolic execution, has become increasingly popular in recent approaches to model checking and test case generation. In general, an interpreter of the language is augmented in order to also deal with symbolic values. In this paper, in contrast, we present an alternative approach that is based on a program instrumentation. Basically, the execution of the instrumented program in a standard environment produces a sequence of events that can be used to reconstruct the associated symbolic execution.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Schema-guided synthesis of CLP programs 1

引用

8th international Workshop on logic-based program synthesis and transformation (LOPSTR 98)

作者： Zidoum, H Flener, P Hnich, B United Arab Emirates Univ Al Ain U Arab Emirates Uppsala Univ Dept Info Sci S-75105 Uppsala Sweden Tampere Univ Technol Dept Info Technol SF-33101 Tampere Finland

ISBN: (数字)9783540489580

ISBN: (纸本)3540657657

this work is inspired by D.R. Smith’s research on synthesising global search (GS) programs (in the Refine language) from first-order logic specifications (also in Refine) [8,9,10]. We concentrate on synthesising constraint logic programs (CLP) [6] instead. We thus only have to synthesise code that (incrementally) poses the constraints, because the actual constraint propagation and pruning are performed by the CLP system. We here only tackle the family of decision assignment problems; the families of optimisation assignment problems, decision permutation problems, and optimisation permutation problems are covered in [4].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Schema-guided synthesis of imperative programs by constraint solving

引用

14th international symposium on logic based program synthesis and transformation

作者： Colón, MA USN Res Lab Ctr High Assurance Comp Syst Washington DC 20375 USA

ISBN: (纸本)3540266550

We present a method for schema-guided synthesis of imperative programs computing polynomial functions and their inverses. the schemas of our approach contain parameters representing both fragments of code and fragments of invariants, and they generate programs annotated with loop invariants establishing partial correctness. Schema application entails simultaneously instantiating the code parameters to polynomials and the invariant parameters to systems of polynomial equalities. By bounding the degrees of these polynomials and their number, our method reduces schema instantiation to non-linear constraint solving, based on the theory of polynomial ideals. Although non-linear constraint solving is NP-hard, a solution can be generated automatically when the. resulting system contains few constraints. A specialization of our method yields linear constraints by further restricting the form of the invariants. this restriction improves the efficiency of constraint solving, but may fail to synthesize programs derivable by the general method.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Maurizio Gabbrielli

ISBN: (数字)9783030452605

ISBN: (纸本)9783030452599

this book constitutes the thoroughly refereed post-conference proceedings of the 29th international symposium on logic-based program synthesis and transformation, LOPSTR 2019, held in Porto, Portugal, in October 2019. the 15 revised full papers were carefully reviewed and selected from 32 submissions. In addition to the 15 papers, this volume includes 2 invited papers.;the symposium cover all aspects of logic-based program development, stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. this year LOPSTR extends its traditional topics to include also logic-based program development based on integration of sub-symbolic and symbolic models, on machine learning techniques and on differential semantics. the papers are grouped into the following topics: static analysis, program synthesis, constraints and unification, debugging and verification, and program transformation.

关键词： logics and Meanings of programs Computer Systems Organization and Communication Networks Simulation and Modeling Computer Applications Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

CHRAnimation: An Animation Tool for Constraint Handling Rules 24th

CHRAnimation: An Animation Tool for Constraint Handling Rule...

引用

24th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Sharaf, Nada Abdennadher, Slim Fruehwirth, thom German Univ Cairo Cairo Egypt Univ Ulm D-89069 Ulm Germany

ISBN: (纸本)9783319178226;9783319178219

Visualization tools of different languages offer its users with a needed set of features allowing them to animate how programs of such languages work. Constraint Handling Rules (CHR) is currently used as a general purpose language. this results in having complex programs with CHR. Nevertheless, CHR is still lacking on visualization tools. With Constraint Handling Rules (CHR) being a high-level rule-based language, animating CHR programs through animation tools demonstrates the power of the language. Such tools are useful for beginners to the language as well as programmers of sophisticated algorithms. this paper continues upon the efforts made to have a generic visualization platform for CHR using source-to-source transformation. It also provides a new visualization feature that enables viewing all the possible solutions of a CHR program instead of the don't care nondeterminism used in most CHR implementations.

关键词： Constraint Handling Rules Algorithm visualization Algorithm animation Source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

A fixed point semantics for logic programs extended with cuts

引用

12th international Workshop on logic based program synthesis and transformation

作者： Vanhoof, W Tronçon, R Bruynooghe, M Katholieke Univ Leuven Dept Comp Sci Louvain Belgium

In this paper, we develop a bottom-up fixed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order i...

ISBN: (纸本)3540404384

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel Assembly synthesis 34th

Parallel Assembly Synthesis

引用

34th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Hu, Jingmei Chong, Stephen Seltzer, Margo Harvard Univ Cambridge MA 02138 USA Univ British Columbia Vancouver BC Canada

ISBN: (纸本)9783031712937;9783031712944

program synthesis offers an attractive alternative to the intricate and tedious process of writing assembly programs manually. Assembly program synthesis automatically generates implementations, given a high-level formal specification and a machine description. However, its limited scalability prevents widespread adoption. Automatic parallelization improves program synthesis in general, but parallelizing assembly synthesis is nontrivial as the realities that data are untyped and all state is global lead to an enormous search space and prevent straightforward decomposition into separable sub-problems that can be run in parallel. We present PASSES, a Parallel Assembly synthesis System Exploiting Subspaces. PASSES uses five heuristics to transform an original assembly synthesis problem into a set of sub-problems;it runs multiple synthesis sub-problems in parallel and constructs the final result by combining them. We evaluate PASSES on 26 general bit manipulation assembly programming problems and 140 machine-dependent use cases from two operating systems. Compared to an existing assembly synthesis tool and a state-of-the-art parallel SMT solver, all five heuristics in PASSES significantly improve assembly synthesis scalability.

关键词： program synthesis assembly programming parallel computing

来源：评论

学校读者我要写书评

暂无评论

Combining Static and Dynamic Contract Checking for Curry 27th

Combining Static and Dynamic Contract Checking for Curry

引用

27th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Hanus, Michael CAU Kiel Inst Informat D-24098 Kiel Germany

ISBN: (纸本)9783319944609;9783319944593

Static type systems are usually not sufficient to express all requirements on function calls. Hence, contracts with pre-and postconditions can be used to express more complex constraints on operations. Contracts can be checked at run time to ensure that operations are only invoked with reasonable arguments and return intended results. Although such dynamic contract checking provides more reliable program execution, it requires execution time and could lead to program crashes that might be detected with more advanced methods at compile time. To improve this situation for declarative languages, we present an approach to combine static and dynamic contract checking for the functional logic language Curry. based on a formal model of contract checking for functional logic programming, we propose an automatic method to verify contracts at compile time. If a contract is successfully verified, dynamic checking of it can be omitted. this method decreases execution time without degrading reliable program execution. In the best case, when all contracts are statically verified, it provides trust in the software since crashes due to contract violations cannot occur during program execution.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

6th international Workshop on logic program synthesis and transformation, LOPSTR 1996

引用

6th international Workshop on logic program synthesis and transformation, LOPSTR 1996

ISBN: (纸本)3540627189

the proceedings contain 18 papers. the special focus in this conference is on logic program synthesis and transformation. the topics include: Refining specifications to logic programs;symbolic verification with gap-order constraints;specification-based automatic verification of prolog programs;logic program specialisation;conjunctive partial deduction in practice;redundant argument filtering of logic programs;replacement can preserve termination;a transformation tool for pure prolog programs;enhancing partial deduction via unfold/fold rules;abstract specialization and its application to program parallelization;reductions of petri nets and unfolding of propositional logic programs;inferring argument size relationships with CLP(R);typed norms for typed logic programs;partial deduction in the framework of structural synthesis of programs;extensible logic program schematar;specialising meta-level compositions of logic programs;forms of logic specifications;synthesis of proof procedures for default reasoning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras 25th

Equational Formulas and Pattern Operations in Initial Order-...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Meseguer, Jose Skeirik, Stephen Univ Illinois Dept Comp Sci Champaign IL 61820 USA

ISBN: (纸本)9783319274362;9783319274355

A pattern t, i.e., a term possibly with variables, denotes the set (language) [t] of all its ground instances. In an untyped setting, symbolic operations on finite sets of patterns can represent Boolean operations on languages. But for the more expressive patterns needed in declarative languages supporting rich type disciplines such as subtype polymorphism untyped pattern operations and algorithms break down. We show how they can be properly defined by means of a signature transformation Sigma bar right arrow Sigma(#) that enriches the types of S. We also show that this transformation allows a systematic reduction of the first-order logic properties of an initial order-sorted algebra supporting subtype-polymorphic functions to equivalent properties of an initial many-sorted (i.e., simply typed) algebra. this yields a new, simple proof of the known decidability of the first-order theory of an initial order-sorted algebra.

关键词： Pattern operations Initial decidability Order-Sorted logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：