default search action
Luís Cruz-Filipe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j19]Luís Cruz-Filipe, Sofia Kostopoulou, Fabrizio Montesi, Jonas Vistrup:
μXL: explainable lead generation with microservices and hypothetical answers. Computing 106(11): 3419-3445 (2024) - [j18]Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes
:
Hypothetical Answers to Continuous Queries Over Data Streams. ACM Trans. Comput. Log. 25(4): 1-40 (2024) - [c53]Bart Bogaerts
Approximation Fixpoint Theory in Coq - With an Application to Logic Programming. Logics and Type Systems in Theory and Practice 2024: 84-99 - [c52]Luís Cruz-Filipe, Peter Schneider-Kamp:
Minimizing Sorting Networks at the Sub-Comparator Level. LPAR 2024: 36-50 - [i36]Luís Cruz-Filipe, Jonas Vistrup:
færdXel: An Expert System for Danish Traffic Law. CoRR abs/2410.03560 (2024) - 2023
- [j17]Luís Cruz-Filipe, Fabrizio Montesi
A Formal Theory of Choreographic Programming. J. Autom. Reason. 67(2): 21 (2023) - [c51]Luís Cruz-Filipe
Reasoning About Choreographic Programs. COORDINATION 2023: 144-162 - [c50]Luís Cruz-Filipe, Eva Graversen, Lovro Lugovic, Fabrizio Montesi
Modular Compilation for Higher-Order Functional Choreographies. ECOOP 2023: 7:1-7:37 - [c49]Luís Cruz-Filipe
μXL: Explainable Lead Generation with Microservices and Hypothetical Answers. ESOCC 2023: 3-18 - [c48]Luís Cruz-Filipe
Certified Compilation of Choreographies with hacc. FORTE 2023: 29-36 - [c47]Luís Cruz-Filipe, Fabrizio Montesi
Now It Compiles! Certified Automatic Repair of Uncompilable Protocols. ITP 2023: 11:1-11:19 - [c46]Luís Cruz-Filipe, Fabrizio Montesi
Keep me out of the loop: a more flexible choreographic projection. LPAR 2023: 144-163 - [i35]Luís Cruz-Filipe, Fabrizio Montesi:
Now It Compiles! Certified Automatic Repair of Uncompilable Protocols. CoRR abs/2302.14622 (2023) - [i34]Luís Cruz-Filipe, Lovro Lugovic, Fabrizio Montesi:
Certified Compilation of Choreographies with hacc. CoRR abs/2303.03972 (2023) - [i33]Luís Cruz-Filipe, Eva Graversen, Fabrizio Montesi, Marco Peressotti:
Reasoning about Choreographic Programs. CoRR abs/2304.14539 (2023) - 2022
- [c45]Luís Cruz-Filipe
Can You Answer While You Wait? FoIKS 2022: 111-129 - [c44]Luís Cruz-Filipe
Reconciling Communication Delays and Negation. ICTAC 2022: 151-169 - [c43]Luís Cruz-Filipe
Functional Choreographic Programming. ICTAC 2022: 212-237 - [c42]Bjørn Angel Kjær, Luís Cruz-Filipe
From Infinity to Choreographies - Extraction for Unbounded Systems. LOPSTR 2022: 103-120 - [c41]Luís Cruz-Filipe, Anne Madsen, Fabrizio Montesi
Modular Choreographies: Bridging Alice and Bob Notation to Java. Microservices 2022: 3:1-3:18 - [i32]Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi, Larisa Safina:
Implementing Choreography Extraction. CoRR abs/2205.02636 (2022) - [i31]Bjørn Angel Kjær, Luís Cruz-Filipe, Fabrizio Montesi:
From Infinity to Choreographies: Extraction for Unbounded Systems. CoRR abs/2207.08884 (2022) - [i30]Luís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti:
A Formal Theory of Choreographic Programming. CoRR abs/2209.01886 (2022) - 2021
- [j16]Bart Bogaerts
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints. ACM Trans. Comput. Log. 22(1): 6:1-6:19 (2021) - [c40]Luís Cruz-Filipe
Certifying Choreography Compilation. ICTAC 2021: 115-133 - [c39]Luís Cruz-Filipe, Fabrizio Montesi
Formalising a Turing-Complete Choreographic Language in Coq. ITP 2021: 15:1-15:18 - [i29]Luís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti:
Formalising a Turing-Complete Choreographic Language in Coq. CoRR abs/2102.02627 (2021) - [i28]Luís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti:
Certifying Choreography Compilation. CoRR abs/2102.10698 (2021) - [i27]Luís Cruz-Filipe, Eva Graversen, Lovro Lugovic, Fabrizio Montesi, Marco Peressotti:
Choreographies as Functions. CoRR abs/2111.03701 (2021) - 2020
- [j15]Luís Cruz-Filipe
A core model for choreographic programming. Theor. Comput. Sci. 802: 38-66 (2020) - [c38]Luís Cruz-Filipe
Hypothetical Answers to Continuous Queries over Data Streams. AAAI 2020: 2798-2805 - [e1]Luís Cruz-Filipe, Saverio Giallorenzo, Fabrizio Montesi, Marco Peressotti, Florian Rademacher
Joint Post-proceedings of the First and Second International Conference on Microservices, Microservices 2017/2019, October 23-27, 2017, Odense, Denmark / February 19-21, 2019, Dortmund, Germany. OASIcs 78, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-137-5 [contents]
2010 – 2019
- 2019
- [j14]Luís Cruz-Filipe
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem. J. Autom. Reason. 63(3): 695-722 (2019) - [j13]Michael Codish
Sorting networks: To the end and back again. J. Comput. Syst. Sci. 104: 184-201 (2019) - [i26]Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes:
Hypothetical answers to continuous queries over data streams. CoRR abs/1905.09610 (2019) - [i25]Luís Cruz-Filipe, Fabrizio Montesi, Larisa Safina:
Implementing choreography extraction. CoRR abs/1910.11741 (2019) - 2018
- [j12]Bart Bogaerts
Fixpoint semantics for active integrity constraints. Artif. Intell. 255: 43-70 (2018) - [j11]Luís Cruz-Filipe
Active integrity constraints for general-purpose knowledge bases. Ann. Math. Artif. Intell. 83(3-4): 213-246 (2018) - [c37]Adrian Rebola-Pardo, Luís Cruz-Filipe:
Complete and Efficient DRAT Proof Checking. FMCAD 2018: 1-9 - [c36]Marco Carbone, Luís Cruz-Filipe, Fabrizio Montesi
Multiparty Classical Choreographies. LOPSTR 2018: 59-76 - [c35]Luís Cruz-Filipe, Fabrizio Montesi
Communications in choreographies, revisited. SAC 2018: 1248-1255 - [i24]Farhad Arbab, Luís Cruz-Filipe, Sung-Shik Jongmans, Fabrizio Montesi:
Connectors meet Choreographies. CoRR abs/1804.08976 (2018) - [i23]Marco Carbone, Luís Cruz-Filipe, Fabrizio Montesi, Agata Murawska:
Multiparty Classical Choreographies. CoRR abs/1808.05088 (2018) - [i22]James H. Davenport, Bjorn Poonen, James Maynard, Harald Helfgott, Pham Huu Tiep, Luís Cruz-Filipe:
Machine-Assisted Proofs (ICM 2018 Panel). CoRR abs/1809.08062 (2018) - 2017
- [j10]Michael Codish
Optimizing sorting algorithms by using sorting networks. Formal Aspects Comput. 29(3): 559-579 (2017) - [j9]Luís Cruz-Filipe
Formally Proving Size Optimality of Sorting Networks. J. Autom. Reason. 59(4): 425-454 (2017) - [j8]Daniel Bundala, Michael Codish
Optimal-depth sorting networks. J. Comput. Syst. Sci. 84: 185-204 (2017) - [j7]Luís Cruz-Filipe
From description-logic programs to multi-context systems. J. Log. Algebraic Methods Program. 88: 26-44 (2017) - [c34]Luís Cruz-Filipe
Efficient Certified RAT Verification. CADE 2017: 220-236 - [c33]Luís Cruz-Filipe
Procedural Choreographic Programming. FORTE 2017: 92-107 - [c32]Luís Cruz-Filipe
The Paths to Choreography Extraction. FoSSaCS 2017: 424-440 - [c31]Bart Bogaerts, Luís Cruz-Filipe
Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory. IJCAI 2017: 866-872 - [c30]Luís Cruz-Filipe
How to Get More Out of Your Oracles. ITP 2017: 164-170 - [c29]Luís Cruz-Filipe, Peter Schneider-Kamp
Formally Proving the Boolean Pythagorean Triples Conjecture. LPAR 2017: 509-522 - [c28]Luís Cruz-Filipe
Encoding asynchrony in choreographies. SAC 2017: 1175-1177 - [c27]Luís Cruz-Filipe
Efficient Certified Resolution Proof Checking. TACAS (1) 2017: 118-135 - [c26]Luís Cruz-Filipe, Fabrizio Montesi
On Asynchrony and Choreographies. ICE@DisCoTec 2017: 76-90 - [i21]Luís Cruz-Filipe, Fabrizio Montesi:
That's Enough: Asynchrony with Standard Choreography Primitives. CoRR abs/1711.08700 (2017) - [i20]Luís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti:
Communications in Choreographies, Revisited. CoRR abs/1711.10201 (2017) - 2016
- [j6]Michael Codish
Sorting nine inputs requires twenty-five comparisons. J. Comput. Syst. Sci. 82(3): 551-563 (2016) - [c25]Luís Cruz-Filipe
Active Integrity Constraints for Multi-context Systems. EKAW 2016: 98-112 - [c24]Luís Cruz-Filipe
A Core Model for Choreographic Programming. FACS 2016: 17-35 - [c23]Luís Cruz-Filipe
Integrity Constraints for General-Purpose Knowledge Bases. FoIKS 2016: 235-254 - [c22]Luís Cruz-Filipe
Choreographies in Practice. FORTE 2016: 114-123 - [c21]Luís Cruz-Filipe
Grounded Fixpoints and Active Integrity Constraints. ICLP (Technical Communications) 2016: 11:1-11:14 - [i19]Luís Cruz-Filipe, Isabel Nunes, Peter Schneider-Kamp:
Integrity Constraints for General-Purpose Knowledge Bases. CoRR abs/1601.04980 (2016) - [i18]Luís Cruz-Filipe, Fabrizio Montesi:
Choreographies, Divided and Conquered. CoRR abs/1602.03729 (2016) - [i17]Luís Cruz-Filipe, Fabrizio Montesi:
Choreographies in Practice. CoRR abs/1602.08863 (2016) - [i16]Luís Cruz-Filipe:
Grounded Fixpoints and Active Integrity Constraints. CoRR abs/1607.05412 (2016) - [i15]Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes, Peter Schneider-Kamp:
Active Integrity Constraints for Multi-Context Systems. CoRR abs/1609.06019 (2016) - [i14]Luís Cruz-Filipe, João Marques-Silva, Peter Schneider-Kamp:
Efficient Certified Resolution Proof Checking. CoRR abs/1610.06984 (2016) - [i13]Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi:
The Paths to Choreography Extraction. CoRR abs/1610.10050 (2016) - [i12]Luís Cruz-Filipe, Marijn Heule, Warren A. Hunt Jr., Matt Kaufmann, Peter Schneider-Kamp:
Efficient Certified RAT Verification. CoRR abs/1612.02353 (2016) - 2015
- [j5]Luís Cruz-Filipe
The Finitistic Consistency of Heck's Predicative Fregean System. Notre Dame J. Formal Log. 56(1): 61-79 (2015) - [c20]Luís Cruz-Filipe
repAIrC: A Tool for Ensuring Data Consistency. KMIS 2015: 17-26 - [c19]Luís Cruz-Filipe
Active Integrity Constraints: From Theory to Implementation. IC3K 2015: 399-420 - [c18]Luís Cruz-Filipe
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker. ITP 2015: 154-169 - [c17]Michael Codish
Sorting Networks: The End Game. LATA 2015: 664-675 - [c16]Michael Codish
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. LOPSTR 2015: 127-142 - [c15]Luís Cruz-Filipe
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof. CICM 2015: 55-70 - [i11]Luís Cruz-Filipe, Peter Schneider-Kamp:
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker. CoRR abs/1502.05209 (2015) - [i10]Luís Cruz-Filipe, Peter Schneider-Kamp:
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof. CoRR abs/1502.08008 (2015) - [i9]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. CoRR abs/1505.01962 (2015) - [i8]Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp:
Sorting Networks: to the End and Back Again. CoRR abs/1507.01428 (2015) - [i7]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
When Six Gates are Not Enough. CoRR abs/1508.05737 (2015) - [i6]Luís Cruz-Filipe, Fabrizio Montesi:
Choreographies, Computationally. CoRR abs/1510.03271 (2015) - [i5]Luís Cruz-Filipe, Michael Franz, Artavazd Hakhverdyan, Marta Ludovico, Isabel Nunes, Peter Schneider-Kamp:
repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints. CoRR abs/1510.03989 (2015) - 2014
- [j4]Luís Cruz-Filipe
The stream-based service-centred calculus: a foundation for service-oriented programming. Formal Aspects Comput. 26(5): 865-918 (2014) - [c14]Luís Cruz-Filipe
Information Flow within Relational Multi-context Systems. EKAW 2014: 97-108 - [c13]Luís Cruz-Filipe
Optimizing Computation of Repairs from Active Integrity Constraints. FoIKS 2014: 361-380 - [c12]Michael Codish
Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). ICTAI 2014: 186-193 - [c11]Michael Codish
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. SYNASC 2014: 359-366 - [i4]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. CoRR abs/1404.0948 (2014) - [i3]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten). CoRR abs/1405.5754 (2014) - [i2]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
Sorting Networks: the End Game. CoRR abs/1411.6408 (2014) - [i1]Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný:
Optimal-Depth Sorting Networks. CoRR abs/1412.5302 (2014) - 2013
- [c10]Luís Cruz-Filipe
Patterns for Interfacing between Logic Programs and Multiple Ontologies. KEOD 2013: 58-69 - [c9]Luís Cruz-Filipe
Design Patterns for Description-Logic Programs. IC3K 2013: 199-214 - [c8]Luís Cruz-Filipe
Description Logics, Rules and Multi-context Systems. LPAR 2013: 243-257 - [c7]Luís Cruz-Filipe
Computing Repairs from Active Integrity Constraints. TASE 2013: 183-190
2000 – 2009
- 2008
- [j3]Luís Cruz-Filipe
Heterogeneous Fibring of Deductive Systems Via Abstract Proof Systems. Log. J. IGPL 16(2): 121-153 (2008) - [j2]Luís Cruz-Filipe
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification. J. Log. Comput. 18(6): 885-911 (2008) - [c6]Luís Cruz-Filipe
Behavioural Theory at Work: Program Transformations in a Service-Centred Calculus. FMOODS 2008: 59-77 - 2007
- [j1]Rohit Chadha, Luís Cruz-Filipe
Reasoning about probabilistic sequential programs. Theor. Comput. Sci. 379(1-2): 142-165 (2007) - 2005
- [c5]Luís Cruz-Filipe
A Large-Scale Experiment in Executing Extracted Programs. Calculemus 2005: 75-91 - 2004
- [c4]Luís Cruz-Filipe
C-CoRN, the Constructive Coq Repository at Nijmegen. MKM 2004: 88-103 - [c3]Luís Cruz-Filipe
Hierarchical Reflection. TPHOLs 2004: 66-81 - 2003
- [c2]Luís Cruz-Filipe
Program Extraction from Large Proof Developments. TPHOLs 2003: 205-220 - 2002
- [c1]Luís Cruz-Filipe
A Constructive Formalization of the Fundamental Theorem of Calculus. TYPES 2002: 108-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-22 18:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: