ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming最新文献

筛选
英文 中文
Unveiling and Veiling Information in Programs 在程序中揭示和隐藏信息
R. Giacobazzi
{"title":"Unveiling and Veiling Information in Programs","authors":"R. Giacobazzi","doi":"10.1145/2643135.2643137","DOIUrl":"https://doi.org/10.1145/2643135.2643137","url":null,"abstract":"In this extended abstract we survey the most recent developments in code obfuscation and protection from a programming languages perspective. Starting from known impossibility results on universal and general purpose code obfuscation, we show that provably secure obfuscation can be achieved by constraining the attack model. This corresponds to associate attacks with suitable forms of interpretation. In this context it is always possible to systematically making code obscure, making this interpretation failing in extracting (attacking) code. The code transformation can itself be specified as the specialization of a distorted interpreter.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs 执行线性逻辑程序的多线程虚拟机的设计与实现
Flávio Cruz, Ricardo Rocha, S. Goldstein
{"title":"Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs","authors":"Flávio Cruz, Ricardo Rocha, S. Goldstein","doi":"10.1145/2643135.2643150","DOIUrl":"https://doi.org/10.1145/2643135.2643150","url":null,"abstract":"Linear Meld is a concurrent forward-chaining linear logic programming language where logical facts can be asserted and retracted in a structured way. In Linear Meld, a program is seen as a database of logical facts and a set of derivation rules. The database of facts is partitioned by the nodes of a graph structure which leads to parallelism when nodes are executed simultaneously. Due to the foundations on linear logic, rules can retract facts in a declarative and structured fashion, leading to more expressive programs. We present the design and implementation of the virtual machine that we implemented to run Linear Meld on multicores, with particular focus on thread management, code organization, fact indexing, rule execution, and database organization for efficient fact insertion, lookup and deletion. Our results show that the virtual machine is capable of scaling programs with up to 16 threads and also exhibits interesting scalar performance results due to our indexing optimizations.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124019325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Decision Procedures for Proving Inductive Theorems without Induction 不归纳法证明归纳定理的判定程序
Takahito Aoto, Sorin Stratulat
{"title":"Decision Procedures for Proving Inductive Theorems without Induction","authors":"Takahito Aoto, Sorin Stratulat","doi":"10.1145/2643135.2643156","DOIUrl":"https://doi.org/10.1145/2643135.2643156","url":null,"abstract":"Automated inductive reasoning for term rewriting has been extensively studied in the literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive validity have been identified and used to automatize the inductive reasoning. We give procedures for deciding the inductive validity of equations in some standard TRSs on natural numbers and lists. Contrary to previous decidability results, our procedures can automatically decide without involving induction reasoning the inductive validity of arbitrary equations for these TRSs, that is, without imposing any syntactical restrictions on the form of equations. We also report on the complexity of our decision procedures. These decision procedures are implemented in our automated provers for inductive theorems of TRSs and experiments are reported.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115758107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Organising Low-Level Programs using Higher Types 使用高级类型组织低级程序
Ulrich Schöpp
{"title":"Organising Low-Level Programs using Higher Types","authors":"Ulrich Schöpp","doi":"10.1145/2643135.2643151","DOIUrl":"https://doi.org/10.1145/2643135.2643151","url":null,"abstract":"Type systems that allow control over low-level compilation details have been developed in the context of resource aware compilation, e.g. for circuit synthesis or for programming with logarithmic space. It was recently observed that some compilation techniques developed in this context, while motivated by capturing certain resource usage restrictions, are closely related to standard compilation techniques, such as CPS translation and defunctionalization. Previous results of this kind suggest to investigate type systems for resource aware compilation more generally with regard to their applicability to structuring general low-level languages, e.g. as used in compilers.\u0000 In this paper we study how ideas developed for the LOGSPACE type system INTML can be used for organising the programs in a first-order low-level language. We do so using a type system that simplifies and extends INTML, in particular with parametric polymorphism. The type system is simple but flexible, allowing the definition of combinators, such as for tail recursion, recursion, mutable variables or coroutines, in the language itself. We show that it supports separate compilation and consider its performance using an experimental implementation. For reasoning about the low-level programs represented in the type system, we develop an equational theory based on relational parametricity.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134549092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Real-Time Matching of Antescofo Temporal Patterns Antescofo时间模式的实时匹配
Jean-Louis Giavitto, José Echeveste
{"title":"Real-Time Matching of Antescofo Temporal Patterns","authors":"Jean-Louis Giavitto, José Echeveste","doi":"10.1145/2643135.2643158","DOIUrl":"https://doi.org/10.1145/2643135.2643158","url":null,"abstract":"This paper presents Antescofo temporal patterns (ATP) and their online matching. Antescofo is a real-time system for performance coordination between musicians and computer processes during live music concert. ATP are used to define complex events that correspond to a combination of perceived events in the musical environment as well as arbitrary logical and metrical temporal conditions. The real-time recognition of such event is used to trigger arbitrary actions in the style of event-condition-action rules. The musical context, the rationales of temporal patterns and several illustrative examples are introduced to motivate the design of ATP. The semantics of ATP matching is defined to parallel the well-known notion of regular expression and Brzozowski's derivatives but extended to handle an infinite alphabet, arbitrary predicates, elapsing time and inhibitory conditions. This approach is compared to those developed in log auditing and for the runtime verification of realtime logics. ATP are implemented by translation into a core subset of the Antescofo domain-specific language. This compilation has proven efficient enough to avoid the extension of the real-time runtime of the language and has been validated with composers in actual pieces.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131381230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes 用于递归方案安全检查的精确交型抽象
S. Ramsay
{"title":"Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes","authors":"S. Ramsay","doi":"10.1145/2643135.2643142","DOIUrl":"https://doi.org/10.1145/2643135.2643142","url":null,"abstract":"Higher-order recursion schemes are a class of higher-order programs built from a collection of first-order constants using higher-order functions and general recursion. Since the trees that they define have many decidable properties, they have become widely studied in the context of the verification through higher-order model checking.\u0000 We present a new semantic framework, in which recursion schemes can be extended by interpreted constants that are modelled concretely as a continuous function over domains and abstractly as an intersection type. When the intersection type of each constant is shown to be an exact abstract interpretation of the concrete semantics of that constant then intersection type assignment will characterise safety property checking for arbitrary terms. Since we focus on finite intersection type systems, decidability of the property checking problem is an immediate corollary.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126339038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Declarative Game Programming: Distilled Tutorial 声明式游戏编程:精炼教程
H. Nilsson, Ivan Perez
{"title":"Declarative Game Programming: Distilled Tutorial","authors":"H. Nilsson, Ivan Perez","doi":"10.1145/2643135.2643160","DOIUrl":"https://doi.org/10.1145/2643135.2643160","url":null,"abstract":"Video games are usually not programmed very declaratively. There are a number of reasons for this, from low-level efficiency concerns, via the nature of commonly employed programming languages, libraries, and frameworks, to the conceptual nature of such games, with state and effects being omnipresent. However, by structuring games in terms of time-varying values and transformations on such values, it is possible to design and implement video games in a more declarative way. This tutorial shows how this can be achieved through Functional Reactive Programming (FRP) by implementing the high-level parts of a 2D game akin to the classical game Breakout. The tutorial uses the Haskell-embedded FRP implementation Yampa and bindings to SDL (Simple DirectMedia Layer) to obtain game play and visual standards typical of the 2D genre; for example, as seen in many currently popular games for smartphones and tablets.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Proving Operational Termination of Declarative Programs in General Logics 一般逻辑中声明性程序的运算终止证明
Salvador Lucas, J. Meseguer
{"title":"Proving Operational Termination of Declarative Programs in General Logics","authors":"Salvador Lucas, J. Meseguer","doi":"10.1145/2643135.2643152","DOIUrl":"https://doi.org/10.1145/2643135.2643152","url":null,"abstract":"A declarative program P is a theory in a given computational logic L, so that computation with such a program is efficiently implemented as deduction in L. That is why inference systems are crucial: they both (i) define the logical semantics of a language in its underlying logic L, and (ii) specify the execution of programs in a correct implementation. The notion of operational termination (OT) of a declarative program P identifies termination with absence of infinite inference with P. We further develop the OT notion for declarative programs in general logics with schematic inference systems and characterize OT in terms of chains of proof jumps. We also generalize the Dependency Pair Framework for Term Rewriting Systems to an arbitrary schematic logic L, so that methods for proving declarative programs OT become available for a very wide range of declarative languages. We illustrate the usefulness of the general OT methods we propose by three case studies in three logics: that of Conditional Term Rewriting Systems, the Typed λ-calculus, and Membership Rewriting Logic. In particular, we show how various programs that could not be proved terminating with existing methods can be proved OT with the methods presented here.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114290057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Elimination of Square Roots and Divisions by Partial Inlining 用部分内联法消去平方根和除法
P. Néron
{"title":"Elimination of Square Roots and Divisions by Partial Inlining","authors":"P. Néron","doi":"10.1145/2643135.2643140","DOIUrl":"https://doi.org/10.1145/2643135.2643140","url":null,"abstract":"Computing accurately with real numbers is always a challenge. This is particularly true in critical embedded systems since memory issues do not allow the use of dynamic data structures. This constraint imposes a finite representation of the real numbers, provoking uncertainties and rounding errors that might modify the actual behavior of a program from its ideal one. This article presents a solution to this problem with a program transformation that eliminates square roots and divisions in straight line programs without nested function calls. These two operations are the source of infinite sequences of digits in numerical representations, thus, eliminating these operations allows to compute exactly using for example a fixed-point number representation with a sufficient number of bits. In order to avoid an explosion of the size of the produced code this transformation relies on a particular anti-unification to realize a partial inlining of the variable and function definitions. This transformation targeting code for aeronautics certified in PVS, we want to prove the semantics preservation in this proof assistant. Thus we use both an OCaml implementation and the subtyping features of PVS to ensure the correctness of the transformation by defining a proof-producing (certifying) program transformation, providing a specific semantics preservation lemma for every definition in the transformed program.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126452513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation 启发式与处理程序的结合:从功能规范到逻辑编程实现
T. Schrijvers, Nicolas Wu, Benoit Desouter, Bart Demoen
{"title":"Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation","authors":"T. Schrijvers, Nicolas Wu, Benoit Desouter, Bart Demoen","doi":"10.1145/2643135.2643145","DOIUrl":"https://doi.org/10.1145/2643135.2643145","url":null,"abstract":"A long-standing problem in logic programming is how to cleanly separate logic and control. While solutions exist, they fall short in one of two ways: some are too intrusive, because they require significant changes to Prolog's underlying implementation; others are lacking a clean semantic grounding. We resolve both of these issues in this paper.\u0000 We derive a solution that is both lightweight and principled. We do so by starting from a functional specification of Prolog based on monads, and extend this with the effect handlers approach to capture the dynamic search tree as syntax. Effect handlers then express heuristics in terms of tree transformations. Moreover, we can declaratively express many heuristics as trees themselves that are combined with search problems using a generic entwining handler. Our solution is not restricted to a functional model: we show how to implement this technique as a library in Prolog by means of delimited continuations.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124326805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书