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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

144 篇 会议
13 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

4 篇 univ politecn va...
3 篇 katholieke univ ...
3 篇 nagoya inst tech...
3 篇 imdea software i...
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 篇 imdea software
2 篇 rhein westfal th...
2 篇 univ complutense...
2 篇 univ north texas...
2 篇 tech u madrid sc...
2 篇 michigan state u...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...
2 篇 univ ulm d-89069...

作者

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 篇 hermenegildo man...
3 篇 carro manuel
3 篇 hermenegildo m
3 篇 morales jose f.
3 篇 de schreye danny
3 篇 leuschel michael
3 篇 lucas salvador
3 篇 meseguer jose
2 篇 puebla german
2 篇 bruynooghe mauri...
2 篇 senni valerio
2 篇 michael hanus

语言

154 篇 英文
3 篇 中文

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

共 157 条记录，以下是91-100 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

program Specialization for Verifying Infinite State Systems: An Experimental Evaluation

引用

20th international symposium on logic-based program synthesis and transformation, LOPSTR 2010

作者： Fioravanti, Fabio Pettorossi, Alberto Proietti, Maurizio Senni, Valerio Univ G D Annunzio Dipartimento Sci Pescara Italy Univ Roma Tor Vergata DISP Rome Italy CNR IASI Rome Italy

ISBN: (纸本)9783642205507

We address the problem of the automated verification of temporal properties of infinite state reactive systems. We present some improvements of a verification method based on the specialization of constraint logic programs (CLP). First, we reformulate the verification method as a two-phase procedure: (1) in the first phase a CLP specification of an infinite state system is specialized with respect to the initial state of the system and the temporal property to be verified, and (2) in the second phase the specialized program is evaluated by using a bottom-up strategy. In this paper we propose some new strategies for performing program specialization during the first phase. We evaluate the effectiveness of these new strategies, as well as that of some old strategies, by presenting the results of experiments performed on several infinite state systems and temporal properties. Finally, we compare the implementation of our specialization-based verification method with various constraint-based model checking tools. the experimental results show that our method is effective and competitive with respect to the methods used in those other tools.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Eliminating Unstable Tests in Floating-Point programs 28th

Eliminating Unstable Tests in Floating-Point Programs

引用

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

作者： Titolo, Laura Munoz, Cesar A. Feliu, Marco A. Moscato, Mariano M. Natl Inst Aerosp Hampton VA 23666 USA NASA Langley Res Ctr Hampton VA 23665 USA

ISBN: (纸本)9783030138387;9783030138370

Round-off errors arising from the difference between real numbers and their floating-point representation cause the control flow of conditional floating-point statements to deviate from the ideal flow of the real-number computation. this problem, which is called test instability, may result in a significant difference between the computation of a floating-point program and the expected output in real arithmetic. In this paper, a formally proven program transformation is proposed to detect and correct the effects of unstable tests. the output of this transformation is a floating-point program that is guaranteed to return either the result of the original floating-point program when it can be assured that both its real and its floating-point flows agree or a warning when these flows may diverge. the proposed approach is illustrated with the transformation of the core computation of a polygon containment algorithm developed at NASA that is used in a geofencing system for unmanned aircraft systems.

关键词： Floating-point numbers Round-off error program transformation Test instability Formal verification

来源：评论

学校读者我要写书评

暂无评论

Binary Implication Hypergraphs for the Representation and Simplification of Propositional Formulae 34th

Binary Implication Hypergraphs for the Representation and Si...

引用

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

作者： de Mas, Jordina Frances Univ St Andrews Sch Comp Sci St Andrews Fife Scotland

ISBN: (纸本)9783031712937;9783031712944

Propositional simplification and preprocessing are of key importance in the fields of automated reasoning and theorem proving. We present a novel propositional formula representation able to capture all of its n-ary implication information in a tractable manner. From the exploration of this novel encoding in the form of a directed hypergraph, we derive a novel simplification rule which is guaranteed to be equivalencepreserving, monotonically decreasing in the size of the problem, and capable of deep inference. We are not aware of any such generic preprocessing framework capable of systematically simplifying propositional problems in arbitrary form. Interestingly, our rule effectively generalises and streamlines most of the known equivalence-preserving SAT preprocessing techniques. Additionally, since our problem transformations are domain- and application-independent, they can be used in combination with any propositional-logic-based techniques, including those currently used in automated reasoning, solving and optimisation tools.

关键词： Knowledge representation Propositional logic simplification Hypergraphs Implication graphs Existential graphs

来源：评论

学校读者我要写书评

暂无评论

A Generic Intermediate Representation for Verification Condition Generation 25th

A Generic Intermediate Representation for Verification Condi...

引用

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

作者： Montenegro, Manuel Pena, Ricardo Sanchez-Hernandez, Jaime Univ Complutense Madrid Madrid Spain

ISBN: (纸本)9783319274362;9783319274355

As part of a platform for computer-assisted verification, we present an intermediate representation of programs that is both language independent and appropriate for the generation of verification conditions. We show how many imperative and functional languages can be translated to this generic intermediate representation, and how the generated conditions reflect the axiomatic semantics of the original program. At this representation level, loop invariants and preconditions of recursive functions belonging to the original program are represented by assertions placed at certain edges of a directed graph. the paper defines the generic representation, sketches the transformation algorithms, and describes how the places where the invariants should be placed are computed. Assuming that, either manually or assisted by the platform, the invariants have been settled, it is shown how the verification conditions are generated. A running example illustrates the process.

关键词： Verification platforms Intermediate representation Verification conditions program transformation

来源：评论

学校读者我要写书评

暂无评论

Liveness-Driven Random program Generation 27th

Liveness-Driven Random Program Generation

引用

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

作者： Barany, Gergo INRIA Paris France

ISBN: (纸本)9783319944609;9783319944593

Randomly generated programs are popular for testing compilers and program analysis tools, with hundreds of bugs in real-world C compilers found by random testing. However, existing random program generators may generate large amounts of dead code (computations whose result is never used). this leaves relatively little code to exercise a target compiler's more complex optimizations. To address this shortcoming, we introduce liveness-driven random program generation. In this approach the random program is constructed bottom-up, guided by a simultaneous structural data-flow analysis to ensure that the generator never generates dead code. the algorithm is implemented as a plugin for the Frama-C framework. We evaluate it in comparison to Csmith, the standard random C program generator. Our tool generates programs that compile to more machine code with a more complex instruction mix.

关键词： Code generation Random testing Data-flow analysis program optimization

来源：评论

学校读者我要写书评

暂无评论

Proving program Properties as First-Order Satisfiability 28th

Proving Program Properties as First-Order Satisfiability

引用

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

作者： Lucas, Salvador Univ Politecn Valencia DSIC Valencia Spain

ISBN: (纸本)9783030138387;9783030138370

program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences phi which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we have shown that properties phi expressed as the existential closure of a boolean combination of atoms can be disproved by just finding a model of S and the negation (sic)phi of phi. Furthermore, this idea works quite well in practice due to the existence of powerful tools for the automatic generation of models for (many-sorted) first-order theories. In this paper we extend our previous results to arbitrary properties, expressed as sentences without any special restriction. Consequently, one can prove a program property. by just finding a model of an appropriate theory (including S and possibly something else) and an appropriate first-order formula related to.. Beyond its possible theoretical interest, we show that our results can also be of practical use in several respects.

关键词： First-order logic logical models program analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：