default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Nantes Sobrinho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Andreas Lööw, Daniele Nantes-Sobrinho, Sacha-Élie Ayoun, Caroline Cronjäger, Nat Karmios, Petar Maksimovic, Philippa Gardner:
Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Artifact). Dagstuhl Artifacts Ser. 10(2): 13:1-13:2 (2024)- [c25]Andreas Lööw, Daniele Nantes-Sobrinho
, Sacha-Élie Ayoun, Caroline Cronjäger, Petar Maksimovic, Philippa Gardner:
Compositional Symbolic Execution for Correctness and Incorrectness Reasoning. ECOOP 2024: 25:1-25:28 - [c24]Andreas Lööw, Daniele Nantes-Sobrinho, Sacha-Élie Ayoun, Petar Maksimovic, Philippa Gardner:
Matching Plans for Frame Inference in Compositional Reasoning. ECOOP 2024: 26:1-26:20 - [i8]Andreas Lööw, Daniele Nantes-Sobrinho, Sacha-Élie Ayoun, Caroline Cronjäger, Petar Maksimovic, Philippa Gardner:
Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Extended Version). CoRR abs/2407.10838 (2024) - [i7]Ali K. Caires-Santos, Maribel Fernández, Daniele Nantes-Sobrinho:
Strong Nominal Semantics for Fixed-Point Constraints. CoRR abs/2407.14253 (2024) - 2023
- [j6]Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version). Log. Methods Comput. Sci. 19(4) (2023) - [c23]Bas van den Heuvel, Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Typed Non-determinism in Functional and Concurrent Calculi. APLAS 2023: 112-132 - [c22]Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho:
Towards Fast Nominal Anti-unification of Letrec-Expressions. CADE 2023: 456-473 - [c21]Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Temur Kutsia, Daniele Nantes-Sobrinho:
Nominal AC-Matching. CICM 2023: 53-68 - [c20]Joseph W. N. Paulus, Jorge A. Pérez, Daniele Nantes-Sobrinho:
Termination in Concurrency, Revisited. PPDP 2023: 3:1-3:14 - [e1]Daniele Nantes-Sobrinho, Pascal Fontaine:
Proceedings 17th International Workshop on Logical and Semantic Frameworks with Applications, LSFA 2022, Belo Horizonte, Brazil (hybrid), 23-24 September 2022. EPTCS 376, 2023 [contents] - [i6]Joseph W. N. Paulus, Jorge A. Pérez, Daniele Nantes-Sobrinho:
Termination in Concurrency, Revisited. CoRR abs/2308.01165 (2023) - 2022
- [c19]Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho:
Nominal Anti-Unification with Atom-Variables. FSCD 2022: 7:1-7:22 - [c18]Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Daniele Nantes Sobrinho:
A Certified Algorithm for AC-Unification. FSCD 2022: 8:1-8:21 - [i5]Bas van den Heuvel, Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Functions as Processes: The Case of Collapsing Non-determinism. CoRR abs/2205.00680 (2022) - 2021
- [j5]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Gabriel Ferreira Silva, Daniele Nantes-Sobrinho:
Formalising nominal C-unification generalised with protected variables. Math. Struct. Comput. Sci. 31(3): 286-311 (2021) - [c17]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale:
Nominal Equational Problems. FoSSaCS 2021: 22-41 - [c16]Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Non-Deterministic Functions as Non-Deterministic Processes. FSCD 2021: 21:1-21:22 - [c15]Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes. TYPES 2021: 11:1-11:24 - [c14]Daniele Nantes, Carlos Olarte, Daniel Ventura:
A subexponential view of domains in session types. LSFA 2021: 93-111 - [i4]Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version). CoRR abs/2104.14759 (2021) - [i3]Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version). CoRR abs/2112.01593 (2021) - 2020
- [j4]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
On Nominal Syntax and Permutation Fixed Points. Log. Methods Comput. Sci. 16(1) (2020) - [c13]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale:
An Investigation into General Nominal Equational Problems (Work in progress). UNIF 2020: 3:1-3:8 - [c12]Alexander Baumgartner, Daniele Nantes-Sobrinho:
A, C, and AC Nominal Anti-Unification. UNIF 2020: 5:1-5:6
2010 – 2019
- 2019
- [j3]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho, Ana Cristina Rocha Oliveira:
A formalisation of nominal α-equivalence with A, C, and AC function symbols. Theor. Comput. Sci. 781: 3-23 (2019) - [c11]Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Daniele Nantes-Sobrinho:
A Certified Functional Nominal C-Unification Algorithm. LOPSTR 2019: 123-138 - [c10]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale:
On Solving Nominal Disunification Constraints. LSFA 2019: 3-22 - [i2]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
On Nominal Syntax and Permutation Fixed Points. CoRR abs/1902.08345 (2019) - 2018
- [j2]Cláudia Nalon, Daniele Nantes Sobrinho, Elaine Pimentel, João Marcos:
Brasilia Spring on Automated Reasoning. ACM SIGLOG News 5(1): 21-22 (2018) - [c9]Daniele Nantes, Jorge A. Pérez:
Relating Process Languages for Security and Communication Correctness (Extended Abstract). FORTE 2018: 79-100 - [c8]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
Fixed-Point Constraints for Nominal Equational Unification. FSCD 2018: 7:1-7:16 - [c7]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
A Formalisation of Nominal C-Matching through Unification with Protected Variables. LSFA 2018: 47-65 - 2017
- [j1]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
Intruder deduction problem for locally stable theories with normal forms and inverses. Theor. Comput. Sci. 672: 64-100 (2017) - [c6]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
On Solving Nominal Fixpoint Equations. FroCoS 2017: 209-226 - [c5]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
Nominal C-Unification. LOPSTR 2017: 235-251 - [i1]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
Nominal C-Unification. CoRR abs/1709.05384 (2017) - 2016
- [c4]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
Nominal Narrowing. FSCD 2016: 11:1-11:17 - [c3]Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho:
A Formalisation of Nominal α-equivalence with A and AC Function Symbols. LSFA 2016: 21-38 - 2013
- [b1]Daniele Nantes Sobrinho:
O problema da dedução do intruso para teorias AC-convergentes localmente estáveis. University of Brasília, Brazil, 2013 - 2012
- [c2]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes Sobrinho:
Elementary Deduction Problem for Locally Stable Theories with Normal Forms. LSFA 2012: 45-60 - 2010
- [c1]Daniele Nantes Sobrinho, Mauricio Ayala-Rincón:
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures. WoLLIC 2010: 218-231
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-10-07 22:23 CEST 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:
