Francisco Sant'ANna
Research Subjects
Francisco Sant'ANna has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Adriano Branco
Department of Informatics, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro, RJ, Brazil
1 shared publication - Edward Hermann Haeusler
PUC-Rio
1 shared publication - Fabio Bosisio
Uerj
1 shared publication - Guilherme F. Lima
PUC-Rio, Brazil
1 shared publication - Lucas Pires
Uerj
1 shared publication Luiz Fernando Gomes Soares
PUC-Rio, Rio de Janeiro -- Brasil
1 shared publication
Latest Publications
- 2 April 2026
- Published by Elsevier in Journal of Computer Languages
- Vol. 87
Editorial - Celebrating 30 years of the Lua programming language
- 2 April 2026
- Published by Elsevier in Journal of Computer Languages
- Vol. 87
Editorial - Celebrating 30 years of the Lua programming language
- Open Access
- 19 March 2025
- Published by Universidade Federal do Rio Grande do Sul in Revista de Informática Teórica e Aplicada
- Vol. 32 (2) , 11-21
Symmetric Peer-to-Peer Applications
In real-time networked applications, such as shared documents, users can interact remotely and yet share the exact same experience as if they were in a single machine. In this work, we propose a middleware for symmetric peer-to-peer applications in which decentralized instances can trigger asynchronous events and yet conform to identical behavior. Peers are allowed to join and leave the network at any time. Application developers must adhere to a restricted API, which is deterministic, stateless, and only supports pre-allocated memory. The middleware is responsible for synchronizing the events in a global shared timeline across the network. Also, based on memory snapshots and deterministic simulation, a "time machine" can rollback conflicting peers to resynchronize their state. We show that the middleware can handle applications with over 20 peers in a heterogeneous topology under high churn. For instance, in a simulation scenario of 25 events per minute with a network latency of 50ms, the peers need to roll back and resynchronize only 3% of the time.
- 19 March 2025
- Published by Universidade Federal do Rio Grande do Sul in Revista de Informática Teórica e Aplicada
- Vol. 32 (2) , 11-21
Open AccessSymmetric Peer-to-Peer Applications
In real-time networked applications, such as shared documents, users can interact remotely and yet share the exact same experience as if they were in a single machine. In this work, we propose a middleware for symmetric peer-to-peer applications in which decentralized instances can trigger asynchronous events and yet conform to identical behavior. Peers are allowed to join and leave the network at any time. Application developers must adhere to a restricted API, which is deterministic, stateless, and only supports pre-allocated memory. The middleware is responsible for synchronizing the events in a global shared timeline across the network. Also, based on memory snapshots and deterministic simulation, a "time machine" can rollback conflicting peers to resynchronize their state. We show that the middleware can handle applications with over 20 peers in a heterogeneous topology under high churn. For instance, in a simulation scenario of 25 events per minute with a network latency of 50ms, the peers need to roll back and resynchronize only 3% of the time.
- Open Access
- 18 September 2023
- Published by Sociedade Brasileira de Computação
- p. 470-483
Peer-to-Peer Permissionless Consensus via Reputation
Public Internet forums suffer from excess and abuse, such as SPAM and fake news. Centralized platforms employ filtering and anti-abuse policies, but imply full trust from users. We propose a permissionless Sybil-resistant peer-to-peer protocol for content sharing. Our main contribution is a reputation system that moderates content and, at the same time, delivers network consensus. We can trace a parallel with Bitcoin as follows: consolidated posts create reputation (vs proof-of-work), likes and dislikes transfer reputation (vs transactions), and aggregate reputation determines consensus (vs longest chain). The reputation mechanism depends exclusively on the human authoring ability (proof-of-authoring), which is slow and scarce, thus suitable to establish consensus.
- 18 September 2023
- Published by Sociedade Brasileira de Computação
- p. 470-483
Open AccessPeer-to-Peer Permissionless Consensus via Reputation
Public Internet forums suffer from excess and abuse, such as SPAM and fake news. Centralized platforms employ filtering and anti-abuse policies, but imply full trust from users. We propose a permissionless Sybil-resistant peer-to-peer protocol for content sharing. Our main contribution is a reputation system that moderates content and, at the same time, delivers network consensus. We can trace a parallel with Bitcoin as follows: consolidated posts create reputation (vs proof-of-work), likes and dislikes transfer reputation (vs transactions), and aggregate reputation determines consensus (vs longest chain). The reputation mechanism depends exclusively on the human authoring ability (proof-of-authoring), which is slow and scarce, thus suitable to establish consensus.
- Open Access
- 11 November 2022
- Published by Springer Nature in Research Square
Symmetric Peer-to-Peer Applications
In real-time networked applications, such as collaborative documents, users can interact remotelyand yet share the exact same experience as if they were using a single machine. In this work,we propose a middleware for symmetric peer-to-peer applications in which decentralized instancescan broadcast asynchronous events and yet conform to identical behavior. Peers are allowed tojoin and leave the network at any time. Application developers must adhere to a determinis-tic and stateless API. The middleware is responsible for synchronizing the events in a globalshared timeline across the network. Also, based on memory snapshots and deterministic simu-lation, a “time machine” can rollback conflicting peers to resynchronize their states. We showthat the middleware can handle applications with over 20 peers in a heterogeneous topologiesunder high churns. For instance, in a simulation scenario with a network latency of 50ms and 25 events per minute, the peers need to roll back and resynchronize only 3% of the time.
- 11 November 2022
- Published by Springer Nature in Research Square
Open AccessSymmetric Peer-to-Peer Applications
In real-time networked applications, such as collaborative documents, users can interact remotelyand yet share the exact same experience as if they were using a single machine. In this work,we propose a middleware for symmetric peer-to-peer applications in which decentralized instancescan broadcast asynchronous events and yet conform to identical behavior. Peers are allowed tojoin and leave the network at any time. Application developers must adhere to a determinis-tic and stateless API. The middleware is responsible for synchronizing the events in a globalshared timeline across the network. Also, based on memory snapshots and deterministic simu-lation, a “time machine” can rollback conflicting peers to resynchronize their states. We showthat the middleware can handle applications with over 20 peers in a heterogeneous topologiesunder high churns. For instance, in a simulation scenario with a network latency of 50ms and 25 events per minute, the peers need to roll back and resynchronize only 3% of the time.
- 1 February 2019
- Published by Elsevier in Journal of Systems Architecture
- Vol. 97, 239-257
A memory-bounded, deterministic and terminating semantics for the synchronous programming language Céu
- 1 February 2019
- Published by Elsevier in Journal of Systems Architecture
- Vol. 97, 239-257
A memory-bounded, deterministic and terminating semantics for the synchronous programming language Céu
- Open Access
- 13 July 2017
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 16 (4) , 1-26
The Design and Implementation of the Synchronous Language CÉU
C éU is a synchronous language targeting soft real-time systems. It is inspired by Esterel and has a simple semantics with fine-grain control over program execution. C éU uses an event-triggered notion of time that enables compile-time checks to detect conflicting concurrent statements, resulting in deterministic and concurrency-safe programs. We present the particularities of our design in comparison to Esterel, such as stack-based internal events, concurrency checks, safe integration with C, and first-class timers. We also present two implementation back ends: one aiming for resource efficiency and interoperability with C, and another as a virtual machine that allows remote reprogramming.
- 13 July 2017
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 16 (4) , 1-26
Open AccessThe Design and Implementation of the Synchronous Language CÉU
C éU is a synchronous language targeting soft real-time systems. It is inspired by Esterel and has a simple semantics with fine-grain control over program execution. C éU uses an event-triggered notion of time that enables compile-time checks to detect conflicting concurrent statements, resulting in deterministic and concurrency-safe programs. We present the particularities of our design in comparison to Esterel, such as stack-based internal events, concurrency checks, safe integration with C, and first-class timers. We also present two implementation back ends: one aiming for resource efficiency and interoperability with C, and another as a virtual machine that allows remote reprogramming.