João Lourenço
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
João Lourenço has a total of 106 co-authors. Here are the top co-authors by number of shared publications:
- Hervé Paulino
NOVA University Lisbon, Caparica, Portugal
14 shared publications - Ricardo J. Dias
Universidade Nova de Lisboa
14 shared publications - Joao A. Silva
Universidade Nova de Lisboa, Caparica, Portugal
9 shared publications - Jose C. Cunha
NOVA LINCS, NOVA School of Science and Technology
7 shared publications - Tiago M. Vale
Universidade Nova de Lisboa
6 shared publications - Nuno Preguiça
Universidade Nova de Lisboa, Lisboa, Portugal
5 shared publications
Latest Publications
- 18 August 2026
- Published by Springer Nature
- p. 41-58
RedShell: A Generative AI-Based Approach to Ethical Hacking
- 18 August 2026
- Published by Springer Nature
- p. 41-58
RedShell: A Generative AI-Based Approach to Ethical Hacking
- Open Access
- 22 February 2024
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 26 (2) , 169-188
Monitoring of spatio-temporal properties with nonlinear SAT solvers
The automotive industry is increasingly dependent on computing systems with different critical requirements. The verification and validation methods for these systems are now leveraging complex AI methods, for which the decision algorithms introduce non-determinism, especially in autonomous driving. This paper presents a runtime verification technique agnostic to the target system, which focuses on monitoring spatio-temporal properties that abstract the evolution of objects’ behavior in their spatial and temporal flow. First, a formalization of three known traffic rules (from the Vienna convention on road traffic) is presented, where a spatio-temporal logic fragment is used. Then, these logical expressions are translated to a monitoring model written in first-order logic, where they are processed by a non-linear satisfiability solver. Finally, the translation allows the solver to check the validity of the encoded properties according to an instance of a specific traffic scenario (a trace). The results obtained from our tool, which automatically generates a monitor from a formula, show that our approach is feasible for online monitoring in a real-world environment.
- 22 February 2024
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 26 (2) , 169-188
Open AccessMonitoring of spatio-temporal properties with nonlinear SAT solvers
The automotive industry is increasingly dependent on computing systems with different critical requirements. The verification and validation methods for these systems are now leveraging complex AI methods, for which the decision algorithms introduce non-determinism, especially in autonomous driving. This paper presents a runtime verification technique agnostic to the target system, which focuses on monitoring spatio-temporal properties that abstract the evolution of objects’ behavior in their spatial and temporal flow. First, a formalization of three known traffic rules (from the Vienna convention on road traffic) is presented, where a spatio-temporal logic fragment is used. Then, these logical expressions are translated to a monitoring model written in first-order logic, where they are processed by a non-linear satisfiability solver. Finally, the translation allows the solver to check the validity of the encoded properties according to an instance of a specific traffic scenario (a trace). The results obtained from our tool, which automatically generates a monitor from a formula, show that our approach is feasible for online monitoring in a real-world environment.
- Open Access
Singularities of local models
We construct local models of Shimura varieties and investigate their singularities, with special emphasis on wildly ramified cases. More precisely, with the exception of odd unitary groups in residue characteristic $2$ we construct local models, show reducedness of their special fiber, Cohen$-$Macaulayness and in equi-characteristic also (pseudo-)rationality. In mixed characteristic we conjecture their (pseudo-)rationality. This is based on the construction of parahoric group schemes over two-dimensional bases for wildly ramified groups and an analysis of singularities of the attached Schubert varieties in positive characteristic using perfect geometry.Open AccessSingularities of local models
We construct local models of Shimura varieties and investigate their singularities, with special emphasis on wildly ramified cases. More precisely, with the exception of odd unitary groups in residue characteristic $2$ we construct local models, show reducedness of their special fiber, Cohen$-$Macaulayness and in equi-characteristic also (pseudo-)rationality. In mixed characteristic we conjecture their (pseudo-)rationality. This is based on the construction of parahoric group schemes over two-dimensional bases for wildly ramified groups and an analysis of singularities of the attached Schubert varieties in positive characteristic using perfect geometry. - Open Access
- 1 May 2021
- Published by Elsevier in Future Generation Computer Systems
- Vol. 118, 14-36
It’s about Thyme: On the design and implementation of a time-aware reactive storage system for pervasive edge computing environments
- 1 May 2021
- Published by Elsevier in Future Generation Computer Systems
- Vol. 118, 14-36
Open AccessIt’s about Thyme: On the design and implementation of a time-aware reactive storage system for pervasive edge computing environments
- 15 November 2019
- Published by Springer Nature in Formal Methods in System Design
- Vol. 55 (1) , 72
Correction to: A survey of challenges for runtime verification from advanced application domains (beyond software)
- 15 November 2019
- Published by Springer Nature in Formal Methods in System Design
- Vol. 55 (1) , 72
Correction to: A survey of challenges for runtime verification from advanced application domains (beyond software)
- Open Access
- 11 November 2019
- Published by Springer Nature in Formal Methods in System Design
- Vol. 54 (3) , 279-335
A survey of challenges for runtime verification from advanced application domains (beyond software)
Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.
- 11 November 2019
- Published by Springer Nature in Formal Methods in System Design
- Vol. 54 (3) , 279-335
Open AccessA survey of challenges for runtime verification from advanced application domains (beyond software)
Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.
- 30 October 2018
- Published by Springer Nature
- p. 70-73
Verifying Real-World Software with Contracts for Concurrency
- 30 October 2018
- Published by Springer Nature
- p. 70-73
Verifying Real-World Software with Contracts for Concurrency
- Open Access
- 1 January 2018
- Published by Association for Computing Machinery (ACM)
GOCRGO and GOGO: Two minimal Communication Topologies for WiFi-Direct Multi-group Networking
- 1 January 2018
- Published by Association for Computing Machinery (ACM)
Open AccessGOCRGO and GOGO: Two minimal Communication Topologies for WiFi-Direct Multi-group Networking
- Open Access
Time-Aware Publish/Subscribe for Networks of Mobile Devices
Smart mobile devices are increasingly ubiquitous and are the primary source of user-generated content, and current communication infrastructures are failing in keeping up with the rising demand for the avid sharing of such content. To alleviate this problem and fully harness the amount of resources currently available at the network edge, mobile edge paradigms started to emerge. Though, application developers still struggle to tap that potential at the edge due to the lack of adequate communication and interaction abstractions. Thus, we propose a high-level abstraction that can be easily exploited by developers to design mobile edge applications focused on data dissemination. In this paper, we propose Thyme, a novel extended topic-based, time-aware publish/subscribe system for networks of mobile devices. In Thyme, time is a rst order dimension. Each subscription has an associated time frame, starting and ending either in the future, present, or past. Making the past available requires both subscriptions and publications to be persistently stored. We present the design of Thyme and evaluate it using simulation, discussing and characterizing the scenarios best suited for its use.
Open AccessTime-Aware Publish/Subscribe for Networks of Mobile Devices
Smart mobile devices are increasingly ubiquitous and are the primary source of user-generated content, and current communication infrastructures are failing in keeping up with the rising demand for the avid sharing of such content. To alleviate this problem and fully harness the amount of resources currently available at the network edge, mobile edge paradigms started to emerge. Though, application developers still struggle to tap that potential at the edge due to the lack of adequate communication and interaction abstractions. Thus, we propose a high-level abstraction that can be easily exploited by developers to design mobile edge applications focused on data dissemination. In this paper, we propose Thyme, a novel extended topic-based, time-aware publish/subscribe system for networks of mobile devices. In Thyme, time is a rst order dimension. Each subscription has an associated time frame, starting and ending either in the future, present, or past. Making the past available requires both subscriptions and publications to be persistently stored. We present the design of Thyme and evaluate it using simulation, discussing and characterizing the scenarios best suited for its use.