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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 种 纸本馆藏

日期分布

学科分类号

127 篇 工学
- 126 篇 计算机科学与技术...
- 75 篇 软件工程
- 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 条记录，以下是51-60 订阅

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

详细简洁

排序：

Declarative Compilation for Constraint logic programming 24th

Declarative Compilation for Constraint Logic Programming

引用

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

作者： Gallego Arias, Emilio Jesus Lipton, James Marino, Julio Univ Penn Philadelphia PA 19104 USA Wesleyan Univ Middletown CT 06459 USA Univ Politecn Madrid Madrid Spain

ISBN: (纸本)9783319178226;9783319178219

We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. this translation provides an algebraic formulation of the abstract syntax of logic programs. Management of logic variables, unification, and renaming apart is completely elided in favor of algebraic manipulation of variable-free relation expressions. We prove the translation is sound, and the rewriting system complete with respect to traditional SLD semantics.

关键词： logic programming Constraint programming Relation algebra Rewriting Semantics

来源：评论

学校读者我要写书评

暂无评论

Negation elimination for finite PCFGs

引用

14th international symposium on logic based program synthesis and transformation

作者： Sato, T Kameya, Y Tokyo Inst Technol CREST JST Tokyo Japan

ISBN: (纸本)3540266550

We introduce negation to a symbolic-statistical modeling language PRISM and propose to eliminate negation by program transformation called negation technique which is applicable to probabilistic logic programs. We also introduce finite PCFGs (probabilistic context free grammars) as PCFGs with finite constraints as part of generative modeling of stochastic HPSGs (head-driven phrase structure grammars). they are a subclass of log-linear models and allow exact computation of normalizing constants. We apply the negation technique to a PDCG (probabilistic definite clause grammar) program written in PRISM that describes a finite PCFG with a height constraint. the resulting program computes a normalizing constant for the finite PCFG in time linear in the given height. We also report on an experiment of parameter learning for a real grammar (ATR grammar) with the height constraint. We have discovered that the height constraint does not necessarily lead to a significant decrease in parsing accuracy.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

program Parallelization Using Synchronized Pipelining

Program Parallelization Using Synchronized Pipelining

引用

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

作者： Scandolo, Leonardo Kunz, Cesar Hermenegildo, Manuel IMDEA Software Spain Technical U. of Madrid Spain

ISBN: (纸本)9783642125911

While there are well-understood methods for detecting loops whose iterations are independent and parallelizing them, there are comparatively fewer proposals that support parallel execution of a sequence of loops or nested loops in the case where such loops have dependencies among them. this paper introduces a refined notion of independence, called eventual independence, that in its simplest form considers two loops, say loop, and loop, and captures the idea that for every i there exists k such that the i + 1-th iteration of loop, is independent from the j-th iteration of loop(1), for all j >= k. Eventual independence provides the foundation of a semantics-preserving program transformation, called synchronized pipelining, that makes execution of consecutive or nested loops parallel, relying on a minimal number of synchronization events to ensure semantics preservation. the practical benefits of synchronized pipelining are demonstrated through experimental results on common algorithms such as sorting and Fourier transforms.

关键词： Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On Completeness of logic programs 24th

On Completeness of Logic Programs

引用

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

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci PL-00901 Warsaw Poland Linkoping Univ IDA Linkoping Sweden

ISBN: (纸本)9783319178226;9783319178219

program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been devoted to reasoning about completeness. this paper presents a few sufficient conditions for completeness of definite programs. We also study preserving completeness under some cases of pruning of SLD-trees (e.g. due to using the cut). We treat logic programming as a declarative paradigm, abstracting from any operational semantics as far as possible. We argue that the proposed methods are simple enough to be applied, possibly at an informal level, in practical Prolog programming. We point out importance of approximate specifications.

关键词： logic programming program completeness Declarative programming Approximate specification

来源：评论

学校读者我要写书评

暂无评论

Mechanical verification of automatic synthesis of fault-tolerant programs

引用

14th international symposium on logic based program synthesis and transformation

作者： Kulkarni, SS Bonakdarpour, B Borzoo, S Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

ISBN: (纸本)3540266550

Fault-tolerance is a crucial property in many systems. thus, mechanical verification of algorithms associated with synthesis of fault-tolerant programs is desirable to ensure their correctness. In this paper, we present the mechanized verification of algorithms that automate the addition of fault-tolerance to a given fault-intolerant program using the PVS theorem prover. By this verification, not only we prove the correctness of the synthesis algorithms, but also we guarantee that any program synthesized by these algorithms is correct by construction. Towards this end, we formally define a uniform framework for formal specification and verification of fault-tolerance that consists of abstract definitions for programs, specifications, faults, and levels of fault-tolerance, so that they are independent of platform and architecture. the essence of synthesis algorithms involves fixpoint calculations. Hence, we also develop a reusable library for fixpoint calculations on finite sets in PVS.

关键词： fault-tolerance PVS program synthesis program transformation mechanical verification theorem proving addition of fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear logic Inference 28th

A Pragmatic, Scalable Approach to Correct-by-Construction Pr...

引用

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

作者： Papapanagiotou, Petros Fleuriot, Jacques Univ Edinburgh Sch Informat 10 Crichton St Edinburgh EH8 9AB Midlothian Scotland

ISBN: (纸本)9783030138387;9783030138370

the need for rigorous process composition is encountered in many situations pertaining to the development and analysis of complex systems. We discuss the use of Classical Linear logic (CLL) for correct-by-construction resource-based process composition, with guaranteed deadlock freedom, systematic resource accounting, and concurrent execution. We introduce algorithms to automate the necessary inference steps for binary compositions of processes in parallel, conditionally, and in sequence. We combine decision procedures and heuristics to achieve intuitive and practically useful compositions in an applied setting.

关键词： Process modelling Composition Correct by construction Workflow Linear logic

来源：评论

学校读者我要写书评

暂无评论

Defining Data log in Rewriting logic

Defining Data log in Rewriting Logic

引用

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

作者： Alpuente, M. Feliu, M. A. Joubert, C. Villanueva, A. Univ Politecn Valencia DSIC ELP Valencia 46022 Spain

ISBN: (纸本)9783642125911

In recent work, the effectiveness of using declarative languages has been demonstrated for many problems in program analysis. Using a simple relational query language, like DATALOG, complex interprocedural analyses involving dynamically created objects can be expressed in just a few lines. By exploiting the power of the Rewriting logic language MAUDE, we aim at transforming DATALOG programs into efficient rewrite systems that compute the same answers. A prototype has been implemented and applied to some real-world DATALOG-based analyses. Experimental results show that the performance of solving DATALOG queries in rewriting logic is comparable to state-of-the-art DATA LOG solvers.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Drill and Join: A Method for Exact Inductive program synthesis 24th

Drill and Join: A Method for Exact Inductive Program Synthes...

引用

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

作者： Balaniuk, Remis Univ Catolica Brasilia Brasilia DF Brazil

ISBN: (纸本)9783319178226;9783319178219

In this paper we propose a novel semi-supervised active machine-learning method, based on two recursive higher-order functions that can inductively synthesize a functional computer program. based on properties formulated using abstract algebra terms, the method uses two combined strategies: to reduce the dimensionality of the Boolean algebra where a target function lies and to combine known operations belonging to the algebra, using them as a basis to build a program that emulates the target function. the method queries for data on specific points of the problem input space and build a program that exactly fits the data. Applications of this method include all sorts of systems based on bitwise operations. Any functional computer program can be emulated using this approach. Combinatorial circuit design, model acquisition from sensor data, reverse engineering of existing computer programs are all fields where the proposed method can be useful.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

On Inductive and Coinductive Proofs via Unfold/Fold transformations

On Inductive and Coinductive Proofs via Unfold/Fold Transfor...

引用

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

作者： Seki, Hirohisa Nagoya Inst Technol Dept Comp Sci Showa Ku Nagoya Aichi 4668555 Japan

ISBN: (纸本)9783642125911

We consider a new application condition of negative unfolding, which guarantees its safe use in unfold/fold transformation of stratified logic programs. the new condition of negative unfolding is a natural one, since it is considered as a special case of replacement rule. the correctness of our unfold/fold transformation system in the sense of the perfect model semantics is proved. We then consider the coinductive proof rules proposed by Jaffar et al. We show that our unfold/fold transformation system, when used together with Lloyd-Topor transformation, can prove a proof problem which is provable by the coinductive proof rules by Jaffar et al. To this end, we propose a new replacement rule, called sowed replacement, which is not necessarily equivalence-preserving, but is essential to perform a reasoning step corresponding to coinduction.

关键词： Preservation of equivalence negative unfolding coinduction unfold/fold transformation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：