Montserrat Hermo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Montserrat Hermo has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Paqui Lucio
LoRea Group, University of the Basque, Country UPV/EHU
8 shared publications - Jose Gaintzarain
University of the Basque Country, Bilbao, Spain
5 shared publications - Marisa Navarro
Universidad del País Vasco
5 shared publications - Fernando Orejas
Universitat Politecnica de Catalunya, Barcelona, Spain
3 shared publications - César Sánchez
IMDEA Software Institute
2 shared publications Harry Buhrman
2 shared publications
Latest Publications
- Open Access
- 27 October 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 152
Proving correctness of problem reductions using Dafny
- 27 October 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 152
Open AccessProving correctness of problem reductions using Dafny
- Open Access
- 12 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 182-190
Learning Unions of Intersecting Affine Modules in One Dimension with Queries
We study the exact learnability of finite unions of intersecting affine modules in one dimension. An affine module is a set of the form \(a+\sum _{j=1}^{s}b_j \mathbb {Z}\) , where \(a,b_1,\ldots,b_s\in \mathbb {N}\) . We say that a set definable as a finite union of affine modules is a union of intersecting affine modules if it admits a representation in which all modules have a non-empty intersection. We show that this class is efficiently exactly learnable using equivalence and subset queries. Moreover, subset queries can be replaced with membership queries when a common element is known. Our algorithm requires at most klog (2|xℓ|) + 2k counterexamples, where k is the number of affine modules in the smallest representation and xℓ is the largest counterexample. This implies polynomial-time learnability in the binary representation.- 12 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 182-190
Open AccessLearning Unions of Intersecting Affine Modules in One Dimension with Queries
We study the exact learnability of finite unions of intersecting affine modules in one dimension. An affine module is a set of the form \(a+\sum _{j=1}^{s}b_j \mathbb {Z}\) , where \(a,b_1,\ldots,b_s\in \mathbb {N}\) . We say that a set definable as a finite union of affine modules is a union of intersecting affine modules if it admits a representation in which all modules have a non-empty intersection. We show that this class is efficiently exactly learnable using equivalence and subset queries. Moreover, subset queries can be replaced with membership queries when a common element is known. Our algorithm requires at most klog (2|xℓ|) + 2k counterexamples, where k is the number of affine modules in the smallest representation and xℓ is the largest counterexample. This implies polynomial-time learnability in the binary representation. - Open Access
- 10 July 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 151
Massive Unification
- 10 July 2026
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 151
Open AccessMassive Unification
- 3 March 2023
- Published by Springer Nature
- p. 495-513
Tableaux for Realizability of Safety Specifications
- 3 March 2023
- Published by Springer Nature
- p. 495-513
Tableaux for Realizability of Safety Specifications
- Open Access
A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications
We introduce a tableau decision method for deciding realizability of specifications expressed in a safety fragment of LTL that includes bounded future temporal operators. Tableau decision procedures for temporal and modal logics have been thoroughly studied for satisfiability and for translating temporal formulae into equivalent B\"uchi automata, and also for model checking, where a specification and system are provided. However, to the best of our knowledge no tableau method has been studied for the reactive synthesis problem. Reactive synthesis starts from a specification where propositional variables are split into those controlled by the environment and those controlled by the system, and consists on automatically producing a system that guarantees the specification for all environments. Realizability is the decision problem of whether there is one such system. In this paper we present a method to decide realizability of safety specifications, from which we can also extract (i.e. synthesize) a correct system (in case the specification is realizable). Our method can easily be extended to handle richer domains (integers, etc) and bounds in the temporal operators in ways that automata approaches for synthesis cannot.
Open AccessA Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications
We introduce a tableau decision method for deciding realizability of specifications expressed in a safety fragment of LTL that includes bounded future temporal operators. Tableau decision procedures for temporal and modal logics have been thoroughly studied for satisfiability and for translating temporal formulae into equivalent B\"uchi automata, and also for model checking, where a specification and system are provided. However, to the best of our knowledge no tableau method has been studied for the reactive synthesis problem. Reactive synthesis starts from a specification where propositional variables are split into those controlled by the environment and those controlled by the system, and consists on automatically producing a system that guarantees the specification for all environments. Realizability is the decision problem of whether there is one such system. In this paper we present a method to decide realizability of safety specifications, from which we can also extract (i.e. synthesize) a correct system (in case the specification is realizable). Our method can easily be extended to handle richer domains (integers, etc) and bounds in the temporal operators in ways that automata approaches for synthesis cannot.
- 19 June 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (5) , 1-24
Verified Model Checking for Conjunctive Positive Logic
- 19 June 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (5) , 1-24
Verified Model Checking for Conjunctive Positive Logic
- 2 December 2011
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 50 (1) , 1-49
Invariant-Free Clausal Temporal Resolution
- 2 December 2011
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 50 (1) , 1-49
Invariant-Free Clausal Temporal Resolution
- 19 July 2011
- Published by Elsevier in Information Processing Letters
- Vol. 111 (19) , 968-972
Negative results on learning multivalued dependencies with queries
- 19 July 2011
- Published by Elsevier in Information Processing Letters
- Vol. 111 (19) , 968-972
Negative results on learning multivalued dependencies with queries
- 28 March 2010
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (16-18) , 1723-1733
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
- 28 March 2010
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (16-18) , 1723-1733
Translating propositional extended conjunctions of Horn clauses into Boolean circuits