Publications of Maribel Fernández

Theses:

• PhD Thesis: Multiparadigm computational models based on rewriting. University of Paris 11, 1993.
• Habilitation to Direct Research in Computer Science. Multiparadigm models: types, semantics, modularity. University of Paris 11, 2000.

Books:

• M. Fernández. Programming Languages and Operational Semantics: A Concise Overview. Springer, UTiCS series, 2014. ISBN 978-1-4471-6368-8
• M. Fernández. Programming Languages and Operational Semantics. Texts in Computing, Volume 1. King's College Publications, 2004. ISBN 0-9543006-3-7.
• M. Fernández. Models of computation - An introduction to computability theory. Springer, UTiCS series, 2009. ISBN-10: 1848824335, ISBN-13: 978-1848824331

Chapters of books:

Nneka Ene, Maribel Fernández and Bruno Pinaud. A Strategic Graph Rewriting Model of Rational Negligence in Financial Markets. In G. Jaiani and D. Natroshvili (eds.), Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics and Statistics 334, 2020. https://doi.org/10.1007/978-3-030-56356-1_8

Oana Andrei, Maribel Fernández, Hélène Kirchner and Bruno Pinaud. Strategy-Driven Exploration for Rule-Based Models of Biochemical Systems with PORGY. In Modeling Biomolecular Site Dynamics: Methods and Protocols. William S. Hlavacek (Ed.) Springer - Methods in Molecular Biology series, 2019.

Edited Journal Special Issues and Conference Proceedings:

M. Fernández, C.M. Poskitt (eds). Proceedings of ICGT 2023, 16th International Conference on Graph Transformation (ICGT 2023), LNCS 13961, Sprigner

M. Fernández, Ninghui Li, Mohammad Shehab (eds.). CODASPY '23: Proceedings of the Thirtheenth ACM Conference on Data and Application Security and Privacy, Charlotte NC, USA, April 24 - 26, 2023. ACM Press.

M. Fernández, Anupam Joshi, Rakesh Verma (eds.). CODASPY '22: Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy, Baltimore MD, USA, April 25 - 27, 2022. ACM Press. ISBN: 978-1-4503-9220-4

M. Fernández (ed.). Proceedings of Logic-Based Program Synthesis and Transformation, 30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7?9, 2020, Lecture Notes in Computer Science volume 12561, Springer, 2021.

M. Fernández and A. Muscholl (editors). Proceedings of the EACSL Ann ual Conference on Computer Science Logic (CSL 2020), LIPICS, 2020.

T. Erharhd, M. Fernández, V. de Paiva, L. Tortora de Falco (eds). Proceedings of the Joint Linearity and Trends in Linear Logic and Applications Workshops, Linearity-TLLA 2018, Oxford 7-8 July 2018, FLoC, EPTCS 292, 2019.

M. Fernández and I. Mackie (eds.). Proceedings of the 10th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2018, Oxford, 7 July 201 8 (part of FLoC). EPTCS 288, 2019.

I. Cervesato and M. Fernández, editors. Linearity. Special issue of the International Journal on Automated Reasoning - 2018.

M. Fernández and T. Alternkirch, editors. Selected papers from RTA and TLCA 2015. Special Issue LMCS. 2018.

M. Fernández, editor. Proceedings of the 26th International Conference on Rewriting Techniques and Applications, RTA 2015. June 29 to July 1, 2015, Warsaw, Poland. LIPIcs 36, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2015, ISBN 978-3-939897-85-9

M. Fernández and M. Finger, editors. Proceedings of the 8th Workshop on Logical and Semantic Frameworks, with Applications, Sao Paulo, Brazil, September 2013. Volume 305, Pages 1-140, Electronic Notes in Theoretical Computer Science, Elsevier, 2014.

M. Fernández and C. Urban, editors. Theory and Applications of Abstraction, Substitution and Naming. Special issue of the International Journal on Automated Reasoning, 2011.

M. Fernández, T. Kutsia and W. Schreiner (eds.). Principles and Practice of Declarative Programming, Proceedings of the 12th International ACM SIGPLAN Symposium PPDP 2010. Hagenberg, Austria, July 2010. ACM Press.

M. Fernández, editor. Proceedings of the 24th International Workshop on Unification. Electronic Proceedings in Theoretical Computer Science, Volume 42, DOI: 10.4204/EPTCS.42 ISSN: 2075-2180, December 2010.

M. Fernández and K. Steinhoefel (eds.). Proceedings of URC* 2010, UG Research in Computer Science - Theory and Applications. King's College London, March 2010. IFCOLOG, Volume 1, 2011.

M. Fernández, editor. Proceedings of the 9th International Workshop on Reduction Strategies in Rewriting and Programming. Electronic Proceedings in Theoretical Computer Science, Volume 15, DOI: 10.4204/EPTCS.15, ISSN: 2075-2180, January 2010.

H. Cirstea and M. Fernández, editors. Rewriting Calculi, Higher-order reductions and Patterns. Special issue of the Journal of Mathematical Structures in Computer Science, Volume 18, 2008. Cambridge University Press.

M. Fernández, I. Mackie, editors. More Developments in Computational Models, 2nd special issue of the Journal of Mathematical Structures in Computer Science, Volume 17(4), 2007. Cambridge University Press.

M. Fernández, C. Fox, S. Lappin, editors. Lambda-Calculus, Type Theory and Natural Language II, 2nd Special Issue of the Journal of Logic and Computation, Oxford University Press, 2007.

M. Fernández, I. Mackie, editors. Developments in Computational Models, Special issue of the Journal of Mathematical Structures in Computer Science, 16(4), 2006. Cambridge University Press.

M. Fernández, R. Lammel (editors). Proceedings of the 7th Int. Workshop on Rule Based Programming (RULE'06), Seattle, 2006. Electronic Notes in Theoretical Computer Science, Volume 174, Issue 1, April 2007. Elsevier.

M. Fernández, C. Kirchner (editors). Proceedings of the 1st Int. Workshop on Security and Rewriting Techniques (SecReT'06), Venice, 2006. Electronic Notes in Theoretical Computer Science, issue 4 of volume 171, 2007. Elsevier. http://dx.doi.org/10.1016/j.entcs.2007.02.052

M. Fernández and I. Mackie (editors). Proceedings of the 1st Int. Workshop on Developments in Computational Models (DCM'05), Lisbon, 2005. Issue 3 of Volume 135 of Electronic Notes in Theoretical Computer Science, Elsevier.

M. Fernández, C. Fox, S. Lappin, editors. Lambda-Calculus, Type Theory and Natural Language, Special Issue of the Journal of Logic and Computation, Oxford University Press, 2005.

M. Fernández (editor). Proceedings of the 2nd Int. Workshop on Term Graph Rewriting (TERMGRAPH'04), Rome, 2004. Volume 127, Issue 5, Pages 1-195, Electronic Notes in Theoretical Computer Science, Elsevier.

Papers:

• On reversibility:

  Maribel Fernández, Ian Mackie. A Reversible Operational Semantics for Imperative Programming Languages. Proceedings of the International Conference on Formal Engineering Methods, ICFEM 2020, Si ngapore March 2021. LNCS, Springer.

• On security and rewriting:

  Journals:

  C. Bertolissi, M. Fernández, B. Thuraisingham. Category-Based Administrative Access Control Policies. ACM Transactions on Privacy and Security, ACM Press, 2024.

  M. Fernández, J. Jaimunk, B. Thuraisingham. A Privacy-Preserving Architecture and Data-Sharing Model for Cloud-IoT Applications. IEEE Transactions on Dependable and Secure Computing, 2022 early publication, doi: 10.1109/TDSC.2022.3204720.

  S. Alves and M. Fernández. A Graph-Based Framework for the Analysis of Access Control Policies. Theoretical Computer Science, 2017.

  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).

  F. Alarifi and M. Fernáandez. Towards Privacy-Preserving Web Metering Via User-Centric Hardware. ICST Transactions on Security and Safety 2(4):e4, 2015.

  C. Bertolissi and M. Fernández. A Meta-model of Access Control for Distributed Environments: Applications and Properties. Information and Computation, volume 238, pp. 187 -- 207. Special Issue on Security and Rewriting Techniques, 2014.

  C. Bertolissi and M. Fernández. Distributed Event-Based Access Control. International Journal of Information and Computer Security, Volume 3, Nos. 3/4, 2009. Inderscience. Special Issue, selected papers from Crisis 2008.

  Conferences:

  A. Bamberger and M. Fernández. Automated Generation and Update of Structured ABAC Policies. Proceedings of SAT-CPS at CODASPY 2024: 31-40, ACM Press.

  C. Bertolissi, M. Fernández, B. Thuraisingham. An Axiomatic Category-Based Access Control Model for Smart Homes. Proceedings of LOPSTR 2024, Milan, September 2024. Lecture Notes in Computer Science, Springer.

  A. Bamberger and M. Fernández. From Static to Dynamic Access Control Policies via Attribute-Based Category Mining. In Proceedings of Logic-Based Program Synthesis and Transformation, LOPSTR 2023. Cascais, October 2023. Lecture Notes in Computer Science, Springer.

  M. Fernández. The Category-Based Approach to Access Control, Obligations and Privacy. Proceedings of SACMAT 2023, 28th ACM Symposium on Access Control Models and Technologies. June 8--10, 2022. Abstract of Invited Talk.

  C. Bertolissi, M. Fernández. Modular Composition of Access Control Policies: A Framework to Build Multi-Site Multi-Level Combinations. Proceedings of SACMAT 2022, 27th ACM Symposium on Access Control Models and Technologies. June 8--10, 2022. New York, NY, USA. ACM Press.

  C. Bertolissi, M. Fernández, B. Thuraisingham. Graph-Based Specification of Admin-CBAC Policies. Proceedings of CODASPY 2021, 11th ACM Conference on Data and Application Security and Privacy, April 26-28, 2021. Virtual Event, USA. ACM Press.

  M. Fernández, A. Franch Tapia, J. Jaimunk, M. Martinez Chamorro, B. Thuraisingham. A Data-Access Model for Privacy-Preserving Cloud-IoT Architectures. Proceedings of SACMAT 2020, ACM Symposium on Access Control Models and Technologies, 10-12 June 2020. Barcelona. ACM Press.

  C. Bertolissi, M. Fernández, B. Thuraisingham. Admin-CBAC: An Admin istration Model for Category-Based Access Control. Proceedings of CODASPY 2020, 10th ACM Conference on Data and Application Security and Privacy, March 16-18, 2020. New Orleans, USA. ACM Press.

  M. Fernáandez, J. Jaimunk, B. Thuraisingham. Privacy-Preserving Architecture for Cloud-IoT Platforms. Proceedings of IEEE ICWS 2019, IEEE International Conference on Web Services, July 2019, Milan. IEEE Press.

  M. Fernández, I. Mackie, B. Thuraisingham. Specification and Analysis of ABAC Policies via the Category-Based Metamodel. Proceedings of CODASPY 2019, 9th ACM Conference on Data and Application Security and Privacy March 25 - 27, 2019. Dallas, TX, USA. ACM Press.

  M. Fernández, J. Jaimunk, B. Thuraisingham. Graph-Based Data Collection Policies for the Internet of Things. Proceedings of ICSS 2018 - Annual Industrial Control System Security (ICSS) Workshop, part of the 2018 Annual Computer Security Applications Conference. ACM Press.

  M. Fernández, B. Thuraisingham. A Category-based Model for ABAC. ABAC'18 Invited Talk. Conference on Data and Application Security and Privacy (CODASPY) 2018, Workshop on Attribute-Based Access Control. Tempe, Arizona, March 2018. ACM Press.

  M. Fernández, M. Kantarcioglu, B. Thuraisingham. A framework for secure data collection and management for Internet of Things. In Proceedings of the Second Industrial Control System Security (ICSS) Workshop (part of ACSAC), Los Angeles, December 2016. ACM Press.

  S. Alves, S. Broda and M. Fernández. A typed language for events. In Proceedings of LOPSTR 2015, Logic-Based Program Synthesis and Transformation, Siena, Italy, July 2015. Lecture Notes in Computer Science, Springer.

  S. Alves, A. Degtyarev and M. Fernández. Access Control and Obligations in the Category-Based Metamodel: A rewriting semantics. In Proceedings of LOPSTR 2014, Logic-Based Program Synthesis and Transformation, Canterbury, September 2014. Lecture Notes in Computer Science, Springer.

A. Ali, M. Fernández. Hybrid enforcement of Category-Based Access Control. Proceedings of the 10th International Workshop on Security and Trust Management (STM 2014), in conjunction with ESORICS 2014, Wroclaw, Poland, September 10-11, 2014. Lecture Notes in Computer Science, Springer, 2014.

Sandra Alves and Maribel Fernández. A Framework for the Analysis of Access Control Policies with Emergency Management. Proceedings of the 9th Int. Workshop on Logic and Semantic Frameworks, with Applications. Brasilia, September 2014. EPTCS

A. Ali, M. Fernández. Static Enforcement of Role-Based Access Control. Proceedings of 10th International Workshop on Automated Specification and Verification of Web Systems (WWV 2014), Vienna, July 2014. EPTCS, 2014.

M. Ayala-Rincon, M. Fernández, D. Nantes-Sobrinho. Elementary Deduction Problem for Locally Stable Theories with Normal Forms. Proceedings of LSFA 2012, EPTCS, 2013, pages 45-60.

C. Bertolissi and M. Fernández. Rewrite Specifications of Access Control Policies in Distributed Environments. Proceedings of the 6th International Workshop on Security and Trust Management (STM 2010), Athens, Greece, September 2010. Lecture Notes in Computer Science, Springer, 2010.
pdf©Springer 2010.

A. Ali and M. Fernández. A Programming Language with Role-Based Access Control. Proceedings of URC* 2010, UG Research in Computer Science - Theory and Applications, London, March 2010. College Publications.

C. Bertolissi and M. Fernandez. Category-based authorisation models: operational semantics and expressive power. In Proceedings of the International Symposium on Engineering Secure Software and Systems, ESSOS 2010, Pisa, 2010. Lecture Notes in Computer Science, Springer, 2010.

C. Bertolissi and M. Fernandez. A rewriting framework for the composition of access control policies. In Proceedings of the 10th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'08), Valencia, 2008. ACM Press.

C. Bertolissi and M. Fernandez. An Algebraic-Functional Framework for Distributed Access Control. In Proceedings 3rd Int. Conf. on Risks and Security of Internet Systems (CRISIS), 2008, IEEEXplore.

C. Bertolissi, M. Fernandez. Time and Location Based Services with Access Control. In Proceedings of the 2nd IFIP International Conference on New Technologies, Mobility and Security, IEEEXplore. Presented at the International Workshop on Service computing, Context-aware, Location-aware and Positioning techniques (SCLP'08), Tangier, Morocco, 2008. pdf

S. Barker, C. Bertolissi, M. Fernandez. Action Control by Term Rewriting. 3rd Int. Workshop on Security and Rewriting Techniques (SecReT 2008), associated to LICS and CSF, Pittsburgh, June 2008. Volume 234, Electronic Notes in Theoretical Computer Science, Elsevier, 2009.

C. Bertolissi, M. Fernandez, S. Barker. Dynamic Event-Based Access Control as Term Rewriting.
Data and Applications Security XXI. 21st Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSEC 2007), Redondo Beach, CA, USA, July 8-11, 2007, Proceedings. LNCS 4602, Springer, 2007. pdf©Springer 2007.

S. Barker, M. Fernandez. Action Status Access Control as Term Rewriting.
2nd Int. Workshop on Security and Rewriting Techniques (SecReT 2007), RDP 2007, Paris, June 2007.

S. Barker, M. Fernandez. Term rewriting for access control.
Proceedings of the 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'2006), Sophia Antipolis, France, July 2006. LNCS, Springer, 2006. pdf©Springer 2006.

• On rewriting, lambda-calculus, nominal techniques, types:

  Journals:

  Jesús Domínguez, Maribel Fernández, Nominal syntax with atom substitutions, Journal of Computer and System Sciences, Volume 119, 2021, Pages 34-59, ISSN 0022-0000, https://doi.org/10.1016/j.jcss.2021.01.002.

  Mauricio Ayala-Rincón, Washington de Carvalho-Segundo, Maribel Fernández, Daniele Nantes-Sobrinho, Ana Cristina Rocha Oliveira. A Formalisation of Nominal Alpha-Equivalence with A, C and AC Function Symbols. Theor. Comput. Sci. (2019). DOI 10.1016/j.tcs.2019.02.020 pdf

  E. Fairweather and M. Fernández. Typed Nominal Rewriting. ACM Transactions on Computational Logic (TOCL), 2018. pdf

  Mauricio Ayala-Rincón, Maribel Fernández, Ana Cristina Rocha Oliveira, Daniel Ventura. Nominal Essential Intersection Types. Theor. Comput. Sci. 672: 64-100 (2018).

  J Domínguez and M. Fernández. From Nominal to Higher-Order Rewriting and Back Again.. International Journal Logical Methods in Computer Science. 2016.

  M. Fernandez and N. Siafakas. Labelled calculi of resources. Special issue: Linearity in Computation, Volume 24 Issue 3, Journal of Logic and Computation, OUP, 2014. doi: 10.1093/logcom/exs021
  pdf at JLC

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linearity: A Roadmap. Special issue: Linearity in Computation, Volume 24 Issue 3, Journal of Logic and Computation, OUP, 2014.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linearity and Iterator Types for Goedel's System T.
  International Journal on Higher-Order and Symbolic Computation, Volume 23, Issue 1 (2011), Page 1-27, Springer.
  pdf©Springer.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Goedel's System T Revisited. Theoretical Computer Science, 2010. http://dx.doi.org/10.1016/j.tcs.2009.11.014
  pdf©Elsevier 2010.

  M. Fernandez, M.J. Gabbay. Nominal Rewriting. Information and Computation 205, pages 917-865, 2007.

  M. Fernandez, I. Mackie, F-R. Sinot. Closed Reduction: Explicit Substitutions without alpha-conversion.
  Mathematical Structures in Computer Science, volume 15, issue 02. Cambridge University Press, April 2005. Abstract
  Review by M. Dezani-Ciancaglini, MathSciNet

  M. Fernandez, I. Mackie, F-R. Sinot. Lambda-Calculus with Director Strings.
  Applicable Algebra in Engineering, Communication and Computing, Volume 15, Number 6, Pages 393 - 437, Springer-Verlag, 2005. Abstract.
  Review by M.W. Bunder, MathSciNet

  M. Fernandez, I. Mackie, P. Severi and N.Szasz. Reduction Strategies for Program Extraction.
  CLEI Electronic Journal, Volume 6(1), December 2003. Special Issue of Best Papers presented at CLEI'2002. Montevideo, Uruguay. Guest Editor: A. Viola.

  S. van Bakel and M. Fernandez. Normalization, Approximation, and Semantics for combinator systems.
  Theoretical Computer Science, 290(1), pages 975-1019, 2003. PostScript.
  Also available as Departmental Technical Report number 2000/10, Imperial College, London, 2000.
  Review by J.P. Seldin, MathSciNet

  S. van Bakel and M. Fernandez. Normalization Results for Typeable Rewrite Systems.
  Information and Computation, volume 133, number 2, pages 73-116, 1997. Abstract.

  F. Barbanera, M. Fernandez, H. Geuvers. Modularity of Strong Normalization in the algebraic lambda-cube.
  Journal of Functional Programming, volume 7, number 6, pages 613-660, 1997.
  Abstract.

  F. Barbanera, M. Fernandez. Intersection Type Assignment Systems with Algebraic Rewriting.
  Theoretical Computer Science, volume 170, pages 173-207, 1996. Abstract.
  Review by B. Venneri, MathSciNet

  Conferences:

  M. Fernández. Nominal Techniques for Software Specification and Verification. Proceedings of 29th CADE and 8th FSCD. LNCS and LIPICS (Abstract of Joint Invited Talk). 2023.

  J. Cheney and M. Fernández. Nominal Matching Logic. PPDP '22: Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming, September 2022. ACM Press https://doi.org/10.1145/3551357.3551375

  E. Fairweather, M. Fernández, N. Szasz, A. Tasistro. Dependent types for nominal terms with atom substitutions. In Proceedings of TLCA 2015, 13th International Conference on Typed Lambda Calculi and Applications, Warsaw, July 1-3 2015. Volume 38, LIPIcs, 2015.

  M. Ayala-Rincón, M. Fernández, M. J. Gabbay, A. C. Rocha-Oliveira. Checking Overlaps of Nominal Rewriting Rules. In Proceedings of Logical and Semantic Frameworks, with Applications (LSFA 2015), ENTCS 2016.

  J. Dominguez, M. Fernandez. Relating Nominal and Higher-Order Rewriting. Proc eedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014). Lecture Notes in Computer Science, Springer, 2014.

  M. Fernandez, J. Terrell. Assembling the Proofs of Ordered Model Transformations. Proceedings of FESCA 2013, 10th International Workshop on Formal Engineering Approaches to Software Components and Architectures, Rome, Italy, March 2013. EPTCS, 2013.

  M. Fernandez, A. Rubio. Nominal Completion for Rewrite Systems with Binding. Proceedings of ICALP 2012, 39th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer.

  E. Fairweather, M. Fernandez, M.J. Gabbay. Principal Types for Nominal Theories. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT 2011), Oslo, August 2011, Lecture Notes in Computer Science, Springer.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linearity and Recursion in a Typed Lambda Calculus. Proceedings of the 13th International ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming} (PPDP 2011), Odense, 2011. ACM Press.

  M.Fernández and M.J. Gabbay. Closed nominal rewriting and efficiently computable nominal algebra equality. In Proceedings of the 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2010), FLoC 2010. EPTCS 34, 2010. pdf

  M. Fernandez and N. Siafakas. Labelled lambda-calculi with explicit copy and erase. In Proceedings of Linearity 2009, Coimbra, Portugal, September 2009. In Proceedings of Linearity 2009, Coimbra, Portugal, September 2009. Electronic Proceedings in Theoretical Computer Science, Volume 22, DOI: 10.4204/EPTCS.22, ISSN: 2075-2180, 2010.

  M. Fernandez and N. Siafakas. New developments in abstract machines. In Proceedings of the 8th Workshop on Rewriting Strategies in Rewriting and Programming (WRS 2008), Castle Hagenberg, Austria, 2008. Electronic Notes in Theoretical Computer Science, Elsevier.
  pdf©Elsevier 2009.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Iterator Types
  In Proceedings of FOSSACS 2007, Braga, Portugal, March 2007. LNCS 4423, Springer, 2007. pdf©Springer 2007.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linear Recursive Functions
  Rewriting, Computation and Proof}, Essays dedicated to Jean-Pierre Jouannaud on the occasion of his 60th birthday. LNCS 4600 Festchrift, Springer, 2007.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. System T Revisited
  Workshop on Linear Logic, Ludics, Implicit Complexity and Operator Algebras: Dedicated to Jean-Yves Girard on his 60th birthday. Siena, Italy, 2007.

  M. Fernandez and M.J. Gabbay. Curry style types for nominal terms.
  In the Proceedings of TYPES 2006, Lecture Notes in Computer Science 4502, Springer, 2007. pdf©Springer 2007.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. The power of linear functions.
  Proceedings of the Int. Conf. Computer Science Logic (CSL 2006), Szeged, Hungary , September 2006. LNCS 4207, Springer, 2006. pdf©Springer 2006.

  H. Cirstea, G. Faure, M. Fernandez, I. Mackie, F-R. Sinot. From functional programs to interaction nets via the rewriting calculus.
  Proceedings of the 6th International Workshop on Rewriting Strategies in Rewriting and Programming (WRS 2006), Electronic Notes in Theoretical Computer Science Volume 174, Issue 10, July 2007, Pages 39-56. Elsevier. http://dx.doi.org/10.1016/j.entcs.2007.02.046

  S. Alves, M. Fernandez, M. Florido, I. Mackie. The power of closed-reduction strategies.
  Proceedings of the 6th International Workshop on Rewriting Strategies in Rewriting and Programming (WRS 2006), Electronic Notes in Theoretical Computer Science Volume 174, Issue 10, July 2007, Pages 39-56. Elsevier. http://dx.doi.org/10.1016/j.entcs.2007.02.047

  M. Fernandez and M.J. Gabbay. Nominal Rewriting with Name Generation: Abstraction vs. Locality.
  Proc. of the 7th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'05), Lisbon, 2005. ACM Press. Postcript©ACM 2005.

  M. Fernandez, M.J. Gabbay and I. Mackie. Nominal Rewriting Systems.
  Proc. of the 6th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'04), Verona, 2004. ACM Press.Postcript©ACM 2004.

  F-R. Sinot, M. Fernandez and I. Mackie. Efficient Reductions with Director Strings.
  Proc. of the Int. Conference on Rewriting Techniques and Applications (RTA'03), Valencia, 2003. LNCS, Springer, 2003.Postcript©Springer 2003.

  M. Fernandez and I. Mackie. Call by value lambda-graph rewriting --- without rewriting.
  Proc. of the Int. Conference on Graph Transformations (ICGT'02), Barcelona, 2002. LNCS 2505, Springer, 2002.Postcript©Springer 2003.

  M. Fernandez and P. Severi. An operational approach to program extraction in the Calculus of Constructions
  Proc. of the Int. Workshop on Logic Based Program Development and Transformation (LOPSTR'02), Madrid, 2002. LNCS, Springer, 2002.Postcript©Springer 2002.

  M. Fernandez, I. Mackie, P. Severi and N.Szasz. A uniform approach to program extraction: Pure Type Systems with Ultra-Sigma Types.
  Proc. XXVIII Conferencia Latinoamericana de Informatica (CLEI'02), InfoUYclei, Montevideo, 2002.
  Eds. A. Viola, M. Lasarte, D. Perovich, M. Solari and A. Vignaga. ISBN: 9974-7704-1-6. Postcript.

  M. Fernandez and I. Mackie. Director Strings and Explicit Substitutions.
  Workshop on Explicit Substitutions and Applications, WESTAPP'01, Utrecht, 2001. Postcript.

  S. van Bakel, F. Barbanera, M. Fernandez. Polymorphic intersection type assignment for rewrite systems with abstraction and beta-rule.
  In Types for Proofs and Programs, Proceedings TYPES'99, LNCS 1956, Springer 2000. Postcript©Springer 2000.

  M. Fernandez and I. Mackie. Closed reductions in the lambda-calculus.
  Proceedings of CSL'99, Computer Science Logic, Madrid. LNCS 1683. 1999. Postcript©Springer 1999.

  S. van Bakel, F. Barbanera, M. Fernandez. Rewrite Systems with Abstraction and Beta-rule: Types, Approximants and Normalization.
  In Proceedings ESOP'96, Linkoping, Sweden, 1996. LNCS 1058. dvi©Springer 1996.

  S. van Bakel, M. Fernandez. Approximation and Normalization Results for Typable Term Rewriting Systems.
  In Proceedings HOA'95 (Higher-Order Algebra, Logic, and Term Rewriting), Paderborn, Germany, 1995. LNCS 1074. PostScript©Springer 1995.

  S. van Bakel, M. Fernandez. (Head-) Normalization of Typeable Rewrite Systems.
  In Proc. RTA'95, Kaiserslautern, 1995. LNCS 914. dvi©Springer 1995.

  F. Barbanera, M. Fernandez, H. Geuvers. Modularity of Strong Normalization and Confluence in the algebraic lambda-cube. (Extended Abstract)
  In Proc. 9th IEEE Symp. of Logic in Computer Science (LICS'94), Paris, 1994. PostScript.

  M. Fernandez, J-P. Jouannaud. Modular Termination of Term Rewriting Systems Revisited.
  In Proc. ADT'94. S. Margherita, Italy, 1994. LNCS 906. dvi.

  F. Barbanera, M. Fernandez. Modularity of termination and confluence in combinations of rewrite systems with Lambda_omega.
  In Proc. ICALP'93, Lund, 1993. LNCS 820. dvi©Springer 1993.

  F. Barbanera, M. Fernandez. Combining First and Higher Order Rewrite Systems with Type Assignment Systems.
  In Proc. TLCA'93, Utrecht, 1993. LNCS 664. dvi©Springer 1993.

  S. van Bakel, M. Fernandez. Strong Normalization of Typeable Rewrite Systems.
  In Proc. HOA'93, Amsterdam, 1993. LNCS 816. dvi.

• On unification, disunification, complement problems:

  Journals:

  Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Temur Kutsia, Daniele Nantes-Sobrinho. Certified First-Order AC-Unification and Applications. Journal of Automated Reasoning, 2024.

  Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Daniele Nantes-Sobrinho. Formalising nominal C-unification generalised with protected variables. Mathematical Structures in Computer Science. First published online May 2021. Cambridge University Press.

  Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sob rinho. On nominal syntax and permutation fixed points. Logical Methods in Computer Science, Volume 16, Issue 1 (2020). pdf

  C. Calves and M. Fernandez. Matching and Alpha-Equivalence Check for Nominal Terms. Journal of Computer and System Sciences. Special issue: Logic, Language and Computation (Selected papers from WOLLIC 2008), Volume 76, Issue 5, Pages 283-301, 2010. Elsevier.

  C. Calves and M. Fernandez. A polynomial nominal unification algorithm. Theoretical Computer Science, 2008. Available from http://dx.doi.org/10.1016/j.tcs.2008.05.012

  M. Fernandez. Negation Elimination in Empty or Permutative Equational Theories.
  In the Journal of Symbolic Computation, Volume 26, pages 97-133. Academic PressLimited, 1998. Abstract.
  Review by Alexander Leitsch, MathSciNet

  M. Fernandez. AC Complement Problems: Satisfiability and Negation Elimination.
  In the Journal of Symbolic Computation, Volume 22, pages 49-82. Academic PressLimited, 1996. Abstract.

  M. Fernandez. Narrowing based procedures for equational disunification.
  In Applicable Algebra in Engineering, Communication and Computing, Vol.3, pages 1-26. Springer-Verlag, 1992. Abstract.

  Conferences:

  M. Ayala-Rincón, M. Fernández, T. Kutsia, G. Ferreira Silva, D. Nantes-Sobrinho. Nominal AC-Matching. Proceedings of the 16th Conference on Intelligent Computer Mathematics, CICM 2023. LNCS.

  M. Ayala-Rincón, M. Fernández, G. Ferreira Silva, D. Nantes-Sobrinho. A Certified Algorithm for AC-Unification. FSCD 2022, Proceedings of the International Conference on Formal Structures for Computation and Deduction, FSCD 2022, Haifa, August 2022 (part of FLoC). LiPICS, 2022.

  M. Ayala-Rincón, M. Fernández, D. Nantes-Sobrinho, D. Vale. Nominal Equational Problems. Foundations of Software Science and Computation Structures. 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings. Lecture Notes in Computer Science 12650, Springer. pdf

  M. Ayala-Rincón, M. Fernández, G. Ferreira Silva, Daniele Nantes-Sobrinho. A Certified Functional Nominal C-Unification Algorithm. Proceedings of LOPSTR 2019, Lecture Notes in Computer Science, Springer, 2020.

  J. Dominguez, M. Fernández. Nominal Syntax with Atom Substitution: Matching, Unification, Rewriting. Proceedings of FCT 2019, 22nd International Symposium on Fundamentals of Computation Theory, Copenhagen, August 2019. Lecture Notes in Computer Science, Springer.

  M. Ayala-Rincón, M. Fernández, D. Nantes-Sobrinho. Fixed-Point Constraints for Nominal Equational Unification. In Proceedings of FSCD 2018 - International Conference on Formal Structures for Computation and Deduction. Oxford, 9-12 July 2018. LIPIcs, 108, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2018, ISBN 978-3-95977-077-4.

  M. Ayala-Rincón, W. de Carvalho-Segundo, M. Fernández, D. Nantes-Sobrinho. Nominal C Unification. Proceedings of LOPSTR 2017, LNCS, Springer 2018.

  M. Ayala-Rincón, W. de Carvalho-Segundo, M. Fernández, D. Nantes-Sobrinho. On solving nominal fixpoint equations. FroCoS 2017, LNAI, Springer 2017.

  M. Ayala-Rincón, M. Fernández, D. Nantes-Sobrinho. Nominal Narrowing. In Proceedings of International Conference on Formal Structures for Computation and Deduction. Porto, 23-26 June 2016. LIPIcs, 2016.

  M. Ayala-Rincón, M. Fernández, A. C. Rocha-Oliveira. Completeness in PVS of a Nominal Unification Algorithm. In Proceedings of Logical and Semantic Frameworks, with Applications (LSFA 2015), ENTCS 2016.

  M. Fernández. Nominal Graphs - Joint GT-VMT and TERMGRAPH Invited Talk. Abstract in Proceedings of TERMGRAPH 2011, EPTCS.

  C. Calves, M. Fernández. The first-order nominal link Proceedings of LOPSTR 2010, LNCS 6564, Springer, 2011.

  C. Calves, M. Fernández. Nominal Matching and Alpha-Equivalence. Proceedings of WOLLIC 2008, LNAI 5110, Springer, 2008.

  C. Calves, M. Fernández. Implementing Nominal Unification. Proceedings 3rd Int. Workshop on Term Graph Rewriting (TERMGRAPH'06), Vienna, 2006. Electronic Notes in Theoretical Computer Science, Volume 176, Issue 1, 2007, Pages 25-37. pdf© ENTCS 2007.

  M. Fernández. AC-Complement Problems: Satisfiability and Negation Elimination (Extended Abstract).
  In Proc. RTA'93, Montreal, 1993. LNCS 690. dvi.

  H. Comon, M. Fernández. Negation Elimination in Equational Formulae.
  In Proc. MFCS'92, Praha, 1992. LNCS 629. dvi.

• On graph rewriting, interaction nets, concurrency:

  Journals:

  M. Fernández, H. Kirchner, B. Pinaud. Strategic Port Graph Rewriti ng: An Interactive Modelling Framework. Mathematical Structures in Computer Scie nce, 2018.

  M. Fernández, H. Kirchner, B. Pinaud, J. Vallet. Labelled-graph strategic rewriting for social networks. Special Issue, Journal of Logic and Algebraic Methods in Programming (JLAMP), 2018.

  M. Fernandez, L. Khalil. Interaction nets with McCarthy's amb: Properties and Applications.
  Nordic Journal of Computing, Vol.10, Number 2, 2003. Postcript.

  M. Fernandez and I. Mackie. Operational Equivalence for Interaction Nets.
  Theoretical Computer Science, volume 297, issue 1-3, pages 157-181, 2003.
  Special Issue: Latin American Theoretical Informatics. Abstract.

  M. Fernandez and I. Mackie. Interaction Nets and Term Rewriting Systems.
  Theoretical Computer Science, volume 190, pages 3-39, 1998. Special Issue (Selected papers from CAAP'96). Abstract.

  M. Fernandez. Type Assignment and Termination of Interaction Nets.
  Mathematical Structures in Computer Science, vol.8, pages 593-636, 1998. Special Issue, Colloquium on Logic and Models of Computation, Marseille 1996.
  PostScript.

  Conferences:

  M. Fernández, I. Mackie. Hierarchical Higher-Order Port Graphs: A Rewriting-Based Modelling Language. Proceedings of the ACM Symposium on Principles and Practice of Declarative Programming, PPDP 2024, Milan, September 2024. ACM Press.

  Maribel Fernández, Janos Varga. Finding Candidate Keys and 3NF via Strategic Port Graph Re writing. Proceedings of the ACM Conference on Principles and Practice of Declarative Programming, PPDP 2020. Bologna, Italy, September 2020. ACM Press.

  M. Fernández, Bruno Pinaud and Janos Varga. A Port Graph Rewriting Approach to Relational Database Modelling. Proceedings of LOPSTR 2019, Lecture N otes in Computer Science, Springer, 2020.

  N. Ene, M. Fernández, B. Pinaud. Attributed Hierarchical Port Graphs and Applications. Proceedings of WPTE 2017, EPTCS, 2018.

  M. Fernández, H. Kirchner, B. Pinaud, J. Vallet. Labelled Graph Rewriting Meets Social Networks. In Proceedings of the International Workshop on Rewriting Logic and Applications (WRLA 2016). Eindhoven, April 2016. Lecture Notes in Computer Science. Springer.

  Abeer S. Al-Humaimeedy and Maribel Fernández. Enhancing the specification and verification techniques of multiparty sessions in SOC. Proceedings of PPDP 2015, 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 14-16, 2015. ISBN 978-1-4503-3516-4, pages 19-30. ACM Press 2015.

  M. Fernandez, H. Kirchner, I. Mackie, B. Pinaud. Visual Modelling of Complex Systems : Towards an Abstract Machine for PORGY. In Proceedings of Computability in Europe (CiE 2014, Budapest, June 2014). Invited paper (keynote presentation by the first author). Lecture Notes in Computer Science, Springer, 2014.

  Abeer Al-Humaimeedy and Maribel Fernández. Enabling Synchronous and Asynchronous Communications in CSP. Proceedings of the 9th Int. Workshop on Logic and Semantic Frameworks, with Applications. Brasilia, September 2014. EPTCS.

  M. Fernandez, H. Kirchner, B. Pinaud. Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework. Proceedings of GRAPHITE 2014, ETAPS, Grenoble. EPTCS, 2014.

  M. Fernandez, I. Mackie, M. Walker. Bigraphical Nets. Proceedings of TERMGRAPH 2013, 7th International Workshop on Computing with Terms and Graphs, Rome, Italy, March 2013. EPTCS, 2013.

  A. Al-Humaimeedy and M. Fernandez. General Dynamic Recovery for Compensating CSP. Proceedings of the 8th Int. Workshop on Developments in Computation Models (DCM 2012), part of CiE 2012, Cambridge, June 2012. EPTCS, 2013.

  M. Fernandez, S. Maulat. Higher-order port-graph rewriting. Proceedings of LINEARITY 2012, ETAPS, Talinn, 2012. EPTCS, 2013, pages 25-37.

  M. Fernandez, H. Kirchner, O. Namet.A Strategy Language for Graph Rewriting. Proceedings of LOPSTR 2011, Logic-Based Program Synthesis and Transformation, Odense, 2011. To appear in Lecture Notes in Computer Science, Springer.

  O. Andrei, M. Fernandez, H. Kirchner, G. Melancon, O. Namet, B. Pinaud. PORGY: Strategy-Driven Interactive Transformation of Graphs. Proceedings of TERMGRAPH 2011, EPTCS.

  S. Alves, M. Fernandez, I. Mackie. A new graphical calculus of proofs. Proceedings of TERMGRAPH 2011, EPTCS.

  M. Fernández and O. Namet. Strategic programming on graph rewriting systems
  In Proceedings of the International Workshop on Strategies in Rewriting, Proving, and Programming, Edinburgh, UK, 9th July 2010. Electronic Proceedings in Theoretical Computer Science, Volume 44, DOI 10.4204/EPTCS.44 ISSN: 2075-2180, December 2010.

  M. Fernandez, I. Mackie, S. Sato, M. Walker. Recursive functions with pattern-matching in interaction nets. In Proceedings of TERMGRAPH 2009 - Electronic Notes in Theoretical Computer Science, Elsevier, 2009.

  M. Fernandez and O. Namet. Graph creation, visualisation and transformation. In Proceedings of the 10th International Workshop on Rule Based Programming, RULE 2009, part of the Federated Conference on Rewriting, Deduction, Programming. Brasilia, June 2009. Electronic Proceedings in Theoretical Computer Science.

  M. Fernandez andI. Mackie, F-R. Sinot. Interaction Nets vs. the Rho Calculus: Introducing Bigraphical Nets.
  Proc. of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS 2005), San Francisco, 2005. Electronic Notes in Theoretical Computer Science, Elsevier. PostScript.

  M. Fernandez andI. Mackie, F-R. Sinot. Strict Rho Calculus for Typed Functional Languages.
  Int. Workshop on Implementation and Application of Functional Languages, Technical Report, Dublin, 2005. Superseded by WRS'06.

  M. Fernandez, I. Mackie, and J. S. Pinto. A Higher-order Calculus for Graph Transformation.
  In Proc. of the First International Workshop on Term Graph Rewriting (TERMGRAPH 2002), Barcelona, 2002.
  Electronic Notes in Theoretical Computer Science, Vol. 72 (1), pages 45-58, 2007. doi:10.1016/j.entcs.2002.09.005 Postcript.

  M. Fernandez, L. Khalil. Interaction nets with McCarthy's amb.
  In Proc. of the 9th Int. Workshop on Expressiveness in Concurrency (EXPRESS'02), Brno, Czech Republic, 2002. U. Nestmann and P. Panangaden (eds.),
  Electronic Notes in Theoretical Computer Science, Vol. 68 (2), 2002. Postcript.

  M. Fernandez, I. Mackie, and J. S. Pinto. Combining Interaction Nets with Externally Defined Programs.
  Proc. of AGP'01, Joint Conference on Declarative Programming. Evora, Portugal, 2001. Postcript.

  M. Fernandez and I. Mackie. Packing Interaction Nets: Applications to Linear Logic and the Lambda-Calculus.
  Proc. of WAIT'01, JAIIO, Buenos Aires, 2001.

  M. Fernandez and I. Mackie. A Theory of Operational Equivalence for Interaction Nets.
  Proceedings of LATIN'2000, Punta del Este, Uruguay, 2000. LNCS 1776, Springer. Postcript.

  M. Fernandez and I. Mackie. A Calculus for Interaction Nets.
  Proceedings of PPDP'99, Principles and Practice of Declarative Programming, Paris, 1999. LNCS 1702, Springer. Postcript.

  M. Fernandez and I. Mackie. Coinductive Techniques for Operational Equivalence of Interaction Nets.
  In Proc. LICS'98, IEEE Symposium on Logic in Computer Science, Indianapolis, USA, 1998. Abstract.

  M. Fernandez and I. Mackie. From Term Rewriting to Generalised Interaction Nets.
  In Proc. PLILP'96, Aachen, Germany, 1996. LNCS 1140.PostScript.

  M. Fernandez and I. Mackie. Interaction Nets and Term Rewriting Systems (Extended abstract).
  In Proc. CAAP'96, Linkoping, Sweden, 1996. LNCS 1059. PostScript.

• On object calculus and rewriting:

  M. Fernandez, F. Fleutot. A historic functional and object oriented calculus.
  Proc. of the 8th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'06), Venice, 2006. ACM Press. pdf©ACM 2006.

  A. Compagnoni, M. Fernandez. An object calculus with algebraic rewriting.
  In Proc. PLILP'97, Southampton, 1997. LNCS 1292. PostScript©Springer 1997.