Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by Luís Soares Barbosa

2007

Selected papers from SBLP 2007: The 11th Brazilian Symposium on Programming Languages J.UCS special issue

Authors
Bigonha, RS; Musicante, MA; Pardo, A; Garcia, A; Martini, A; Moreira, AF; De Melo, ACV; Du Bois, AR; Santos, A; Camarao, C; Rubira, C; Braga, C; Naumann, D; Haeusler, EH; De Carvalho Junior, FH; Cafezeiro, I; Palsberg, J; Jeuring, J; Saraiva, J; Guimaraes, J; Labra, J; Fiadeiro, JL; Figueiredo, L; Barbosa, LS; Menezes, LC; Maia, M; De Valente, MTO; Bigonha, MAS; Benton, N; Rodriguez, N; Borba, P; Mosses, PD; Lins, RD; Cerqueira, R; Lima, RM; Ierusalimschy, R; Rigo, S; De Schneider, SM; Soares, S; Dascalu, S; Thompson, S; Vene, V; Costa, V; Iorio, VD;

Publication
JOURNAL OF UNIVERSAL COMPUTER SCIENCE

Abstract

2012

Analysing Tactics in Architectural Patterns

Authors
Sanchez, A; Aguiar, A; Barbosa, LS; Riesco, D;

Publication
PROCEEDINGS OF THE 2012 IEEE 35TH SOFTWARE ENGINEERING WORKSHOP (SEW 2012)

Abstract
This paper presents an approach to analyse the application of tactics in architectural patterns. We define and illustrate the approach using ARCHERY, a language for specifying, analysing and verifying architectural patterns. The approach consists of characterising the design principles of an architectural pattern as constraints, expressed in the language, and then, establishing a refinement relation based on their satisfaction. The application of tactics preserving refinement ensures that the original design principles, expressed themselves as constraints, still hold in the resulting architectural pattern. The paper focuses on fault-tolerance tactics, and identifies a set of requirements for a semantic framework characterising them. The application of tactics represented as model transformations is then discussed and illustrated using two case studies.

2023

Weighted synchronous automata

Authors
Gomes, L; Madeira, A; Barbosa, LS;

Publication
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE

Abstract
This paper introduces a class of automata and associated languages, suitable to model a computational paradigm of fuzzy systems, in which both vagueness and simultaneity are taken as first-class citizens. This requires a weighted semantics for transitions and a precise notion of a synchronous product to enforce the simultaneous occurrence of actions. The usual relationships between automata and languages are revisited in this setting, including a specific Kleene theorem.

2021

Quantum Bayesian Decision-Making

Authors
de Oliveira, M; Barbosa, LS;

Publication
FOUNDATIONS OF SCIENCE

Abstract
As a compact representation of joint probability distributions over a dependence graph of random variables, and a tool for modelling and reasoning in the presence of uncertainty, Bayesian networks are of great importance for artificial intelligence to combine domain knowledge, capture causal relationships, or learn from incomplete datasets. Known as a NP-hard problem in a classical setting, Bayesian inference pops up as a class of algorithms worth to explore in a quantum framework. This paper explores such a research direction and improves on previous proposals by a judicious use of the utility function in an entangled configuration. It proposes a completely quantum mechanical decision-making process with a proven computational advantage. A prototype implementation in Qiskit (a Python-based program development kit for the IBM Q machine) is discussed as a proof-of-concept.

2022

Variational Quantum Policy Gradients with an Application to Quantum Control

Authors
Sequeira, A; Santos, LP; Barbosa, LS;

Publication
CoRR

Abstract

2020

Quantum Bayesian decision-making

Authors
Oliveira, Md; Barbosa, LS;

Publication
CoRR

Abstract

  • 29
  • 31