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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

21 篇 会议

馆藏范围

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

日期分布

学科分类号

20 篇 工学
- 20 篇 计算机科学与技术...
- 6 篇 软件工程
- 1 篇 控制科学与工程
4 篇 理学
- 4 篇 数学
3 篇 管理学
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

9 篇 logic programmin...
2 篇 program transfor...
2 篇 semantics
1 篇 intuitionistic l...
1 篇 datalog
1 篇 theorem proving
1 篇 program synthesi...
1 篇 extended relatio...
1 篇 formal logic
1 篇 sql
1 篇 types
1 篇 simply-typed nor...
1 篇 program analysis
1 篇 addition of faul...
1 篇 graph theory
1 篇 combinatorics of...
1 篇 logic programmin...
1 篇 program verifica...
1 篇 computer program...
1 篇 type inference

机构

2 篇 univ new mexico ...
2 篇 univ new mexico ...
1 篇 usn res lab ctr ...
1 篇 univ complutense...
1 篇 univ namur inst ...
1 篇 information and ...
1 篇 tokyo inst techn...
1 篇 heriot watt univ...
1 篇 katholieke univ ...
1 篇 univ complutense...
1 篇 univ complutense...
1 篇 univ north texas...
1 篇 tech u madrid sc...
1 篇 michigan state u...
1 篇 tech univ madrid...
1 篇 carnegie mellon ...
1 篇 univ politecn va...
1 篇 univ illinois ch...
1 篇 univ udine dipar...
1 篇 univ politecn va...

作者

2 篇 hermenegildo m
1 篇 vanhoof w
1 篇 villanueva alici...
1 篇 montenegro manue...
1 篇 lópez-garcía p
1 篇 mesnard f
1 篇 bacci giovanni
1 篇 vidal g
1 篇 moody j
1 篇 albert e
1 篇 sanchez-hernande...
1 篇 comini marco
1 篇 nys vincent
1 篇 tarau paul
1 篇 nicholson colin
1 篇 krishna rao m.r....
1 篇 serebrenik a
1 篇 skeirik stephen
1 篇 kameya y
1 篇 kulkarni ss

语言

21 篇 英文

检索条件"任意字段=14th International Symposium on Logic Based Program Synthesis and Transformation, LOPSTR 2004"

共 21 条记录，以下是1-10 订阅

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

详细简洁

排序：

logic based program synthesis and transformation: 14th international symposium, lopstr 2004. Revised Selected Papers

Logic Based Program Synthesis and Transformation: 14th Inter...

引用

14th international symposium on logic based program synthesis and transformation, lopstr 2004

the proceedings contain 289 papers from the logic based program synthesis and transformation: 14th international symposium, LOPSTER 2004. Revised Selected Papers. Topics discussed include searching semantically equivalent code fragments in logic programs;determinacy analysis for logic programs using mode and type information;mechanical verification of automatic synthesis of fault-tolerant programs;fully automatic binding-time analysis for prolog;logical mobility and locality types;negation elimination for finite PCFGs;specialization of concurrent guarded multi-set transformation rules;efficient local unfolding with ancestor stacks for full prolog;and natural rewriting for general term rewriting systems.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation: 16th international symposium, lopstr 2006

Logic-Based Program Synthesis and Transformation: 16th Inter...

引用

16th international symposium on logic-based program synthesis and transformation, lopstr 2006

ISBN: (纸本)354071409X

the proceedings contain 14 papers. the topics discussed include: how to talk to a human: the semantic web and the clash of the titans;constructing consensus logic programs;supervising offline partial evaluation of logic programs using online techniques;improving offline narrowing-driven partial evaluation using size-change graphs;towards description and optimization of abstract machines in an extension of prolog;combining different proof techniques for verifying information flow security;on the automated synthesis of proof-carrying temporal reference monitors;synthesis of asynchronous systems;a comparative study of algorithmic debugging strategies;automated termination analysis for logic programs by term rewriting;and detecting non-termination of term rewriting systems using an unfolding operator.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation - 19th international symposium, lopstr 2009, Revised Selected Papers

Logic-Based Program Synthesis and Transformation - 19th Inte...

引用

19th international symposium on logic-based program synthesis and transformation, lopstr2009

ISBN: (纸本)3642125913

the proceedings contain 14 papers. the topics discussed include: towards scalable partial evaluation of declarative programs;deciding full branching time logic by program transformation;a transformational approach for proving properties of the CHR constraint store;the dependency triple framework for termination of logic programs;goal-directed and relative dependency pairs for proving the termination of narrowing;LP with flexible grouping and aggregates using modes;on inductive and coinductive proofs via unfold/fold transformations;coinductive logic programming with negation;refining exceptions in four-valued logic;towards a framework for constraint-based test case generation;using rewrite strategies for testing BUpL agents;towards just-in-time partial evaluation of prolog;program parallelization using synchronized pipelining;and defining datalog in rewriting logic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Constructor-based Reachability logic for Rewrite theories 27th

A Constructor-Based Reachability Logic for Rewrite Theories

引用

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

作者： Skeirik, Stephen Stefanescu, Andrei Meseguer, Jose Univ Illinois Champaign IL 61820 USA

ISBN: (纸本)9783319944609;9783319944593

Reachability logic has been applied to K rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. Constructor-based semantic unification, matching, and satisfiability procedures greatly increase the range of decidable background theories that can be used in reachability logic proofs. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation illustrating the new proof methods are presented.

关键词： program verification Rewriting logic Reachability logic

来源：评论

学校读者我要写书评

暂无评论

Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction 24th

Analysing and Compiling Coroutines with Abstract Conjunctive...

引用

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

作者： De Schreye, Danny Nys, Vincent Nicholson, Colin Katholieke Univ Leuven Dept Comp Sci B-3001 Heverlee Belgium

ISBN: (纸本)9783319178226;9783319178219

We provide an approach to formally analyze the computational behavior of coroutines in logic programs and to compile these computations into new programs, not requiring any support for coroutines. the problem was already studied near to 30 years ago, in an analysis and transformation technique called Compiling Control. However, this technique had a strong ad hoc flavor: the completeness of the analysis was not well understood and its symbolic evaluation was also very ad hoc. We show how Abstract Conjunctive Partial Deduction, introduced by Leuschel in 2004, provides an appropriate setting to redefine Compiling Control. Leuschel's framework is more general than the original formulation, it is provably correct, and it can easily be applied for simple examples. We also show that the Abstract Conjunctive Partial Deduction framework needs some further extension to be able to deal with more complex examples.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Symbolic Abstract Contract synthesis in a Rewriting Framework 26th

Symbolic Abstract Contract Synthesis in a Rewriting Framewor...

引用

26th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Alpuente, Maria Pardo, Daniel Villanueva, Alicia Univ Politecn Valencia DSIC Camino Vera S-N E-46022 Valencia Spain

ISBN: (纸本)9783319631394;9783319631387

We propose an automated technique for inferring software contracts from programs that are written in a non-trivial fragment of C, called KernelC, that supports pointer-based structures and heap manipulation. Starting from the semantic definition of KernelC in the K framework, we enrich the symbolic execution facilities recently provided by C with novel capabilities for assertion synthesis that are based on abstract subsumption. Roughly speaking, we define an abstract symbolic technique that explains the execution of a (modifier) C function by using other (observer) routines in the same program. We implemented our technique in the automated tool KindSpec 2.0, which generates logical axioms that define the precise input/ output behavior of the C routines.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Abstract Diagnosis of First Order Functional logic programs

引用

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

作者： Bacci, Giovanni Comini, Marco Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy

ISBN: (纸本)9783642205507

We present a generic scheme for the abstract debugging of functional logic programs. We associate to programs a semantics based on a (continuous) immediate consequence operator. P[R], which models correctly the powerful features of modern functional logic languages (non-deterministic, non-strict functions defined by non-confluent programs and call-time choice behaviour). then, we develop an effective debugging methodology which is based on abstract interpretation: by approximating the intended specification of the semantics of R we derive a finitely terminating bottom-up diagnosis method, which can be used statically. Our debugging framework does not require the user to provide error symptoms in advance and is applicable with partial specifications and even partial programs.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Intuitionistic logic programming for SQL 26th

Intuitionistic Logic Programming for SQL

引用

26th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Saenz-Perez, Fernando Univ Complutense Madrid Declarat Programming Grp Dept Ingn Software & Inteligencia Artificial Madrid Spain

ISBN: (纸本)9783319631394;9783319631387

Intuitionistic logic programming provides the notion of embedded implication in rule bodies, which can be used to reason about a current database modified by the antecedent. this can be applied to a system that translates SQL to Datalog to solve SQL WIth queries, for which relations are locally defined and can therefore be understood as locally added to the current database. In addition, assumptions in SQL queries as either adding or removing data can be modelled in this way as well, which is an interesting feature for decision-support scenarios. this work suggests a way to apply intuitionistic logic programming to SQL, and provides a pointer to a working system implementing this idea.

关键词： Intuitionistic logic programming SQL Datalog Extended relational algebra

来源：评论

学校读者我要写书评

暂无评论

Searching semantically equivalent code fragments in logic programs

引用

14th international symposium on logic based program synthesis and transformation

作者： Vanhoof, W Univ Namur Inst Informat Namur Belgium

ISBN: (纸本)3540266550

In this work, we devise an analysis that searches for semantically equivalent code fragments within a given logic program. the presence of duplicated code (or functionality) is a primary indication that the design of the program can be improved by performing a so-called refactoring transformation. Within the framework of our analysis, we formally characterize three situations of duplicated functionality and their associated refactorings: the extraction of a duplicated goal into a new predicate, the removal of equivalent predicates and the generalization of two predicates into a higher-order predicate. the resulting analysis detects in a completely automatic way what program fragments are suitable candidates for the considered refactoring transformations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：