Maribel Fernández

Orcid: 0000-0001-8325-5815

According to our database1, Maribel Fernández authored at least 170 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Strong Nominal Semantics for Fixed-Point Constraints.
CoRR, 2024

Hierarchical Higher-Order Port-Graphs: A Rewriting-Based Modelling Language.
Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming, 2024

An Axiomatic Category-Based Access Control Model for Smart Homes.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2024

The Ackermann Award 2023.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

Automated Generation and Update of Structured ABAC Policies.
Proceedings of the 2024 ACM Workshop on Secure and Trustworthy Cyber-Physical Systems, 2024

2023
A Privacy-Preserving Architecture and Data-Sharing Model for Cloud-IoT Applications.
IEEE Trans. Dependable Secur. Comput., 2023

The Category-Based Approach to Access Control, Obligations and Privacy.
Proceedings of the 28th ACM Symposium on Access Control Models and Technologies, 2023

Nominal AC-Matching.
Proceedings of the Intelligent Computer Mathematics - 16th International Conference, 2023

Unification Modulo Equational Theories in Languages with Binding Operators (Invited Talk).
Proceedings of the Logic-Based Program Synthesis and Transformation, 2023

From Static to Dynamic Access Control Policies via Attribute-Based Category Mining.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2023

Nominal Techniques for Software Specification and Verification (Invited Talk).
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Modular Composition of Access Control Policies: A Framework to Build Multi-Site Multi-Level Combinations.
Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022

Nominal Matching Logic.
Proceedings of the PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming, Tbilisi, Georgia, September 20, 2022

A Certified Algorithm for AC-Unification.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Formalising nominal C-unification generalised with protected variables.
Math. Struct. Comput. Sci., 2021

Nominal syntax with atom substitutions.
J. Comput. Syst. Sci., 2021

EVL: a typed functional language for event processing.
CoRR, 2021

Nominal Equational Problems.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

Graph-Based Specification of Admin-CBAC Policies.
Proceedings of the CODASPY '21: Eleventh ACM Conference on Data and Application Security and Privacy, 2021

2020
On Nominal Syntax and Permutation Fixed Points.
Log. Methods Comput. Sci., 2020

An Investigation into General Nominal Equational Problems (Work in progress).
Proceedings of the 34th International Workshop on Unification, 2020

A Data Access Model for Privacy-Preserving Cloud-IoT Architectures.
Proceedings of the 25th ACM Symposium on Access Control Models and Technologies, 2020

Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

EVL: A Typed Higher-order Functional Language for Events.
Proceedings of the 15th International Workshop on Logical and Semantic Frameworks with Applications, 2020

A Reversible Operational Semantics for Imperative Programming Languages.
Proceedings of the Formal Methods and Software Engineering, 2020

Admin-CBAC: An Administration Model for Category-Based Access Control.
Proceedings of the CODASPY '20: Tenth ACM Conference on Data and Application Security and Privacy, 2020

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

Strategic port graph rewriting: an interactive modelling framework.
Math. Struct. Comput. Sci., 2019

Preface to the Special Issue on Linearity.
J. Autom. Reason., 2019

On Solving Nominal Disunification Constraints.
Proceedings of the 14th Workshop on Logical and Semantic Frameworks with Applications, 2019

A Port Graph Rewriting Approach to Relational Database Modelling.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2019

A Certified Functional Nominal C-Unification Algorithm.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2019

Privacy-Preserving Architecture for Cloud-IoT Platforms.
Proceedings of the 2019 IEEE International Conference on Web Services, 2019

Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Specification and Analysis of ABAC Policies via the Category-based Metamodel.
Proceedings of the Ninth ACM Conference on Data and Application Security and Privacy, 2019

2018
Typed Nominal Rewriting.
ACM Trans. Comput. Log., 2018

Nominal essential intersection types.
Theor. Comput. Sci., 2018

Labelled graph strategic rewriting for social networks.
J. Log. Algebraic Methods Program., 2018

A Formalisation of Nominal C-Matching through Unification with Protected Variables.
Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018

Towards a Privacy-Aware Qunatified Self Data Management Framework.
Proceedings of the 23nd ACM on Symposium on Access Control Models and Technologies, 2018

Fixed-Point Constraints for Nominal Equational Unification.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Graph-Based Data-Collection Policies for the Internet of Things.
Proceedings of the 4th Annual Industrial Control System Security Workshop, 2018

2017
Intruder deduction problem for locally stable theories with normal forms and inverses.
Theor. Comput. Sci., 2017

A graph-based framework for the analysis of access control policies.
Theor. Comput. Sci., 2017

Labelled Port Graph - A Formal Structure for Models and Computations.
Proceedings of the 12th Workshop on Logical and Semantic Frameworks, with Applications, 2017

Attributed Hierarchical Port Graphs and Applications.
Proceedings of the Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2017

Nominal C-Unification.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2017

On Solving Nominal Fixpoint Equations.
Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

PORGY : a Visual Analytics Platform for System Modelling and Analysis Based on Graph Rewriting.
Proceedings of the 17ème Journées Francophones Extraction et Gestion des Connaissances, 2017

2016
A Formalisation of Nominal α-equivalence with A and AC Function Symbols.
Proceedings of the 11th Workshop on Logical and Semantic Frameworks with Applications, 2016

Labelled Graph Rewriting Meets Social Networks.
Proceedings of the Rewriting Logic and Its Applications - 11th International Workshop, 2016

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

A Framework for Secure Data Collection and Management for Internet of Things.
Proceedings of the 2nd Annual Industrial Control System Security Workshop, 2016

2015
Towards Privacy-Preserving Web Metering Via User-Centric Hardware.
EAI Endorsed Trans. Security Safety, 2015

Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

Completeness in PVS of a Nominal Unification Algorithm.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

Checking Overlaps of Nominal Rewriting Rules.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

From nominal to higher-order rewriting and back again.
Log. Methods Comput. Sci., 2015

Dependent Types for Nominal Terms with Atom Substitutions.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Enhancing the specification and verification techniques of multiparty sessions in SOC.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

A Typed Language for Events.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

2014
Programming Languages and Operational Semantics - A Concise Overview
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-4471-6368-8, 2014

Labelled calculi of resources.
J. Log. Comput., 2014

Linearity: A Roadmap.
J. Log. Comput., 2014

A metamodel of access control for distributed environments: Applications and properties.
Inf. Comput., 2014

A Framework for the Analysis of Access Control Policies with Emergency Management.
Proceedings of the Ninth Workshop on Logical and Semantic Frameworks, with Applications, 2014

Enabling Synchronous and Asynchronous Communications in CSP for SOC.
Proceedings of the Ninth Workshop on Logical and Semantic Frameworks, with Applications, 2014

Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework.
Proceedings of the Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, 2014

Static Enforcement of Role-Based Access Control.
Proceedings of the Proceedings 10th International Workshop on Automated Specification and Verification of Web Systems, 2014

Hybrid Enforcement of Category-Based Access Control.
Proceedings of the Security and Trust Management - 10th International Workshop, 2014

Relating Nominal and Higher-Order Rewriting.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Preface.
Proceedings of the 8th Workshop on Logical and Semantic Frameworks, 2013

Bigraphical Nets
Proceedings of the Proceedings 7th International Workshop on Computing with Terms and Graphs, 2013

Assembling the Proofs of Ordered Model Transformations
Proceedings of the Proceedings 10th International Workshop on Formal Engineering Approaches to Software Components and Architectures, 2013

2012
Preface: Theory and Applications of Abstraction, Substitution and Naming.
J. Autom. Reason., 2012

Elementary Deduction Problem for Locally Stable Theories with Normal Forms
Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

Higher-order port-graph rewriting
Proceedings of the Proceedings 2nd International Workshop on Linearity, 2012

General dynamic recovery for compensating CSP.
Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

Nominal Completion for Rewrite Systems with Binders.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
A new graphical calculus of proofs
Proceedings of the Proceedings 6th International Workshop on Computing with Terms and Graphs, 2011

PORGY: Strategy-Driven Interactive Transformation of Graphs
Proceedings of the Proceedings 6th International Workshop on Computing with Terms and Graphs, 2011

Linearity and recursion in a typed Lambda-calculus.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

A Strategy Language for Graph Rewriting.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Principal Types for Nominal Theories.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Gödel's system tau revisited.
Theor. Comput. Sci., 2010

Linearity and iterator types for Gödel's System.
High. Order Symb. Comput., 2010

Matching and alpha-equivalence check for nominal terms.
J. Comput. Syst. Sci., 2010

Strategic programming on graph rewriting systems
Proceedings of the Proceedings International Workshop on Strategies in Rewriting, 2010

Closed nominal rewriting and efficiently computable nominal algebra equality
Proceedings of the Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2010

Linear Recursion
CoRR, 2010

Rewrite Specifications of Access Control Policies in Distributed Environments.
Proceedings of the Security and Trust Management - 6th International Workshop, 2010

The First-Order Nominal Link.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2010

Category-Based Authorisation Models: Operational Semantics and Expressive Power.
Proceedings of the Engineering Secure Software and Systems, Second International Symposium, 2010

2009
Models of Computation - An Introduction to Computability Theory.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84882-434-8, 2009

Rewriting Corner.
J. Log. Comput., 2009

Distributed event-based access control.
Int. J. Inf. Comput. Secur., 2009

Recursive Functions with Pattern Matching in Interaction Nets.
Proceedings of the Fifth International Workshop on Computing with Terms and Graphs, 2009

Labelled Lambda-calculi with Explicit Copy and Erase
Proceedings of the Proceedings First International Workshop on Linearity, 2009

Graph Creation, Visualisation and Transformation
Proceedings of the Proceedings Tenth International Workshop on Rule-Based Programming, 2009

2008
A polynomial nominal unification algorithm.
Theor. Comput. Sci., 2008

Rewriting calculi, higher-order reductions and patterns: introduction.
Math. Struct. Comput. Sci., 2008

Lambda Calculus, Type Theory, and Natural Language II.
J. Log. Comput., 2008

New Developments in Environment Machines.
Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Action Control by Term Rewriting.
Proceedings of the Third International Workshop on Security and Rewriting Techniques, 2008

Nominal Matching and Alpha-Equivalence.
Proceedings of the Logic, 2008

A rewriting framework for the composition of access control policies.
Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

Time and Location Based Services with Access Control.
Proceedings of the NTMS 2008, 2008

An algebraic-functional framework for distributed access control.
Proceedings of the CRiSIS '08, 2008

2007
More developments in computational models: introduction.
Math. Struct. Comput. Sci., 2007

Nominal rewriting.
Inf. Comput., 2007

Iterator Types.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Dynamic Event-Based Access Control as Term Rewriting.
Proceedings of the Data and Applications Security XXI, 2007

Linear Recursive Functions.
Proceedings of the Rewriting, 2007

2006
Developments in computational models: introduction.
Math. Struct. Comput. Sci., 2006

Preface.
Proceedings of the 7th International Workshop on Rule Based Programming, 2006

Preface.
Proceedings of the First International Workshop on Security and Rewriting Techniques, 2006

From Functional Programs to Interaction Nets via the Rewriting Calculus.
Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming, 2006

Implementing Nominal Unification.
Proceedings of the Third International Workshop on Term Graph Rewriting, 2006

The Power of Closed Reduction Strategies.
Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming, 2006

Curry-Style Types for Nominal Terms.
Proceedings of the Types for Proofs and Programs, International Workshop, 2006

A historic functional and object-oriented calculus.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

Term Rewriting for Access Control.
Proceedings of the Data and Applications Security XX, 2006

The Power of Linear Functions.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Closed reduction: explicit substitutions without alpha-conversion.
Math. Struct. Comput. Sci., 2005

Interaction Nets vs. the <i>rho</i>-calculus: Introducing Bigraphical Nets.
Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

Preface.
Proceedings of the First International Workshop on Developments in Computational Models, 2005

Lambda-Calculus with Director Strings.
Appl. Algebra Eng. Commun. Comput., 2005

Nominal rewriting with name generation: abstraction vs. locality.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

2004
Preface.
Proceedings of the 2nd International Workshop on Term Graph Rewriting, 2004

Nominal rewriting systems.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

Workshop TERMGRAPH 2004.
Proceedings of the Graph Transformations, Second International Conference, 2004

Programming Languages and Operational Semantics.
Texts in computing 1, College Publications, ISBN: 978-0-9543006-3-0, 2004

2003
Operational equivalence for interaction nets.
Theor. Comput. Sci., 2003

Normalization, approximation, and semantics for combinator systems.
Theor. Comput. Sci., 2003

Interaction Nets with McCarthy's amb: Properties and Applications.
Nord. J. Comput., 2003

Reduction Strategies for Program Extraction.
CLEI Electron. J., 2003

Efficient Reductions with Director Strings.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002
A Higher-Order Calculus for Graph Transformation.
Proceedings of the First International Workshop on Term Graph Rewriting, 2002

Interaction Nets with McCarthy's amb.
Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

An Operational Approach to Program Extraction in the Calculus of Constructions.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Call-by-Value lambda-Graph Rewriting Without Rewriting.
Proceedings of the Graph Transformation, First International Conference, 2002

2001
Combining interaction nets with externally defined programs.
Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

2000
A Theory of Operational Equivalence for Interaction Nets.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and <i>beta</i>-Rule.
Proceedings of the Types for Proofs and Programs, 1999

A Calculus for Interaction Nets.
Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

Closed Reductions in the lambda-Calculus.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
Interaction Nets and Term-Rewriting Systems.
Theor. Comput. Sci., 1998

Type assignment and termination of interaction nets.
Math. Struct. Comput. Sci., 1998

Negation Elimination in Empty or Permutative Theories.
J. Symb. Comput., 1998

Coinductive Techniques for Operational Equivalence of Interaction Nets.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Modularity of Strong Normalization in the Algebraic-lambda-Cube.
J. Funct. Program., 1997

Normalization Results for Typeable Rewrite Systems.
Inf. Comput., 1997

On Object Calculus with Algebraic Rewriting.
Proceedings of the Programming Languages: Implementations, 1997

1996
Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting.
Theor. Comput. Sci., 1996

AC Complement Problems: Satisfiability and Negation Elimination.
J. Symb. Comput., 1996

From Term Rewriting to Generalised Interaction Nets.
Proceedings of the Programming Languages: Implementations, 1996

Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization.
Proceedings of the Programming Languages and Systems, 1996

Interaction Nets and Term Rewriting Systems (Extended Abstract).
Proceedings of the Trees in Algebra and Programming, 1996

1995
Normalization Properties of Typeable Term Rewriting Systems (Abstract).
Proceedings of the 9th International Workshop on Unification, 1995

(Head-) Normalization of Typeable Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Approximation and Normalization Results for Typeable Term Rewriting Systems.
Proceedings of the Higher-Order Algebra, 1995

1994
Modularity of Strong Normalization and Confluence in the algebraic-lambda-Cube
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Modular Termination of Term Rewriting Systems Revisited.
Proceedings of the Recent Trends in Data Type Specification, 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30, 1994

1993
Combining First and Higher Order Rewrite Systems with Type Assignment Systems.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Strong Normalization of Typeable Rewrite Systems.
Proceedings of the Higher-Order Algebra, 1993

1992
Narrowing Based Procedures for Equational Disunification.
Appl. Algebra Eng. Commun. Comput., 1992

Negation Elimination in Equational Formulae.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992


  Loading...