Daniele Nantes Sobrinho

Temur Kutsia

J. Autom. Reason., December, 2024

Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Artifact).

[BibT_eX]

[DOI]

Dagstuhl Artifacts Ser., 2024

Strong Nominal Semantics for Fixed-Point Constraints.

[BibT_eX]

[DOI]

Ali K. Caires-Santos

CoRR, 2024

Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2024

Matching Plans for Frame Inference in Compositional Reasoning.

[BibT_eX]

[DOI]

Sacha-Élie Ayoun

Petar Maksimovic

Philippa Gardner

Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

Compositional Symbolic Execution for Correctness and Incorrectness Reasoning.

[BibT_eX]

[DOI]

Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version).

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

Termination in Concurrency, Revisited.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

Nominal AC-Matching.

[BibT_eX]

[DOI]

Temur Kutsia

Proceedings of the Intelligent Computer Mathematics - 16th International Conference, 2023

Towards Fast Nominal Anti-unification of Letrec-Expressions.

[BibT_eX]

[DOI]

Manfred Schmidt-Schauß

Proceedings of the Automated Deduction - CADE 29, 2023

Typed Non-determinism in Functional and Concurrent Calculi.

[BibT_eX]

[DOI]

Bas van den Heuvel

Proceedings of the Programming Languages and Systems - 21st Asian Symposium, 2023

2022

Functions as Processes: The Case of Collapsing Non-determinism.

[BibT_eX]

[DOI]

Bas van den Heuvel

CoRR, 2022

Nominal Anti-Unification with Atom-Variables.

[BibT_eX]

[DOI]

Manfred Schmidt-Schauß

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

A Certified Algorithm for AC-Unification.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

Formalising nominal C-unification generalised with protected variables.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2021

Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2021

A subexponential view of domains in session types.

[BibT_eX]

[DOI]

Daniele Nantes

Carlos Olarte

Daniel Ventura

Proceedings of the Proceedings 16th Logical and Semantic Frameworks with Applications, 2021

Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Types for Proofs and Programs, 2021

Non-Deterministic Functions as Non-Deterministic Processes.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Nominal Equational Problems.

[BibT_eX]

[DOI]

Deivid Vale

Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020

On Nominal Syntax and Permutation Fixed Points.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

A, C, and AC Nominal Anti-Unification.

[BibT_eX]

[DOI]

Alexander Baumgartner

Proceedings of the 34th International Workshop on Unification, 2020

An Investigation into General Nominal Equational Problems (Work in progress).

[BibT_eX]

[DOI]

Deivid Vale

Proceedings of the 34th International Workshop on Unification, 2020

2019

A formalisation of nominal <i>α</i>-equivalence with A, C, and AC function symbols.

[BibT_eX]

[DOI]

Ana Cristina Rocha Oliveira

Theor. Comput. Sci., 2019

On Solving Nominal Disunification Constraints.

[BibT_eX]

[DOI]

Deivid Vale

Proceedings of the 14th Workshop on Logical and Semantic Frameworks with Applications, 2019

A Certified Functional Nominal C-Unification Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2019

2018

Brasilia Spring on Automated Reasoning.

[BibT_eX]

[DOI]

Cláudia Nalon

Elaine Pimentel

João Marcos

ACM SIGLOG News, 2018

A Formalisation of Nominal C-Matching through Unification with Protected Variables.

[BibT_eX]

[DOI]

Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018

Fixed-Point Constraints for Nominal Equational Unification.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Relating Process Languages for Security and Communication Correctness (Extended Abstract).

[BibT_eX]

[DOI]

Daniele Nantes

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2018

2017

Intruder deduction problem for locally stable theories with normal forms and inverses.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Nominal C-Unification.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2017

On Solving Nominal Fixpoint Equations.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

A Formalisation of Nominal α-equivalence with A and AC Function Symbols.

[BibT_eX]

[DOI]

Proceedings of the 11th Workshop on Logical and Semantic Frameworks with Applications, 2016

Nominal Narrowing.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2013

O problema da dedução do intruso para teorias AC-convergentes localmente estáveis.

[BibT_eX]

[DOI]

PhD thesis, 2013

2012

Elementary Deduction Problem for Locally Stable Theories with Normal Forms

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

2010

Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures.

[BibT_eX]

[DOI]