Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming最新文献

Towards execution time estimation in abstract machine-based languages 面向抽象机器语言的执行时间估计

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389471

E. Mera, P. López-García, M. Carro, M. Hermenegildo

{"title":"Towards execution time estimation in abstract machine-based languages","authors":"E. Mera, P. López-García, M. Carro, M. Hermenegildo","doi":"10.1145/1389449.1389471","DOIUrl":"https://doi.org/10.1145/1389449.1389471","url":null,"abstract":"Abstract machines provide a certain separation between platform-dependent and platform-independent concerns in compilation. Many of the differences between architectures are encapsulated in the specific abstract machine implementation and the bytecode is left largely architecture independent. Taking advantage of this fact, we present a framework for estimating upper and lower bounds on the execution times of logic programs running on a bytecode-based abstract machine. Our approach includes a one-time, program-independent profiling stage which calculates constants or functions bounding the execution time of each abstract machine instruction. Then, a compile-time cost estimation phase, using the instruction timing information, infers expressions giving platform-dependent upper and lower bounds on actual execution time as functions of input data sizes for each program. Working at the abstract machine level makes it possible to take into account low-level issues in new architectures and platforms by just reexecuting the calibration stage instead of having to tailor the analysis for each architecture and platform. Applications of such predicted execution times include debugging/verification of time properties, certification of time properties in mobile code, granularity control in parallel/distributed computing, and resource-oriented specialization","PeriodicalId":248980,"journal":{"name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127144517","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}

引用次数: 23

A rewriting framework for the composition of access control policies 用于组合访问控制策略的重写框架

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389476

Clara Bertolissi, M. Fernández

引用次数: 31

Comparing tag scheme variations using an abstract machine generator 使用抽象机器生成器比较标签方案的变化

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389455

J. Morales, M. Carro, M. Hermenegildo

{"title":"Comparing tag scheme variations using an abstract machine generator","authors":"J. Morales, M. Carro, M. Hermenegildo","doi":"10.1145/1389449.1389455","DOIUrl":"https://doi.org/10.1145/1389449.1389455","url":null,"abstract":"In this paper we study, in the context of a WAM-based abstract machine for Prolog, how variations in the encoding of type information in tagged words and in their associated basic operations impact performance and memory usage.We use a high-level language to specify encodings and the associated operations. An automatic generator constructs both the abstract machine using this encoding and the associated Prolog-to-bytecode compiler. Annotations in this language make it possible to impose constraints on the final representation of tagged words, such as the effectively addressable space (fixing, for example, the word size of the target processor / architecture), the layout of the tag and value bits inside the tagged word, and how the basic operations are implemented. We evaluate a large number of combinations of the different parameters in two scenarios: a) trying to obtain an optimal general-purpose abstract machine and b) automatically generating a specially-tuned abstract machine for a particular program. We conclude that we are able to automatically generate code featuring all the optimizations present in a hand-written, highly-optimized abstract machine and we can also obtain emulators with larger addressable space and better performance","PeriodicalId":248980,"journal":{"name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","volume":"30 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114098421","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

Programming with proofs and explicit contexts 使用证明和显式上下文进行编程

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389469

B. Pientka, Jana Dunfield

引用次数: 77

Cooperation of constraint domains in the TOY system TOY系统中约束域的协同

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389481

Sonia Estévez Martín, Antonio J. Fernández, Maria Teresa Hortalá-González, M. Rodríguez-Artalejo, F. Sáenz-Pérez, Rafael del Vado Vírseda

引用次数: 1

Model-driven constraint programming 模型驱动约束规划

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389479

R. Chenouard, Laurent Granvilliers, Ricardo Soto

引用次数: 31

Classifying integrity checking methods with regard to inconsistency tolerance 基于不一致容忍度的完整性检查方法分类

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389474

H. Decker, D. Martinenghi

引用次数: 32

The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security 通用定时CCP的表达性:一元FLTL和安全闭包算子的不可判定性

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389452

C. Olarte, F. Valencia

{"title":"The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security","authors":"C. Olarte, F. Valencia","doi":"10.1145/1389449.1389452","DOIUrl":"https://doi.org/10.1145/1389449.1389452","url":null,"abstract":"The timed concurrent constraint programing model (tcc) is a declarative framework, closely related to First-Order Linear Temporal Logic (FLTL), for modeling reactive systems. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. This paper is devoted to the study of 1) the expressiveness of utcc and 2) its semantic foundations. As applications of this study, we also state 3) a noteworthy decidability result for the wellestablished framework of FLTL and 4) bring new semantic insights into the modeling of security protocols. More precisely, we show that in contrast to tcc, utcc is Turingpowerful by encoding Minsky machines. The encoding uses a monadic constraint system allowing us to prove a new result for a fragment of FLTL: The undecidability of the validity problem for monadic FLTL without equality and function symbols. This result refutes a decidability conjecture for FLTL from a previous paper. It also justifies the restriction imposed in previous decidability results on the quantification of flexible-variables. We shall also show that as in tcc, utcc processes can be semantically represented as partial closure operators. The representation is fully abstract wrt the input-output behavior of processes for a meaningful fragment of the utcc. This shows that mobility can be captured as closure operators over an underlying constraint system. As an application we identify a language for security protocols that can be represented as closure operators over a cryptographic constraint system.","PeriodicalId":248980,"journal":{"name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123477398","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}

引用次数: 30

Fixed point semantics and partial recursion in Coq Coq中的不动点语义和部分递归

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389461

Yves Bertot, Vladimir Komendantsky

引用次数: 25

A type system for safe memory management and its proof of correctness 一种用于安全内存管理的类型系统及其正确性证明

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming Pub Date : 2008-07-15 DOI: 10.1145/1389449.1389468

Manuel Montenegro, Ricardo Peña-Marí, Clara Segura

引用次数: 23