找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic-Based Program Synthesis and Transformation; 21st International S Germán Vidal Conference proceedings 2012 Springer-Verlag Berlin Heid

[复制链接]
查看: 20531|回复: 56
发表于 2025-3-21 19:17:24 | 显示全部楼层 |阅读模式
书目名称Logic-Based Program Synthesis and Transformation
副标题21st International S
编辑Germán Vidal
视频video
概述State of the art research.Fast track conference proceedings.Up to date results
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Logic-Based Program Synthesis and Transformation; 21st International S Germán Vidal Conference proceedings 2012 Springer-Verlag Berlin Heid
描述This book constitutes the thoroughly refereed proceedings of the 21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011, held in Odense, Denmark in July 2011. The 6 revised full papers presented together with 8 additional papers were carefully reviewed and selected from 28 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.
出版日期Conference proceedings 2012
关键词analysis; domain-specific languages; graph transformations; logic programs; semantics
版次1
doihttps://doi.org/10.1007/978-3-642-32211-2
isbn_softcover978-3-642-32210-5
isbn_ebook978-3-642-32211-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

书目名称Logic-Based Program Synthesis and Transformation影响因子(影响力)




书目名称Logic-Based Program Synthesis and Transformation影响因子(影响力)学科排名




书目名称Logic-Based Program Synthesis and Transformation网络公开度




书目名称Logic-Based Program Synthesis and Transformation网络公开度学科排名




书目名称Logic-Based Program Synthesis and Transformation被引频次




书目名称Logic-Based Program Synthesis and Transformation被引频次学科排名




书目名称Logic-Based Program Synthesis and Transformation年度引用




书目名称Logic-Based Program Synthesis and Transformation年度引用学科排名




书目名称Logic-Based Program Synthesis and Transformation读者反馈




书目名称Logic-Based Program Synthesis and Transformation读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:01:51 | 显示全部楼层
Clones in Logic Programs and How to Detect Them,ode clones that could be used for various applications such as program refactoring and plagiarism recognition. Our clone detection algorithm is not tied to a particular logic programming language, and can easily be instantiated for different such languages.
发表于 2025-3-22 02:35:06 | 显示全部楼层
Using Real Relaxations during Program Specialization, model constructed over ℤ. Then, we introduce a strategy which applies the transformation rules for specializing CLP(ℤ) programs with respect to a given query. Finally, we show that our specialization strategy can be applied for verifying properties of infinite state reactive systems specified by constraints over ℤ.
发表于 2025-3-22 06:18:46 | 显示全部楼层
发表于 2025-3-22 10:56:01 | 显示全部楼层
发表于 2025-3-22 13:33:39 | 显示全部楼层
Resource-Driven CLP-Based Test Case Generation, to non-functional aspects of the program. As a further step, we introduce . TDG whose purpose is to guide the TDG process by taking resource consumption into account. Interestingly, given a ., TDG is guided to generate test cases that adhere to the policy and avoid the generation of test cases which violate it.
发表于 2025-3-22 21:08:11 | 显示全部楼层
A Declarative Embedding of XQuery in a Functional-Logic Language,deterministic features of functional-logic languages. As an application of this proposal we show how the typical . techniques of logic languages can be used for generating test-cases for XQuery expressions.
发表于 2025-3-23 00:34:32 | 显示全部楼层
Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees,lity of the technique. In this paper we present a transformation for debugging trees for Maude specifications that ensures that any subterm occurring in a question has been previously replaced by the most reduced form that it has taken during the computation, thus ensuring that questions become as simple as possible.
发表于 2025-3-23 04:47:33 | 显示全部楼层
发表于 2025-3-23 06:10:07 | 显示全部楼层
A Linear Operational Semantics for Termination and Complexity Analysis of ,, such as termination and complexity analysis. We prove that our new semantics is equivalent to the .. semantics, i.e., it computes the same answer substitutions and the derivations in both semantics have essentially the same length.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-23 19:31
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表