E. D. Angelis, F. Fioravanti, A. Pettorossi, M. Proietti
{"title":"Multiple Query Satisfiability of Constrained Horn Clauses","authors":"E. D. Angelis, F. Fioravanti, A. Pettorossi, M. Proietti","doi":"10.48550/arXiv.2211.15207","DOIUrl":"https://doi.org/10.48550/arXiv.2211.15207","url":null,"abstract":". We address the problem of checking the satisfiability of a set of constrained Horn clauses (CHCs) possibly including more than one query. We propose a transformation technique that takes as input a set of CHCs, including a set of queries, and returns as output a new set of CHCs, such that the transformed CHCs are satisfiable if and only if so are the original ones, and the transformed CHCs incorporate in each new query suitable information coming from the other ones so that the CHC satisfiability algorithm is able to exploit the relationships among all queries. We show that our proposed technique is effective on a non trivial benchmark of sets of CHCs that encode many verification problems for programs manipulating algebraic data types such as lists and trees.","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"344 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123400013","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}
{"title":"Program Synthesis Using Example Propagation","authors":"N. Mulleners, J. Jeuring, B. Heeren","doi":"10.48550/arXiv.2210.13873","DOIUrl":"https://doi.org/10.48550/arXiv.2210.13873","url":null,"abstract":"We present Scrybe, an example-based synthesis tool for a statically-typed functional programming language, which combines top-down deductive reasoning in the style of $lambda^2$ with Smyth-style live bidirectional evaluation. During synthesis, example constraints are propagated through sketches to prune and guide the search. This enables Scrybe to make more effective use of functions provided in the context. To evaluate our tool, it is run on the combined, largely disjoint, benchmarks of $lambda^2$ and Myth. Scrybe is able to synthesize most of the combined benchmark tasks.","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127797671","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}
{"title":"Execution Time Program Verification With Tight Bounds","authors":"Ana Carolina Silva, M. Barbosa, Mário Florido","doi":"10.48550/arXiv.2210.11105","DOIUrl":"https://doi.org/10.48550/arXiv.2210.11105","url":null,"abstract":"This paper presents a proof system for reasoning about execution time bounds for a core imperative programming language. Proof systems are defined for three different scenarios: approximations of the worst-case execution time, exact time reasoning, and less pessimistic execution time estimation using amortized analysis. We define a Hoare logic for the three cases and prove its soundness with respect to an annotated cost-aware operational semantics. Finally, we define a verification conditions (VC) generator that generates the goals needed to prove program correctness, cost, and termination. Those goals are then sent to the Easycrypt toolset for validation. The practicality of the proof system is demonstrated with an implementation in OCaml of the different modules needed to apply it to example programs. Our case studies are motivated by real-time and cryptographic software.","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115700581","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}
{"title":"Green Application Placement in the Cloud-IoT Continuum","authors":"Stefano Forti, Antonio Brogi","doi":"10.1007/978-3-030-94479-7_14","DOIUrl":"https://doi.org/10.1007/978-3-030-94479-7_14","url":null,"abstract":"","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122951431","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}
{"title":"On Repairing Web Services Workflows","authors":"T. Nguyen, Enrico Pontelli, Tran Cao Son","doi":"10.1007/978-3-030-39197-3_3","DOIUrl":"https://doi.org/10.1007/978-3-030-39197-3_3","url":null,"abstract":"","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116501951","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}
{"title":"On the Effects of Integrating Region-Based Memory Management and Generational Garbage Collection in ML","authors":"M. Elsman, Niels Hallenberg","doi":"10.1007/978-3-030-39197-3_7","DOIUrl":"https://doi.org/10.1007/978-3-030-39197-3_7","url":null,"abstract":"","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114447232","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}
{"title":"Whitebox Induction of Default Rules Using High-Utility Itemset Mining","authors":"Farhad Shakerin, G. Gupta","doi":"10.1007/978-3-030-39197-3_11","DOIUrl":"https://doi.org/10.1007/978-3-030-39197-3_11","url":null,"abstract":"","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132496171","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}
V. Nguyen, Yuanlin Zhang, Kwanghee Jung, Wanli Xing, Tommy Dang
{"title":"VRASP: A Virtual Reality Environment for Learning Answer Set Programming","authors":"V. Nguyen, Yuanlin Zhang, Kwanghee Jung, Wanli Xing, Tommy Dang","doi":"10.1007/978-3-030-39197-3_6","DOIUrl":"https://doi.org/10.1007/978-3-030-39197-3_6","url":null,"abstract":"","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130299621","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}
{"title":"RTMLton: An SML Runtime for Real-Time Systems","authors":"B. Shivkumar, Jeffrey C. Murphy, Lukasz Ziarek","doi":"10.1007/978-3-030-39197-3_8","DOIUrl":"https://doi.org/10.1007/978-3-030-39197-3_8","url":null,"abstract":"","PeriodicalId":293413,"journal":{"name":"International Symposium on Practical Aspects of Declarative Languages","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123580964","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}