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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

143 篇 会议
15 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

4 篇 univ politecn va...
3 篇 katholieke univ ...
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 篇 proietti maurizi...
4 篇 schneider-kamp p...
4 篇 silva josep
4 篇 falaschi moreno
4 篇 seki hirohisa
4 篇 abdennadher slim
4 篇 giesl juergen
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
2 篇 gallagher john p...
2 篇 komendantskaya e...
2 篇 sharaf nada
2 篇 hermenegildo man...

语言

155 篇 英文
3 篇 中文

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

共 158 条记录，以下是61-70 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analyzing Array Manipulating programs by program transformation 24th

Analyzing Array Manipulating Programs by Program Transformat...

引用

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

作者： Cornish, J. Robert M. Gange, Graeme Navas, Jorge A. Schachte, Peter Sondergaard, Harald Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia NASA Ames Res Ctr Moffett Field Mountain View CA 94035 USA

ISBN: (纸本)9783319178226;9783319178219

We explore a transformational approach to the problem of verifying simple array-manipulating programs. Traditionally, verification of such programs requires intricate analysis machinery to reason with universally quantified statements about symbolic array segments, such as "every data item stored in the segment A[i] to A[j] is equal to the corresponding item stored in the segment B[i] to B[j]." We define a simple abstract machine which allows for set-valued variables and we show how to translate programs with array operations to array-free code for this machine. For the purpose of program analysis, the translated program remains faithful to the semantics of array manipulation. based on our implementation in LLVM, we evaluate the approach with respect to its ability to extract useful invariants and the cost in terms of code size.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

Correctness of Context-Moving transformations for Term Rewriting Systems 25th

Correctness of Context-Moving Transformations for Term Rewri...

引用

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

作者： Sato, Koichi Kikuchi, Kentaro Aoto, Takahito Toyama, Yoshihito Tohoku Univ RIEC Aoba Ku 2-1-1 Katahira Sendai Miyagi 9808577 Japan

ISBN: (纸本)9783319274362;9783319274355

Proofs by induction are often incompatible with functions in tail-recursive form as the accumulator changes in the course of unfolding the definitions. Context-moving and context-splitting (Giesl, 2000) for functional programs transform tail-recursive programs into non tail-recursive ones which are more suitable for proofs by induction and thus for verification. In this paper, we formulate context-moving and context-splitting transformations in the framework of term rewriting systems, and prove their correctness with respect to both eager evaluation semantics and initial algebra semantics under some conditions on the programs to be transformed. the conditions for the correctness with respect to initial algebra semantics can be checked by automated methods for inductive theorem proving developed in the field of term rewriting systems.

关键词： Tail-recursion program transformation Term rewriting system Inductive theorem proving

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Polynomial Approximation to Well-Founded Semantics for logic programs with Generalized Atoms: Case Studies 24th

Polynomial Approximation to Well-Founded Semantics for Logic...

引用

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

作者： Chowdhury, Md. Solimul Liu, Fangfang Chen, Wu Karimi, Arash You, Jia-Huai Univ Alberta Dept Comp Sci Edmonton AB Canada Shanghai Univ Coll Comp & Informat Sci Baoshan Peoples R China Southwest Univ Coll Comp & Informat Sci Chongqing Peoples R China

ISBN: (纸本)9783319178226;9783319178219

the well-founded semantics of normal logic programs has two main utilities, one being an efficiently computable semantics with a unique intended model, and the other serving as polynomial time constraint propagation for the computation of answer sets of the same program. When logic programs are generalized to support constraints of various kinds, the semantics is no longer tractable, which makes the second utility doubtful. this paper considers the possibility of tractable but incomplete methods, which in general may miss information in the computed result, but never generates wrong conclusions. For this goal, we first formulate a well-founded semantics for logic programs with generalized atoms, which generalizes logic programs with arbitrary aggregates/constraints/dl-atoms. As a case study, we show that the method of removing non-monotone dl-atoms for the well-founded semantics by Eiter et al. actually falls into this category. We also present a case study for logic programs with standard aggregates.

关键词： Polynomial approximation Well-founded semantics Generalized atoms

来源：评论

学校读者我要写书评

暂无评论

Proof Checking and logic programming 25th

Proof Checking and Logic Programming

引用

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

作者： Miller, Dale Ecole Polytech Inria Palaiseau France Ecole Polytech LIX Palaiseau France

ISBN: (纸本)9783319274362;9783319274355

In a world where trusting software systems is increasingly important, formal methods and formal proof can help provide trustable foundations. Proof checking can help to reduce the size of the trusted base since we do not need to trust an entire theorem prover if we can check the proofs they produce by a trusted (and smaller) checker. Many approaches to building proof checkers require embedding within them a full programming language. In most many modern proof checkers and theorem provers, that programming language is a functional programming language, often a variant of ML. In fact, parts of ML (e.g., strong typing, abstract datatypes, and higher-order programming) were designed to make ML into a trustworthy "meta-language" for checking proofs. While there is considerable overlap in the foundations of logic programming and proof checking (both benefit from unification, backtracking search, efficient term structures, etc.), the discipline of logic programming has, in fact, played a minor role in the history of proof checking. I will argue that logic programming can have a major role in the future of this important topic.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A Generalized Model for Algorithmic Debugging 25th

A Generalized Model for Algorithmic Debugging

引用

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

作者： Insa, David Silva, Josep Univ Politecn Valencia E-46022 Valencia Spain

ISBN: (纸本)9783319274362;9783319274355

Algorithmic debugging is a semi-automatic debugging technique that is present in practically all mature programming languages. In this paper we claim that the state of the practice in algorithmic debugging is a step forward compared to the state of the theory. In particular, we argue that novel techniques for algorithmic debugging cannot be supported by the standard internal data structures used in this technique, and a generalization of the standard definitions and algorithms is needed. We identify two specific problems of the standard formulation and implementations of algorithmic debugging, and we propose a reformulation to solve both problems. the reformulation has been done in a paradigm-independent manner to make it useful and reusable in different programming languages.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems 24th

Extending the 2D Dependency Pair Framework for Conditional T...

引用

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

作者： Lucas, Salvador Meseguer, Jose Gutierrez, Raul Univ Illinois CS Dept Champaign IL 61820 USA Univ Politecn Valencia DSIC E-46022 Valencia Spain

ISBN: (纸本)9783319178226;9783319178219

Recently, a new dependency pair framework for proving operational termination of Conditional Term Rewriting Systems (CTRSs) has been introduced. We call it 2D Dependency Pair (DP) Framework for CTRSs because it makes explicit and exploits the bidimensional nature of the termination behavior of conditional rewriting, where rewriting steps s -> t and rewritings s -> *t (in zero or more steps) are defined for specific terms s and t by using an inference system where appropriate proof trees should be exhibited for such particular goals. In this setting, the horizontal component of the termination behavior concerns the existence of infinite sequences of rewriting steps, and the vertical component captures infinitely many climbs during the development of a proof tree for a single rewriting step. In this paper we extend the 2D DP Framework for CTRSs with several powerful processors for proving and disproving operational termination that specifically exploit the structure of conditional rules. We provide the first implementation of the 2D DP Framework as part of the termination tool mu-term. Our benchmarks suggest that, with our new processors, the 2D DP Framework is currently the most powerful technique for proving operational termination of CTRSs.

关键词： Conditional rewriting Dependency pairs Operational termination program analysis

来源：评论

学校读者我要写书评

暂无评论

20th international symposium on Formal Methods, FM 2015

引用

20th international symposium on Formal Methods, FM 2015

ISBN: (纸本)9783319192482

the proceedings contain 43 papers. the special focus in this conference is on Formal Methods. the topics include: Automated circular assume-guarantee reasoning;narrowing operators on template abstract domains;detection of design flaws in the android permission protocol through bounded verification;reasoning about privacy properties of biometric system architectures;a specification language for static and runtime verification of data and control properties;certificates for parameterized model checking;safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes;a framework for correctness criteria on weak memory models;semantics-preserving simplification of real-world firewall rule sets;parameter synthesis through temporal logic specifications;trace-length independent runtime monitoring of quantitative policies in LTL;a model checker for quantum programs and protocols;property-driven fence insertion using reorder bounded model checking;proving safety with trace automata and bounded model checking;verifying parameterized timed security protocols;abstraction of elementary hybrid systems by variable transformation;using real-time Maude to model check energy consumption behavior;static differential program analysis for software-defined networks;the semantics of cardinality-based feature models via formal languages;model-based problem solving for university timetable validation and improvement;direct formal verification of liveness properties in continuous and hybrid dynamical systems;static optimal scheduling for synchronous data flow graphs with model checking;eliminating static analysis false positives using loop abstraction and bounded model checking;formal virtual modelling and data verification for supervision systems and formalizing the concept phase of product development.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共16页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：