Luís Cruz-Filipe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Luís Cruz-Filipe has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Peter Schneider-Kamp
University of Southern Denmark
22 shared publications - Fabrizio Montesi
University of Southern Denmark, Denmark
16 shared publications - Isabel Nunes
University of Lisbon
13 shared publications - Graça Gaspar
University of Lisbon
11 shared publications - Michael Codish
Ben-Gurion University of the Negev
9 shared publications - Marco Peressotti
University of Southern Denmark, Odense, Denmark
5 shared publications
Latest Publications
- Open Access
- 17 January 2025
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 93 (5) , 727-758
Can’t you answer while you wait?
Many modern-day systems rely on information that is constantly arriving, and they need to make decisions based on it – a problem known as continuous query answering . In many situations, these systems can benefit from identifying possible outcomes that are consistent with the data available so far. Such scenarios are called hypothetical answers , and previous work has defined them precisely and shown how they can be updated in step with the arrival of additional input. Most existing formalisms assume that data always arrives instantaneously, which is not realistic. In this work, we relax this problem by allowing data to arrive later, and potentially out of order. By revisiting the underlying intuitions in previous work, we develop a more general framework that supports communication delays. The interaction between communication delays and negation poses some challenging problems, which we address using fixpoint theory. We show that the relevant fixpoints can be computed in finite time by a carefully designed algorithm.
- 17 January 2025
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 93 (5) , 727-758
Open AccessCan’t you answer while you wait?
Many modern-day systems rely on information that is constantly arriving, and they need to make decisions based on it – a problem known as continuous query answering . In many situations, these systems can benefit from identifying possible outcomes that are consistent with the data available so far. Such scenarios are called hypothetical answers , and previous work has defined them precisely and shown how they can be updated in step with the arrival of additional input. Most existing formalisms assume that data always arrives instantaneously, which is not realistic. In this work, we relax this problem by allowing data to arrive later, and potentially out of order. By revisiting the underlying intuitions in previous work, we develop a more general framework that supports communication delays. The interaction between communication delays and negation poses some challenging problems, which we address using fixpoint theory. We show that the relevant fixpoints can be computed in finite time by a carefully designed algorithm.
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 25 (4) , 1-40
Hypothetical Answers to Continuous Queries Over Data Streams
Answers to continuous queries over data streams are often delayed until some relevant input arrives through the data stream. These delays may turn answers when they arrive, obsolete to users who sometimes have to make decisions with no help whatsoever. Therefore, it can be useful to provide hypothetical answers—“given the current information, it is possible that \(X\) will become true at time \(t\) ”—instead of no information at all. In this work, we present a semantics for queries and corresponding answers that cover such hypothetical answers, together with an incremental online algorithm for updating the set of facts that are consistent with the currently available information. Our framework also works in a language supporting negation.- 29 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 25 (4) , 1-40
Open AccessHypothetical Answers to Continuous Queries Over Data Streams
Answers to continuous queries over data streams are often delayed until some relevant input arrives through the data stream. These delays may turn answers when they arrive, obsolete to users who sometimes have to make decisions with no help whatsoever. Therefore, it can be useful to provide hypothetical answers—“given the current information, it is possible that \(X\) will become true at time \(t\) ”—instead of no information at all. In this work, we present a semantics for queries and corresponding answers that cover such hypothetical answers, together with an incremental online algorithm for updating the set of facts that are consistent with the currently available information. Our framework also works in a language supporting negation. - Open Access
- 24 July 2024
- Published by Springer Nature in Computing
- Vol. 106 (11) , 3419-3445
$\mu $XL: explainable lead generation with microservices and hypothetical answersLead generation refers to the identification of potential topics (the ‘leads’) of importance for journalists to report on. In this article we present $$\mu $$ XL, a new lead generation tool based on a microservice architecture that includes a component of explainable AI. $$\mu $$ XL collects and stores historical and real-time data from web sources, like Google Trends, and generates current and future leads. Leads are produced by a novel engine for hypothetical reasoning based on temporal logical rules, which can identify propositions that may hold depending on the outcomes of future events. This engine also supports additional features that are relevant for lead generation, such as user-defined predicates (allowing useful custom atomic propositions to be defined as Java functions) and negation (needed to specify and reason about leads characterized by the absence of specific properties). Our microservice architecture is designed using state-of-the-art methods and tools for API design and implementation, namely API patterns and the Jolie programming language. Thus, our development provides an additional validation of their usefulness in a new application domain (journalism). We also carry out an empirical evaluation of our tool.- 24 July 2024
- Published by Springer Nature in Computing
- Vol. 106 (11) , 3419-3445
Open Access$\mu $XL: explainable lead generation with microservices and hypothetical answersLead generation refers to the identification of potential topics (the ‘leads’) of importance for journalists to report on. In this article we present $$\mu $$ XL, a new lead generation tool based on a microservice architecture that includes a component of explainable AI. $$\mu $$ XL collects and stores historical and real-time data from web sources, like Google Trends, and generates current and future leads. Leads are produced by a novel engine for hypothetical reasoning based on temporal logical rules, which can identify propositions that may hold depending on the outcomes of future events. This engine also supports additional features that are relevant for lead generation, such as user-defined predicates (allowing useful custom atomic propositions to be defined as Java functions) and negation (needed to specify and reason about leads characterized by the absence of specific properties). Our microservice architecture is designed using state-of-the-art methods and tools for API design and implementation, namely API patterns and the Jolie programming language. Thus, our development provides an additional validation of their usefulness in a new application domain (journalism). We also carry out an empirical evaluation of our tool. - 22 May 2024
- Published by Springer Nature
- p. 84-99
Approximation Fixpoint Theory in Coq
- 12 October 2023
- Published by Springer Nature
- p. 3-18
$\mu $XL: Explainable Lead Generation with Microservices and Hypothetical Answers- 12 October 2023
- Published by Springer Nature
- p. 3-18
$\mu $XL: Explainable Lead Generation with Microservices and Hypothetical Answers- Open Access
- 27 May 2023
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 67 (2) , 1-34
A Formal Theory of Choreographic Programming
Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correct-by-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.
- 27 May 2023
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 67 (2) , 1-34
Open AccessA Formal Theory of Choreographic Programming
Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correct-by-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.
- Open Access
Reasoning about Choreographic Programs
Choreographic programming is a paradigm where a concurrent or distributed system is developed in a top-down fashion. Programs, called choreographies, detail the desired interactions between processes, and can be compiled to distributed implementations based on message passing. Choreographic languages usually guarantee deadlock-freedom and provide an operational correspondence between choreographies and their compiled implementations, but until now little work has been done on verifying other properties. This paper presents a Hoare-style logic for reasoning about the behaviour of choreographies, and illustrate its usage in representative examples. We show that this logic is sound and complete, and discuss decidability of its judgements. Using existing results from choreographic programming, we show that any functional correctness property proven for a choreography also holds for its compiled implementation.
Open AccessReasoning about Choreographic Programs
Choreographic programming is a paradigm where a concurrent or distributed system is developed in a top-down fashion. Programs, called choreographies, detail the desired interactions between processes, and can be compiled to distributed implementations based on message passing. Choreographic languages usually guarantee deadlock-freedom and provide an operational correspondence between choreographies and their compiled implementations, but until now little work has been done on verifying other properties. This paper presents a Hoare-style logic for reasoning about the behaviour of choreographies, and illustrate its usage in representative examples. We show that this logic is sound and complete, and discuss decidability of its judgements. Using existing results from choreographic programming, we show that any functional correctness property proven for a choreography also holds for its compiled implementation.