César Sánchez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
César Sánchez has a total of 179 co-authors. Here are the top co-authors by number of shared publications:
- Felipe Gorostiaga
IMDEA Software Institute
20 shared publications - Martin Leucker
University of Lübeck
13 shared publications - Borzoo Bonakdarpour
Michigan State University
10 shared publications - Martin Ceresa
IMDEA Software Institute
10 shared publications - Gerardo Schneider
University of Gothenburg and Chalmers University of Technology
8 shared publications Henny B. Sipma
Stanford University
8 shared publications
Latest Publications
- 11 November 2026
- Published by Springer Nature
- p. 138-148
UnAA-Lola: A Stream Runtime Verification Tool Supporting Uncertainties, Assumptions and Anticipation
- 11 November 2026
- Published by Springer Nature
- p. 138-148
UnAA-Lola: A Stream Runtime Verification Tool Supporting Uncertainties, Assumptions and Anticipation
- Open Access
- 26 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 27 (3) , 1-40
Extensions of HyperLTL for Asynchronous Hyperproperties
Hyperproperties are a modern specification paradigm that extends properties of a single trace to express properties of a set of traces. Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and enjoy a decidable model checking problem. In this paper, we introduce two asynchronous and orthogonal extensions of HyperLTL, Stuttering HyperLTL (HyperLTL S ) and Context HyperLTL (HyperLTL C ). Both of these extensions are useful, for instance, to formulate asynchronous variants of information-flow security properties. We show that for these logics, model checking is in general undecidable. On the positive side, for each of them, we identify a fragment with a decidable model checking problem that subsumes HyperLTL and that can express meaningful asynchronous requirements. Moreover, we provide the exact computational complexity of model checking for these two fragments which, for the (HyperLTL S ) fragment, coincides with that of the strictly less expressive logic HyperLTL.
- 26 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 27 (3) , 1-40
Open AccessExtensions of HyperLTL for Asynchronous Hyperproperties
Hyperproperties are a modern specification paradigm that extends properties of a single trace to express properties of a set of traces. Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and enjoy a decidable model checking problem. In this paper, we introduce two asynchronous and orthogonal extensions of HyperLTL, Stuttering HyperLTL (HyperLTL S ) and Context HyperLTL (HyperLTL C ). Both of these extensions are useful, for instance, to formulate asynchronous variants of information-flow security properties. We show that for these logics, model checking is in general undecidable. On the positive side, for each of them, we identify a fragment with a decidable model checking problem that subsumes HyperLTL and that can express meaningful asynchronous requirements. Moreover, we provide the exact computational complexity of model checking for these two fragments which, for the (HyperLTL S ) fragment, coincides with that of the strictly less expressive logic HyperLTL.
- Open Access
- 18 May 2026
- Published by Springer Nature
- p. 50-70
Maximum Realizability for LTL Modulo Theories
The synthesis of systems from formal specifications is a fundamental problem in symbolic AI and formal methods where the goal is to automatically construct implementations that meet desired requirements. In practice, specifications often include both hard constraints (critical requirements) and soft constraints (desirable properties). However, when specifications are unrealizable (due to conflicts between requirements) traditional synthesis methods fail to provide meaningful implementations or guidance. This problem has been addressed with maximum realizability , a framework for synthesizing systems that satisfy hard constraints while maximizing the satisfaction of soft constraints. However, the literature only solves this technique for classic discrete Linear Temporal Logic (LTL), whereas its extension to richer LTL modulo theories ( $$LTL _{\mathcal {T}} $$ ) remains unexplored. In this paper, we bridge this gap and we propose two approaches: (1) a method based on exhaustively traversing a set of abstractions and (2) an alternative method that incrementally refines abstractions during synthesis. Additionally, (3) we introduce lattice-based optimization techniques to further improve scalability by pruning uninteresting combinations of soft constraints. Our methods are evaluated on benchmarks from synthesis competitions and practical case studies, demonstrating their scalability and effectiveness.- 18 May 2026
- Published by Springer Nature
- p. 50-70
Open AccessMaximum Realizability for LTL Modulo Theories
The synthesis of systems from formal specifications is a fundamental problem in symbolic AI and formal methods where the goal is to automatically construct implementations that meet desired requirements. In practice, specifications often include both hard constraints (critical requirements) and soft constraints (desirable properties). However, when specifications are unrealizable (due to conflicts between requirements) traditional synthesis methods fail to provide meaningful implementations or guidance. This problem has been addressed with maximum realizability , a framework for synthesizing systems that satisfy hard constraints while maximizing the satisfaction of soft constraints. However, the literature only solves this technique for classic discrete Linear Temporal Logic (LTL), whereas its extension to richer LTL modulo theories ( $$LTL _{\mathcal {T}} $$ ) remains unexplored. In this paper, we bridge this gap and we propose two approaches: (1) a method based on exhaustively traversing a set of abstractions and (2) an alternative method that incrementally refines abstractions during synthesis. Additionally, (3) we introduce lattice-based optimization techniques to further improve scalability by pruning uninteresting combinations of soft constraints. Our methods are evaluated on benchmarks from synthesis competitions and practical case studies, demonstrating their scalability and effectiveness. - Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Bounding Byzantine Impact in Open CRDT Systems
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Open AccessBounding Byzantine Impact in Open CRDT Systems
- Open Access
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. PP (08908044) , 1-10
The Optical Architecture of a Heterogeneous Quantum Network Deployed in Production Facilities
Quantum Communications promise advances in cryptography, quantum computing and clock synchronisation, among other emerging applications. However, communication based on quantum phenomena requires an extreme level of isolation from external disturbances, complicating the co-propagation of quantum and classical signals. The challenge is greater when deploying networks that are both heterogeneous (e.g., multiple vendors) and installed in production facilities, given that this type of infrastructure already supports networks loaded with their own requirements. Moreover, to achieve a broad acceptance among network operators, the joint management and operation of quantum and classical resources, compliance with standards, and legal and quality assurance need to be addressed. This article presents solutions to the aforementioned challenges validated in the Madrid quantum network during the implementation of the projects CiViC and OpenQKD. This network was designed to integrate quantum communications in the telecommunications ecosystem by installing quantum-key-distribution modules from multiple providers in production nodes of two different operators. The modules were connected through an optically-switched network with more than 130 km of deployed optical fibre. The tests were done in compliance with strict service level agreements that protected the legacy traffic of the pre-existing classical network. The goal was to ensure full quantum-classical interoperability at all levels, while limiting the modifications to optical transport and encryption and complying with relevant standards. This effort is intended to lay the foundation for large-scale quantum network deployments.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. PP (08908044) , 1-10
Open AccessThe Optical Architecture of a Heterogeneous Quantum Network Deployed in Production Facilities
Quantum Communications promise advances in cryptography, quantum computing and clock synchronisation, among other emerging applications. However, communication based on quantum phenomena requires an extreme level of isolation from external disturbances, complicating the co-propagation of quantum and classical signals. The challenge is greater when deploying networks that are both heterogeneous (e.g., multiple vendors) and installed in production facilities, given that this type of infrastructure already supports networks loaded with their own requirements. Moreover, to achieve a broad acceptance among network operators, the joint management and operation of quantum and classical resources, compliance with standards, and legal and quality assurance need to be addressed. This article presents solutions to the aforementioned challenges validated in the Madrid quantum network during the implementation of the projects CiViC and OpenQKD. This network was designed to integrate quantum communications in the telecommunications ecosystem by installing quantum-key-distribution modules from multiple providers in production nodes of two different operators. The modules were connected through an optically-switched network with more than 130 km of deployed optical fibre. The tests were done in compliance with strict service level agreements that protected the legacy traffic of the pre-existing classical network. The goal was to ensure full quantum-classical interoperability at all levels, while limiting the modifications to optical transport and encryption and complying with relevant standards. This effort is intended to lay the foundation for large-scale quantum network deployments.
- Open Access
- 20 December 2025
- Published by Elsevier in Information and Software Technology
- Vol. 191
Symbolic runtime verification for monitoring under uncertainties and assumptions
- 20 December 2025
- Published by Elsevier in Information and Software Technology
- Vol. 191
Open AccessSymbolic runtime verification for monitoring under uncertainties and assumptions
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2129-2143
A Secure Sequencer and Data Availability Committee for Rollups
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2129-2143
Open AccessA Secure Sequencer and Data Availability Committee for Rollups
- 18 November 2025
- Published by Springer Nature
- p. 287-302
Invited Paper: Setchain Algorithms for Blockchain Scalability
- 18 November 2025
- Published by Springer Nature
- p. 287-302
Invited Paper: Setchain Algorithms for Blockchain Scalability
- 1 November 2025
- Published by Springer Nature
- p. 25-43
(Asynchronous) Temporal Logics for Hyperproperties on Finite Traces
- 1 November 2025
- Published by Springer Nature
- p. 25-43
(Asynchronous) Temporal Logics for Hyperproperties on Finite Traces
- 26 October 2025
- Published by Springer Nature
- p. 157-179
Efficient Dynamic Shielding for Parametric Safety Specifications
- 26 October 2025
- Published by Springer Nature
- p. 157-179
Efficient Dynamic Shielding for Parametric Safety Specifications