发布求助
文献互助 智能选刊 最新文献

DICE-FOPARA@ETAPS最新文献

筛选
英文 中文
Applications of Linear Defeasible Logic: combining resource consumption and exceptions to energy management and business processes 线性可废止逻辑的应用:将资源消耗和能源管理和业务流程的异常结合起来
DICE-FOPARA@ETAPS Pub Date : 2019-08-14 DOI: 10.4204/EPTCS.298.1
Francesco Olivieri, Guido Governatori, Claudio Tomazzoli, M. Cristani
{"title":"Applications of Linear Defeasible Logic: combining resource consumption and exceptions to energy management and business processes","authors":"Francesco Olivieri, Guido Governatori, Claudio Tomazzoli, M. Cristani","doi":"10.4204/EPTCS.298.1","DOIUrl":"https://doi.org/10.4204/EPTCS.298.1","url":null,"abstract":"Linear Logic and Defeasible Logic have been adopted to formalise different features of knowledge representation: consumption of resources, and non monotonic reasoning in particular to represent exceptions. Recently, a framework to combine sub-structural features, corresponding to the consumption of resources, with defeasibility aspects to handle potentially conflicting information, has been discussed in literature, by some of the authors. Two applications emerged that are very relevant: energy management and business process management. We illustrate a set of guide lines to determine how to apply linear defeasible logic to those contexts.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114188492","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
Type-two Iteration with Bounded Query Revision 具有有界查询修订的二类迭代
DICE-FOPARA@ETAPS Pub Date : 2019-08-14 DOI: 10.4204/EPTCS.298.5
B. Kapron, Florian Steinberg
{"title":"Type-two Iteration with Bounded Query Revision","authors":"B. Kapron, Florian Steinberg","doi":"10.4204/EPTCS.298.5","DOIUrl":"https://doi.org/10.4204/EPTCS.298.5","url":null,"abstract":"Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we consider functionals which capture iteration on input length which bound interaction with the type-one input parameter, by restricting to a constant either the number of times the function parameter may return a value of increasing size, or the number of times the function parameter may be applied to an argument of increasing size. We prove that for any constant bound, the iterators obtained are equivalent, with respect to lambda-definability over type-one poly-time functions, to the recursor of Cook and Urquhart which captures Cobham's notion of limited recursion on notation in this setting.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130897022","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}
引用次数: 3
Towards Practical, Precise and Parametric Energy Analysis of IT Controlled Systems 面向IT控制系统的实用、精确和参数化能量分析
DICE-FOPARA@ETAPS Pub Date : 2017-04-20 DOI: 10.4204/EPTCS.248.7
B. V. Gastel, M. V. Eekelen
{"title":"Towards Practical, Precise and Parametric Energy Analysis of IT Controlled Systems","authors":"B. V. Gastel, M. V. Eekelen","doi":"10.4204/EPTCS.248.7","DOIUrl":"https://doi.org/10.4204/EPTCS.248.7","url":null,"abstract":"Energy consumption analysis of IT-controlled systems can play a major role in minimising the overall energy consumption of such IT systems, during the development phase, or for optimisation in the field. Recently, a precise energy analysis was developed, with the property of being parametric in the hardware. In principle, this creates the opportunity to analyse which is the best software implementation for given hardware, or the other way around: choose the best hardware for a given algorithm. \u0000The precise analysis was introduced for a very limited language: ECA. In this paper, several important steps are taken towards practical energy analysis. The ECA language is extended with common programming language features. The application domain is further explored, and threats to the validity are identified and discussed. Altogether, this constitutes an important step towards analysing energy consumption of IT-controlled systems in practice.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122265315","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}
引用次数: 3
Automated Sized-Type Inference and Complexity Analysis 自动大小类型推断和复杂性分析
DICE-FOPARA@ETAPS Pub Date : 2017-04-19 DOI: 10.4204/EPTCS.248.5
Martin Avanzini, Ugo Dal Lago
{"title":"Automated Sized-Type Inference and Complexity Analysis","authors":"Martin Avanzini, Ugo Dal Lago","doi":"10.4204/EPTCS.248.5","DOIUrl":"https://doi.org/10.4204/EPTCS.248.5","url":null,"abstract":"This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation and a concrete tool for constraint solving. Noticeably, the presented methodology can be fully automated, and is able to analyse a series of examples which cannot be handled by most competitor methodologies. This is possible due to various key ingredients, and in particular an abstract index language and index polymorphism at higher ranks. A prototype implementation is available.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131348518","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
GUBS Upper Bound Solver (Extended Abstract) GUBS上界求解器(扩展摘要)
DICE-FOPARA@ETAPS Pub Date : 2017-04-19 DOI: 10.4204/EPTCS.248.6
Martin Avanzini, Michael Schaper
{"title":"GUBS Upper Bound Solver (Extended Abstract)","authors":"Martin Avanzini, Michael Schaper","doi":"10.4204/EPTCS.248.6","DOIUrl":"https://doi.org/10.4204/EPTCS.248.6","url":null,"abstract":"In this extended abstract we present the GUBS Upper Bound Solver. GUBS is a dedicated constraint solver over the naturals for inequalities formed over uninterpreted function symbols and standard arithmetic operations. GUBS now forms the backbone of HoSA, a tool for analysing space and time complexity of higher-order functional programs automatically. We give insights about the implemen- tation and report different case studies.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116276562","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
Loop Quasi-Invariant Chunk Motion by peeling with statement composition 通过语句组合剥离循环准不变块运动
DICE-FOPARA@ETAPS Pub Date : 2017-04-19 DOI: 10.4204/EPTCS.248.9
Jean-Yves Moyen, Thomas Rubiano, T. Seiller
{"title":"Loop Quasi-Invariant Chunk Motion by peeling with statement composition","authors":"Jean-Yves Moyen, Thomas Rubiano, T. Seiller","doi":"10.4204/EPTCS.248.9","DOIUrl":"https://doi.org/10.4204/EPTCS.248.9","url":null,"abstract":"Several techniques for analysis and transformations are used in compilers. Among them, the peeling of loops for hoisting quasi-invariants can be used to optimize generated code, or simply ease developers' lives. In this paper, we introduce a new concept of dependency analysis borrowed from the field of Implicit Computational Complexity (ICC), allowing to work with composed statements called Chunks to detect more quasi-invariants. Based on an optimization idea given on a WHILE language, we provide a transformation method - reusing ICC concepts and techniques - to compilers. This new analysis computes an invariance degree for each statement or chunks of statements by building a new kind of dependency graph, finds the maximum or worst dependency graph for loops, and recognizes if an entire block is Quasi-Invariant or not. This block could be an inner loop, and in that case the computational complexity of the overall program can be decreased. We already implemented a proof of concept on a toy C parser 1 analysing and transforming the AST representation. In this paper, we introduce the theory around this concept and present a prototype analysis pass implemented on LLVM. In a very near future, we will implement the corresponding transformation and provide benchmarks comparisons.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"56 14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125193520","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
Computability in the Lattice of Equivalence Relations 等价关系格中的可计算性
DICE-FOPARA@ETAPS Pub Date : 2017-04-18 DOI: 10.4204/EPTCS.248.8
Jean-Yves Moyen, J. Simonsen
{"title":"Computability in the Lattice of Equivalence Relations","authors":"Jean-Yves Moyen, J. Simonsen","doi":"10.4204/EPTCS.248.8","DOIUrl":"https://doi.org/10.4204/EPTCS.248.8","url":null,"abstract":"We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time decidable equivalence relations- form sublattices of the lattice.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122740128","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
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学术文献互助群
群 号：481959085
Book学术官方微信