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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 New Functional-logic Compiler for Curry: SPRITE 26th

A New Functional-Logic Compiler for Curry: SPRITE

引用

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

作者： Antoy, Sergio Jost, Andy Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (纸本)9783319631394;9783319631387

We introduce a new native code compiler for Curry code-named Sprite. Sprite is based on the Fair Scheme, a compilation strategy that provides instructions for transforming declarative, non-deterministic programs of a certain class into imperative, deterministic code. We outline salient features of Sprite, discuss its implementation of Curry programs, and present benchmarking results. Sprite is the first-to-date operationally complete implementation of Curry. Preliminary results show that ensuring this property does not incur a significant penalty.

关键词： Functional logic programming Compiler implementation Operational completeness

来源：评论

学校读者我要写书评

暂无评论

Temporal logic constraints in the biochemical abstract machine BIOCHAM

引用

15th international symposium on logic based program synthesis and transformation

作者： Fages, Frangois INRIA Rocquencourt France

ISBN: (纸本)3540326545

Recent progress in Biology and data-production technologies push research toward a new interdisciplinary field, named Systems Biology, where the challenge is to break the complexity walls for reasoning about large biomolecular interaction systems. Pioneered by Regev, Silverman and Shapiro, the application of process calculi to the description of biological processes has been a source of inspiration for many researchers coming from the programming language community. In this presentation, we give an overview of the Biochemical Abstract Machine (BIOCHAM), in which biochemical systems are modeled using a simple language of reaction rules, and the biological properties of the system, known from experiments, are formalized in temporal logic. In this setting, the biological validation of a model can be done by model-checking, both qualitatively and quantitatively. Moreover, the temporal properties can be turned into specifications for learning modifications or refinements of the model, when incorporating new biological knowledge.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A transformational semantics of static embedded implications of normal logic programs

引用

15th international symposium on logic based program synthesis and transformation

作者： Pasarella, Edelmira Orejas, Fernando Pino, Elvira Navarro, Marisa Univ Politecn Cataluna Dpto LSI ES-08034 Barcelona Spain Univ Basque Country Dpto LSI E-20080 San Sebastian Spain

ISBN: (纸本)3540326545

there are mainly two approaches for structuring logic programs. the first one is based on defining some notion of program unit or module and on providing a number of composition operators. the second approach consists in enriching logic programming with a mechanism of abstraction and scoping rules that are frequently found, for instance, in procedural programming. More precisely, this approach has been advocated by Miller and others using implications embedded in the goals of the given program as a structuring mechanism. However, as Giordano, Martelli and Rossi pointed out, we can associate two different visibility rules (static and dynamic) to this kind of structuring mechanism where, obviously, the semantics of the given program depends on the chosen rule. In this paper we consider normal constraint logic programs (with constructive negation a la Drabent as operational semantics) extended with embedded implications with a static visibility rule. this class of programs combines the expressive power of normal programs with the capability to organize and to enhance dinamically their sets of clauses. In particular, first, we introduce an operational semantics based on constructive negation for this class of programs, taking into account the static visibility rule. then, we present an alternative semantics in terms of a transformation of the given structured program into a flat one. Finally, we prove the adequacy of this transformation by showing that it preserves the computed answers of the given program. Obviously, this transformation semantics can be used as the basis for an implementation of this structuring mechanism.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Exhaustive Execution of CHR through Source-to-Source transformation 24th

Exhaustive Execution of CHR Through Source-to-Source Transfo...

引用

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

作者： Elsawy, Ahmed Zaki, Amira Abdennadher, Slim German Univ Cairo Cairo Egypt Univ Ulm D-89069 Ulm Germany

ISBN: (纸本)9783319178226;9783319178219

Constraint Handling Rules (CHR) is a committed-choice rule-based programming language. Rules rewrite a global multi-set of constraints to another. Overlapping sets of constraints within the rules and the order of constraints within rules and queries entail different derivation paths. In this work, a novel operational strategy is proposed which enables a high-level form of execution control that empowers a comprehensive and customizable execution strategy. It allows full space exploration for any CHR program, thus finding all possible results to a query which is interesting for many non-confluent programs. the proposed transformation is performed as a source-to-source transformation from any CHR program to one utilizing disjunction to force an exhaustive explorative execution strategy. the work is complemented by formal arguments to prove the correctness and completeness of the transformation.

关键词： Constraint Handling Rules Execution flow control Exhaustive execution Search space exploration Source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

CHR in Action 25th

CHR in Action

引用

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

作者： Ismail, Arwa Sharaf, Nada Abdennadher, Slim German Univ Cairo New Cairo Egypt

ISBN: (纸本)9783319274362;9783319274355

Constraint Handling Rules (CHR) has expanded its application range over the past few years to include different algorithms rather than only constraint solvers. Animation of algorithms has been used over the past few decades to aid the understanding of programming languages and how they are processed. In this work, we present a generic form of animating CHR programs using source-to-source transformation. the transformation converts CHR programs into their equivalent CHR programs enhanced with animation features, in an automated manner.

关键词： Constraint Handling Rules Animation Source-to-source transformation XPCE

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Method for the Verification and synthesis of Parameterized Self-Stabilizing Protocols 24th

A Hybrid Method for the Verification and Synthesis of Parame...

引用

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

作者： Tahat, Amer Ebnenasir, Ali Michigan Technol Univ Dept Comp Sci Houghton MI 49931 USA

ISBN: (纸本)9783319178226;9783319178219

this paper presents a hybrid method for verification and synthesis of parameterized self-stabilizing protocols where algorithmic design and mechanical verification techniques/tools are used hand-in-hand. the core idea behind the proposed method includes the automated synthesis of self-stabilizing protocols in a limited scope (i.e., fixed number of processes) and the use of theorem proving methods for the generalization of the solutions produced by the synthesizer. Specifically, we use the Prototype Verification System (PVS) to mechanically verify an algorithm for the synthesis of weakly self-stabilizing protocols. then, we reuse the proof of correctness of the synthesis algorithm to establish the correctness of the generalized versions of synthesized protocols for an arbitrary number of processes. We demonstrate the proposed approach in the context of an agreement and a coloring protocol on the ring topology.

关键词： Mechanical verification program synthesis Self-stabilization Parameterized systems

来源：评论

学校读者我要写书评

暂无评论

synthesis of asynchronous systems

Synthesis of asynchronous systems

引用

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

作者： Schewe, Sven Finkbeiner, Bernd Univ Saarland D-06123 Saarbrucken Germany

ISBN: (纸本)9783540714095

this paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of synthesizing a single-process implementation is the same for synchronous and asynchronous systems (2EXPTIME-complete for CTL* and EXPTIME-complete for the mu-calculus) if we assume a full scheduler (i.e., a scheduler that allows every possible scheduling), and exponentially more expensive for asynchronous systems without this assumption (3EXPTIME-complete for CTL* and 2EXPTIME-complete for the mu-calculus). While multi-process synthesis for synchronous distributed systems is possible for certain architectures (like pipelines and rings), we show that the synthesis of asynchronous distributed systems is decidable if and only if at most one process implementation is unknown.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

logical mobility and locality types

引用

14th international symposium on logic based program synthesis and transformation

作者： Moody, J Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)3540266550

We present a type theory characterizing the mobility and locality of program terms in a distributed computation. the type theory of our calculus is derived from logical notions of necessity (square A) and possibility (lozenge A) of the modal logic S4 via a Curry-Howard style isomorphism. logical worlds are interpreted as sites for computation, accessibility corresponds to dependency between processes at those sites. Necessity (square A) describes terms of type A which have a structural kind of mobility or location-independence. Possibility (lozenge A) describes terms of type A located somewhere, perhaps at a remote site. the modalities square and lozenge are defined in a clean, orthogonal manner, leading to a simple account of mobility and higher-order functions. For illustration, we assume an execution environment with each location distinguished by a mutable store. Here modal types ensure that store addresses never escape from the location where they are defined, eliminating a source of runtime errors. We speculate as to other advantages or trade-offs of this disciplined style of distributed programming.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

From Monomorphic to Polymorphic Well-Typings and Beyond

引用

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

作者： Schrijvers, Tom Bruynooghe, Maurice Gallagher, John P. Dept. of Computer Science K.U.Leuven Belgium Dept. of Computer Science Roskilde University Denmark

ISBN: (纸本)9783642005145

Type information has many applications;it can e.g. be used in optimized compilation, termination analysis and error detection. However, logic programs are typically untyped. A well-typed program has the property that it behaves identically on well-typed goals with or without type checking. Hence the automatic inference of a well-typing is worthwhile. Existing inferences are either cheap and inaccurate, or accurate and expensive. By giving up the requirement that all calls to a predicate have types that are instances of a unique polymorphic type but instead allowing multiple polymorphic typings for the same predicate, we obtain a novel strongly-connected-component-based analysis that provides a good compromise between accuracy and computational cost.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A scalable inclusion constraint solver using unification

引用

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

作者： Zhang, Ye Nielson, Flemming Tech Univ Denmark Lyngby Denmark

ISBN: (纸本)9783540787686

We describe a parameterized framework with which users can take advantage of unification over analysis variables to implement efficient or precise analyses, or even both. To be illustrative we instantiate the framework with reaching definition analysis and conduct a systematic evaluation of performance and precision of the analysis. We compare our result with that of a state-of-the-art solver, the Succinct Solver and show our solver is at least 10-times faster than the Succinct Solver. On some benchmarks linearity is reached by the use of unification. Although the result of unification is often imprecise, a heuristic study is conducted to detect where the loss of precision may happen. We apply the heuristics on benchmarks and achieve not only efficient but also precise analysis.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：