Journal of Logical and Algebraic Methods in Programming最新文献_第2页

Comparing session type systems derived from linear logic 比较源自线性逻辑的会话类型系统

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-08-22 DOI: 10.1016/j.jlamp.2024.101004

Bas van den Heuvel , Jorge A. Pérez

{"title":"Comparing session type systems derived from linear logic","authors":"Bas van den Heuvel , Jorge A. Pérez","doi":"10.1016/j.jlamp.2024.101004","DOIUrl":"10.1016/j.jlamp.2024.101004","url":null,"abstract":"<div>Session types are a typed approach to message-passing concurrency, where types describe sequences of intended exchanges over channels. Session type systems have been given strong logical foundations via Curry-Howard correspondences with linear logic, a resource-aware logic that naturally captures structured interactions. These logical foundations provide an elegant framework to specify and (statically) verify message-passing processes.In this paper, we rigorously compare different type systems for concurrency derived from the Curry-Howard correspondence between linear logic and session types. We address the main divide between these type systems: the classical and intuitionistic presentations of linear logic. Over the years, these presentations have given rise to separate research strands on logical foundations for concurrency; the differences between their derived type systems have only been addressed informally.To formally assess these differences, we develop <math><mi>π</mi><mrow><mi>ULL</mi></mrow></math>, a session type system that encompasses type systems derived from classical and intuitionistic interpretations of linear logic. Based on a fragment of Girard's Logic of Unity, <math><mi>π</mi><mrow><mi>ULL</mi></mrow></math> provides a basic reference framework: we compare existing session type systems by characterizing fragments of <math><mi>π</mi><mrow><mi>ULL</mi></mrow></math> that coincide with classical and intuitionistic formulations. We analyze the significance of our characterizations by considering the locality principle (enforced by intuitionistic interpretations but not by classical ones) and forms of process composition induced by the interpretations.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"142 ","pages":"Article 101004"},"PeriodicalIF":0.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000580/pdfft?md5=294ab7a9dfc6c75e24cca0d439232106&pid=1-s2.0-S2352220824000580-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142089470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards an efficient implementation of a tableau method for reactive safety specifications 高效实施反应式安全规范的表法

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-08-08 DOI: 10.1016/j.jlamp.2024.101003

Ander Alonso , Montserrat Hermo , Josu Oca

引用次数: 0

Towards the exact complexity of realizability for Safety LTL 实现安全 LTL 可实现性的精确复杂性

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-07-31 DOI: 10.1016/j.jlamp.2024.101002

Noel Arteche , Montserrat Hermo

{"title":"Towards the exact complexity of realizability for Safety LTL","authors":"Noel Arteche , Montserrat Hermo","doi":"10.1016/j.jlamp.2024.101002","DOIUrl":"10.1016/j.jlamp.2024.101002","url":null,"abstract":"<div>We study the realizability and strong satisfiability problems for SafetyLTL, a syntactic fragment of Linear Temporal Logic (<figure><img></figure>) capturing safe formulas. While it is well-known that realizability for this fragment lies in <figure><img></figure>, the best-known lower bound is <figure><img></figure>-hardness. Surprisingly, closing this gap has proven an elusive task. Previous works have claimed first <figure><img></figure>-completeness [1] and later <figure><img></figure>-completeness [2] for this problem, but both of these proofs turned out to be incorrect.We revisit the problem of the exact classification of the complexity of realizability for <figure><img></figure> through the lens of seemingly weaker fragments. While we cannot settle the question for <figure><img></figure>, we study a subfragment of it consisting of formulas of the form <figure><img></figure>, where α is a present formula over system variables and ψ contains Next as the only temporal operator. We prove that the realizability problem for this new fragment, which we call <figure><img></figure>, is <figure><img></figure>-complete, and observe that this fragment is equirealizable to existing more expressive fragments, such as the class <figure><img></figure> [3].Furthermore, we revisit the techniques used in the purported proof of <figure><img></figure>-completeness of Arteche and Hermo [1], and observe that, while incorrect in their original claims, their proofs can be modified to classify the complexity of strong satisfiability, a necessary condition for realizability introduced by Kupferman, Sadigh, and Seshia [4]. We prove that, with regards to strong satisfiability, the fragments <figure><img></figure> and <figure><img></figure> are in fact equivalent under polynomial-time many-one reductions.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 101002"},"PeriodicalIF":0.7,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient analysis of belief properties in process algebra 过程代数中信念属性的高效分析

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-07-08 DOI: 10.1016/j.jlamp.2024.101001

Zahra Moezkarimi , Fatemeh Ghassemi

{"title":"Efficient analysis of belief properties in process algebra","authors":"Zahra Moezkarimi , Fatemeh Ghassemi","doi":"10.1016/j.jlamp.2024.101001","DOIUrl":"10.1016/j.jlamp.2024.101001","url":null,"abstract":"<div>Protocols are typically specified in an operational manner by specifying the communication patterns among the different involved principals. However, many properties are of epistemic nature, e.g., what each principal believes after having seen a run of the protocol. We elaborate on a unified algebraic framework suitable for epistemic reasoning about operational protocols. This reasoning framework is based on a logic of beliefs and allows for the operational specification of untruthful communications. The information recorded in the semantic models to support reasoning about the interaction between the operational and epistemic aspects intensifies the state-space explosion. We propose an efficient on-the-fly reduction for such a unifying framework by providing a set of operational rules. These operational rules automatically generate efficient reduced semantics for a class of epistemic properties, specified in a rich extension of modal μ-calculus with past and belief modality, and can potentially reduce an infinite state space into a finite one. We reformulate and prove criteria that guarantee belief consistency for credulous agents, i.e., agents that are ready to believe what is told unless it is logically inconsistent. We adjust our reduction so that the belief consistency of an original model is preserved. We prove the soundness and completeness result for the specified class of properties.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 101001"},"PeriodicalIF":0.7,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141638494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

When causality meets fairness: A survey 当因果关系遇上公平一项调查

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-06-20 DOI: 10.1016/j.jlamp.2024.101000

Karima Makhlouf , Sami Zhioua , Catuscia Palamidessi

{"title":"When causality meets fairness: A survey","authors":"Karima Makhlouf , Sami Zhioua , Catuscia Palamidessi","doi":"10.1016/j.jlamp.2024.101000","DOIUrl":"https://doi.org/10.1016/j.jlamp.2024.101000","url":null,"abstract":"<div>Addressing the problem of fairness is crucial to safely using machine learning algorithms to support decisions that have a critical impact on people's lives, such as job hiring, child maltreatment, disease diagnosis, loan granting, etc. Several notions of fairness have been defined and examined in the past decade, such as statistical parity and equalized odds. However, the most recent notions of fairness are causal-based and reflect the now widely accepted idea that using causality is necessary to appropriately address the problem of fairness. This paper examines an exhaustive list of causal-based fairness notions and studies their applicability in real-world scenarios. As most causal-based fairness notions are defined in terms of non-observable quantities (e.g., interventions and counterfactuals), their deployment in practice requires computing or estimating those quantities using observational data. This paper offers a comprehensive report of the different approaches to infer causal quantities from observational data, including identifiability (Pearl's SCM framework) and estimation (potential outcome framework). The main contributions of this survey paper are (1) a guideline to help select a suitable causal fairness notion given a specific real-world scenario and (2) a ranking of the fairness notions according to Pearl's causation ladder, indicating how difficult it is to deploy each notion in practice.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 101000"},"PeriodicalIF":0.7,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141486837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Formal definitions and proofs for partial (co)recursive functions 部分（共）递归函数的形式定义和证明

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-06-17 DOI: 10.1016/j.jlamp.2024.100999

Horaţiu Cheval , David Nowak , Vlad Rusu

引用次数: 0

Advancing orchestration synthesis for contract automata 推进合约自动机的协调合成

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-06-15 DOI: 10.1016/j.jlamp.2024.100998

Davide Basile, Maurice H. ter Beek

{"title":"Advancing orchestration synthesis for contract automata","authors":"Davide Basile, Maurice H. ter Beek","doi":"10.1016/j.jlamp.2024.100998","DOIUrl":"10.1016/j.jlamp.2024.100998","url":null,"abstract":"<div>Contract automata allow to formally define the behaviour of service contracts in terms of service offers and requests, some of which are moreover optional and some of which are necessary. A composition of contracts is said to be in agreement if all service requests are matched by corresponding offers. Whenever a composition of contracts is not in agreement, it can be refined to reach an agreement using the orchestration synthesis algorithm. This algorithm is a variant of the synthesis algorithm used in supervisory control theory and it is based on the fact that optional transitions are controllable, whereas necessary transitions are at most semi-controllable and cannot always be controlled. In this paper, we present advancements of the orchestration synthesis for contract automata. Notably, we identify the existing limits of the orchestration synthesis and propose a novel orchestration synthesis along with additional constructs to enhance the expressiveness and scalability of contract automata. The proposed advancements have been implemented and experimented on two case studies, one of which originates from the railway domain and the other is a card game.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 100998"},"PeriodicalIF":0.7,"publicationDate":"2024-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141398517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A logical approach to graph databases 图形数据库的逻辑方法

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-06-13 DOI: 10.1016/j.jlamp.2024.100997

Elvira Pino, Fernando Orejas, Nikos Mylonakis, Edelmira Pasarella

{"title":"A logical approach to graph databases","authors":"Elvira Pino, Fernando Orejas, Nikos Mylonakis, Edelmira Pasarella","doi":"10.1016/j.jlamp.2024.100997","DOIUrl":"10.1016/j.jlamp.2024.100997","url":null,"abstract":"<div>Graph databases are now playing an important role because they allow us to overcome some limitations of relational databases. In particular, in graph databases we are interested not only on the data contained but also on its topology. As a consequence, most graph database queries are navigational, asking whether some nodes are connected by edges or paths.Up to now, most foundational work has concentrated on the study of computational models and query languages, analyzing their expressivity, computability, and complexity. However, in our work we address a different kind of foundational work. We are not concerned with expressibility, efficiency or feasibility issues, but with correctness. More precisely, given an algorithm or an implementation for solving queries, how can we be sure that the answers obtained are correct (soundness) and that all possible correct answers are obtained by our implementation (completeness).In this sense, in this paper we first present a core query language, similar to Cypher or G-Core. Then, we define a simple logic whose formulas are precisely the database queries, and whose satisfaction relation defines what is a correct answer. Finally, we define an operational semantics, which could be seen as an abstract implementation of our language, showing that the semantics is correct, i.e. sound and complete with respect to our logic.</div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 100997"},"PeriodicalIF":0.9,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141404297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimizing term rewriting with creeper trace transducers 利用爬行跟踪转换器优化术语重写

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-31 DOI: 10.1016/j.jlamp.2024.100987

Rick Erkens

引用次数: 0

A logical account of subtyping for session types 会话类型子类型的逻辑说明

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-28 DOI: 10.1016/j.jlamp.2024.100986

Ross Horne , Luca Padovani

引用次数: 0