José Meseguer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
José Meseguer has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Narciso Martí-Oliet
Universidad Complutense de Madrid
5 shared publications - Catherine Meadows
U.S. Naval Research Laboratory
2 shared publications - Grigore Roşu
University of Illinois at Urbana-Champaign
2 shared publications - Kyungmin Bae
University of Illinois at Urbana-Champaign
2 shared publications - Miguel Palomino
Universidad Complutense de Madrid
2 shared publications - Peter Csaba Ölveczky
University of Oslo, Oslo, Norway
2 shared publications
Latest Publications
- 8 September 2018
- Published by Springer Nature
- p. 184-204
Proving Ground Confluence of Equational Specifications Modulo Axioms
- 8 September 2018
- Published by Springer Nature
- p. 184-204
Proving Ground Confluence of Equational Specifications Modulo Axioms
- Open Access
Effective Sequential Protocol Composition in Maude-NPA
Protocols do not work alone, but together, one protocol relying on another to provide needed services. Many of the problems in cryptographic protocols arise when such composition is done incorrectly or is not well understood. In this paper we discuss an extension to the Maude-NPA syntax and its operational semantics to support dynamic sequential composition of protocols, so that protocols can be specified separately and composed when desired. This allows one to reason about many different compositions with minimal changes to the specification, as well as improving, in terms of both performance and ease of specification, on an earlier composition extension we presented in [18]. We show how compositions can be defined and executed symbolically in Maude-NPA using the compositional syntax and semantics. We also provide an experimental analysis of the performance of Maude-NPA using the compositional syntax and semantics, and compare it to the performance of a syntax and semantics for composition developed in earlier research. Finally, in the conclusion we give some lessons learned about the best ways of extending narrowing-based state reachability tools, as well as comparison with related work and future plans.
Open AccessEffective Sequential Protocol Composition in Maude-NPA
Protocols do not work alone, but together, one protocol relying on another to provide needed services. Many of the problems in cryptographic protocols arise when such composition is done incorrectly or is not well understood. In this paper we discuss an extension to the Maude-NPA syntax and its operational semantics to support dynamic sequential composition of protocols, so that protocols can be specified separately and composed when desired. This allows one to reason about many different compositions with minimal changes to the specification, as well as improving, in terms of both performance and ease of specification, on an earlier composition extension we presented in [18]. We show how compositions can be defined and executed symbolically in Maude-NPA using the compositional syntax and semantics. We also provide an experimental analysis of the performance of Maude-NPA using the compositional syntax and semantics, and compare it to the performance of a syntax and semantics for composition developed in earlier research. Finally, in the conclusion we give some lessons learned about the best ways of extending narrowing-based state reachability tools, as well as comparison with related work and future plans.
- 16 November 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 195-212
2D Dependency Pairs for Proving Operational Termination of CTRSs
- 16 November 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 195-212
2D Dependency Pairs for Proving Operational Termination of CTRSs
- Open Access
- 29 December 2012
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 105, 5-21
PALS-Based Analysis of an Airplane Multirate Control System in Real-Time Maude
Distributed cyber-physical systems (DCPS) are pervasive in areas such as aeronautics and ground transportation systems, including the case of distributed hybrid systems. DCPS design and verification is quite challenging because of asynchronous communication, network delays, and clock skews. Furthermore, their model checking verification typically becomes unfeasible due to the huge state space explosion caused by the system's concurrency. The PALS ("physically asynchronous, logically synchronous") methodology has been proposed to reduce the design and verification of a DCPS to the much simpler task of designing and verifying its underlying synchronous version. The original PALS methodology assumes a single logical period, but Multirate PALS extends it to deal with multirate DCPS in which components may operate with different logical periods. This paper shows how Multirate PALS can be applied to formally verify a nontrivial multirate DCPS. We use Real-Time Maude to formally specify a multirate distributed hybrid system consisting of an airplane maneuvered by a pilot who turns the airplane according to a specified angle through a distributed control system. Our formal analysis revealed that the original design was ineffective in achieving a smooth turning maneuver, and led to a redesign of the system that satisfies the desired correctness properties. This shows that the Multirate PALS methodology is not only effective for formal DCPS verification, but can also be used effectively in the DCPS design process, even before properties are verified.Comment: In Proceedings FTSCS 2012, arXiv:1212.657
- 29 December 2012
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 105, 5-21
Open AccessPALS-Based Analysis of an Airplane Multirate Control System in Real-Time Maude
Distributed cyber-physical systems (DCPS) are pervasive in areas such as aeronautics and ground transportation systems, including the case of distributed hybrid systems. DCPS design and verification is quite challenging because of asynchronous communication, network delays, and clock skews. Furthermore, their model checking verification typically becomes unfeasible due to the huge state space explosion caused by the system's concurrency. The PALS ("physically asynchronous, logically synchronous") methodology has been proposed to reduce the design and verification of a DCPS to the much simpler task of designing and verifying its underlying synchronous version. The original PALS methodology assumes a single logical period, but Multirate PALS extends it to deal with multirate DCPS in which components may operate with different logical periods. This paper shows how Multirate PALS can be applied to formally verify a nontrivial multirate DCPS. We use Real-Time Maude to formally specify a multirate distributed hybrid system consisting of an airplane maneuvered by a pilot who turns the airplane according to a specified angle through a distributed control system. Our formal analysis revealed that the original design was ineffective in achieving a smooth turning maneuver, and led to a redesign of the system that satisfies the desired correctness properties. This shows that the Multirate PALS methodology is not only effective for formal DCPS verification, but can also be used effectively in the DCPS design process, even before properties are verified.Comment: In Proceedings FTSCS 2012, arXiv:1212.657
- Open Access
- 14 December 2012
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 290, 37-50
Order-sorted Equational Unification Revisited
- 14 December 2012
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 290, 37-50
Open AccessOrder-sorted Equational Unification Revisited
- Open Access
- 14 December 2012
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 290, 19-36
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
- 14 December 2012
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 290, 19-36
Open AccessA Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
- Open Access
- 1 December 2009
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 258 (1) , 3-20
A Graphical User Interface for Maude-NPA
- 1 December 2009
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 258 (1) , 3-20
Open AccessA Graphical User Interface for Maude-NPA
- Open Access
- 1 May 2008
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 200 (3) , 25-41
Reduction Semantics and Formal Analysis of Orc Programs
- 1 May 2008
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 200 (3) , 25-41
Open AccessReduction Semantics and Formal Analysis of Orc Programs
- Open Access
- 1 April 2008
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 206, 91-110
Algebraic Stuttering Simulations
- 1 April 2008
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 206, 91-110
Open AccessAlgebraic Stuttering Simulations
- Open Access
- 1 October 2007
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 192 (1) , 125-141
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
- 1 October 2007
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 192 (1) , 125-141
Open AccessA Rewriting Logic Approach to Operational Semantics (Extended Abstract)