Bruno Lopes
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
Bruno Lopes has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
Edward Hermann Haeusler
Pontifícia Universidade Católica do Rio de Janeiro, Brazil
5 shared publications- Mario Roberto Folhadela Benevides
Universidade Federal do Rio de Janeiro
4 shared publications - Daniel de Oliveira
Universidade Federal Fluminense (UFF)
3 shared publications - Edward Hermann Haeusler
PUC-Rio
3 shared publications Erick Grilo
2 shared publications- Luiz Gustavo Dias
Institute of Computing, Universidade Federal Fluminense, Niterói, Brazil
2 shared publications
Latest Publications
- 17 December 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- p. 1-36
A NEW DECISION METHOD FOR INTUITIONISTIC LOGIC BY 3-VALUED NON-DETERMINISTIC TRUTH-TABLES
Kurt Gödel proved that it is not possible to characterize intuitionistic propositional logic ( ${IPL}$ ) by means of finite and deterministic truth-tables. After extending the same result with respect to non-deterministic matrices (Nmatrices), we provide a semantical characterization of ${IPL}$ by means of a $3$ -valued Nmatrix with a restricted set of valuations. This structure allows to define an algorithm to delete unsound rows from the non-deterministic truth-tables generated for each formula, which constitutes a new and very simple decision procedure for ${IPL}$ . This method can be seen as truth-tables in a broader sense, and a way to overcome Gödel’s limiting result.- 17 December 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- p. 1-36
A NEW DECISION METHOD FOR INTUITIONISTIC LOGIC BY 3-VALUED NON-DETERMINISTIC TRUTH-TABLES
Kurt Gödel proved that it is not possible to characterize intuitionistic propositional logic ( ${IPL}$ ) by means of finite and deterministic truth-tables. After extending the same result with respect to non-deterministic matrices (Nmatrices), we provide a semantical characterization of ${IPL}$ by means of a $3$ -valued Nmatrix with a restricted set of valuations. This structure allows to define an algorithm to delete unsound rows from the non-deterministic truth-tables generated for each formula, which constitutes a new and very simple decision procedure for ${IPL}$ . This method can be seen as truth-tables in a broader sense, and a way to overcome Gödel’s limiting result.- 28 February 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (4-5)
Two‐Step Estimation Strategy for Predicting Petroleum Reservoir Simulation Jobs Runtime on an HPC Cluster
Modeling petroleum field behavior provides crucial knowledge for risk quantification regarding extraction prospects. Since their processing requires significant computational and storage capabilities, oil companies run reservoir simulation jobs on high‐performance computing clusters managed by job managers, for example, Slurm. In this scenario, efficiently using machine learning algorithms to predict the runtime of incoming jobs can improve the effectiveness of cluster resources, such as enhancing the resource usage rate and reducing the jobs queue time. This work analyses diverse machine learning‐based predictors built from a real‐world Slurm jobs log from Petrobras, a globally renowned Brazilian energy company. Furthermore, a two‐step estimation strategy that predicts the duration time interval of reservoir simulation jobs is proposed and assessed, indicating that such estimated runtimes, when employed by job managers in their scheduling decisions, can positively impact the throughput of a real‐world batch system.
- 28 February 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (4-5)
Two‐Step Estimation Strategy for Predicting Petroleum Reservoir Simulation Jobs Runtime on an HPC Cluster
Modeling petroleum field behavior provides crucial knowledge for risk quantification regarding extraction prospects. Since their processing requires significant computational and storage capabilities, oil companies run reservoir simulation jobs on high‐performance computing clusters managed by job managers, for example, Slurm. In this scenario, efficiently using machine learning algorithms to predict the runtime of incoming jobs can improve the effectiveness of cluster resources, such as enhancing the resource usage rate and reducing the jobs queue time. This work analyses diverse machine learning‐based predictors built from a real‐world Slurm jobs log from Petrobras, a globally renowned Brazilian energy company. Furthermore, a two‐step estimation strategy that predicts the duration time interval of reservoir simulation jobs is proposed and assessed, indicating that such estimated runtimes, when employed by job managers in their scheduling decisions, can positively impact the throughput of a real‐world batch system.
- Open Access
- 30 December 2024
- Published by Fundacao Getulio Vargas in Revista de Gestão dos Países de Língua Portuguesa
- Vol. 23 (2) , 57-75
Um estudo da relação entre ISO 9001 e inovação
Este estudo tem como objetivo determinar o impacto da implementação de um Sistema de Gestão da Qualidade (SGQ) na inovação. Para isso, investiga-se a relação entre a certificação ISO 9001 e a capacidade inovativa em empresas de diversos setores, com base na experiência de gestores que atuaram em áreas diversas dessas organizações. Na pesquisa, utilizou-se o levantamento como estratégia de investigação, obtendo-se respostas de 123 profissionais que desempenharam funções de gestão em organizações. Para a análise dos resultados foi empregada a técnica de Modelagem de Equações Estruturais (SEM). O estudo conseguiu demonstrar que uma certificação ISO 9001 influencia positivamente na inovação de produto – tanto radical quanto incremental – e na inovação radical de processo.
- 30 December 2024
- Published by Fundacao Getulio Vargas in Revista de Gestão dos Países de Língua Portuguesa
- Vol. 23 (2) , 57-75
Open AccessUm estudo da relação entre ISO 9001 e inovação
Este estudo tem como objetivo determinar o impacto da implementação de um Sistema de Gestão da Qualidade (SGQ) na inovação. Para isso, investiga-se a relação entre a certificação ISO 9001 e a capacidade inovativa em empresas de diversos setores, com base na experiência de gestores que atuaram em áreas diversas dessas organizações. Na pesquisa, utilizou-se o levantamento como estratégia de investigação, obtendo-se respostas de 123 profissionais que desempenharam funções de gestão em organizações. Para a análise dos resultados foi empregada a técnica de Modelagem de Equações Estruturais (SEM). O estudo conseguiu demonstrar que uma certificação ISO 9001 influencia positivamente na inovação de produto – tanto radical quanto incremental – e na inovação radical de processo.
- 10 June 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (10) , 5959-6000
MAESTRO: a lightweight ontology-based framework for composing and analyzing script-based scientific experiments
- 10 June 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (10) , 5959-6000
MAESTRO: a lightweight ontology-based framework for composing and analyzing script-based scientific experiments
- 21 May 2024
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 35 (5)
Towards determinism in PDL: relations and proof theory
Guarded Kleene Algebra with Tests (GKAT) was presented as a fragment of KAT to abstract imperative programming languages, where only if-then-else and while-do statements are allowed in the language. The loss of expressiveness is, nevertheless, compensated by a clear advantage over KAT: it allows almost linear decidability of program equivalence. In this work, we give the first step to optimizing the complexity of dynamic logic equivalence, which is EXPTIME-complete in propositional dynamic logic (PDL). First, and based on strict deterministic PDL, we present guarded propositional dynamic logic (GPDL), a fragment of PDL where programs correspond to GKAT terms. It comes embedded, as expected, with a semantics over relational models and a sound axiomatisation. Then, we present a Natural Deduction system for GPDL, proving its soundness and completeness, concerning the axiomatisation. Based on Smolka et al. (2019, Proceedings of the ACM Programming Language 4), we obtain the main result of this work—the equivalence of GPDL programs can be established in almost linear time.
- 21 May 2024
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 35 (5)
Towards determinism in PDL: relations and proof theory
Guarded Kleene Algebra with Tests (GKAT) was presented as a fragment of KAT to abstract imperative programming languages, where only if-then-else and while-do statements are allowed in the language. The loss of expressiveness is, nevertheless, compensated by a clear advantage over KAT: it allows almost linear decidability of program equivalence. In this work, we give the first step to optimizing the complexity of dynamic logic equivalence, which is EXPTIME-complete in propositional dynamic logic (PDL). First, and based on strict deterministic PDL, we present guarded propositional dynamic logic (GPDL), a fragment of PDL where programs correspond to GKAT terms. It comes embedded, as expected, with a semantics over relational models and a sound axiomatisation. Then, we present a Natural Deduction system for GPDL, proving its soundness and completeness, concerning the axiomatisation. Based on Smolka et al. (2019, Proceedings of the ACM Programming Language 4), we obtain the main result of this work—the equivalence of GPDL programs can be established in almost linear time.
- 16 February 2024
- Published by Springer Nature in Studia Logica
- Vol. 113 (2) , 539-566
Ecumenical Propositional Tableau
- 16 February 2024
- Published by Springer Nature in Studia Logica
- Vol. 113 (2) , 539-566
Ecumenical Propositional Tableau
- 9 December 2023
- Published by Springer Nature
- p. 43-55
Twin-Treewidth: A Single-Exponential Logic-Based Approach
- 9 December 2023
- Published by Springer Nature
- p. 43-55
Twin-Treewidth: A Single-Exponential Logic-Based Approach
- Open Access
- 23 March 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 376, 16-33
ReLo: a Dynamic Logic to Reason About Reo Circuits
Critical systems require high reliability and are present in many domains. They are systems in which failure may result in financial damage or even loss of lives. Standard techniques of software engineering are not enough to ensure the absence of unacceptable failures and/or that critical requirements are fulfilled. Reo is a component-based modelling language that aims to provide a framework to build software based on existing pieces of software, which has been used in a wide variety of domains. Its formal semantics provides grounds to certify that systems based on Reo models satisfy specific requirements (i.e., absence of deadlocks). Current logical approaches for reasoning over Reo require the conversion of formal semantics into a logical framework. ReLo is a dynamic logic that naturally subsumes Reo's semantics. It provides a means to reason over Reo circuits. This work extends ReLo by introducing the iteration operator, and soundness and completeness proofs for its axiomatization.
- 23 March 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 376, 16-33
Open AccessReLo: a Dynamic Logic to Reason About Reo Circuits
Critical systems require high reliability and are present in many domains. They are systems in which failure may result in financial damage or even loss of lives. Standard techniques of software engineering are not enough to ensure the absence of unacceptable failures and/or that critical requirements are fulfilled. Reo is a component-based modelling language that aims to provide a framework to build software based on existing pieces of software, which has been used in a wide variety of domains. Its formal semantics provides grounds to certify that systems based on Reo models satisfy specific requirements (i.e., absence of deadlocks). Current logical approaches for reasoning over Reo require the conversion of formal semantics into a logical framework. ReLo is a dynamic logic that naturally subsumes Reo's semantics. It provides a means to reason over Reo circuits. This work extends ReLo by introducing the iteration operator, and soundness and completeness proofs for its axiomatization.
- 15 January 2022
- Published by O Que Nos Faz Pensar in O que nos faz pensar
- Vol. 29 (49) , 157
Interpreting Reo Circuits as PDL models
Reo is a coordination-based language with the proposal of connecting different systems and interfaces. It aims to develop communication between different systems with a high level of abstraction and without many restrictions. PDL is a multimodal logic tailored to reason about programs. It is proved to be sound, complete, decidable and has a simple Kripke semantics. This work intends to provide an interpretation of Reo circuits as PDL models. These are the first steps towards providing a dynamic logic tailored to reason directly about Reo circuits.
- 15 January 2022
- Published by O Que Nos Faz Pensar in O que nos faz pensar
- Vol. 29 (49) , 157
Interpreting Reo Circuits as PDL models
Reo is a coordination-based language with the proposal of connecting different systems and interfaces. It aims to develop communication between different systems with a high level of abstraction and without many restrictions. PDL is a multimodal logic tailored to reason about programs. It is proved to be sound, complete, decidable and has a simple Kripke semantics. This work intends to provide an interpretation of Reo circuits as PDL models. These are the first steps towards providing a dynamic logic tailored to reason directly about Reo circuits.
- 18 July 2021
- Published by Sociedade Brasileira de Computação
- p. 1-8
Automatic program verification in Dynamic Logic with applications to smart contracts
In critical systems, failures or errors can cause catastrophes, such as deaths or considerably losses of money. Model checking provides an automated way to prove the correctness of programs' requirements. It is a convenient technique to use in systems that need reliability. Propositional Dynamic Logic (PDL) is a formal system designed to reason about programs. This work presents a compiler implementation from a subset of the C language and also for the Smacco model, both to the PDL language, and after that to the language of the nuXmv model checker. This implementation is linked with a Blockchain model generation system to model and reason about smart contracts.
- 18 July 2021
- Published by Sociedade Brasileira de Computação
- p. 1-8
Automatic program verification in Dynamic Logic with applications to smart contracts
In critical systems, failures or errors can cause catastrophes, such as deaths or considerably losses of money. Model checking provides an automated way to prove the correctness of programs' requirements. It is a convenient technique to use in systems that need reliability. Propositional Dynamic Logic (PDL) is a formal system designed to reason about programs. This work presents a compiler implementation from a subset of the C language and also for the Smacco model, both to the PDL language, and after that to the language of the nuXmv model checker. This implementation is linked with a Blockchain model generation system to model and reason about smart contracts.