Carla Ferreira

Carla Ferreira

Auto-generated profile, based on publicly available information

Carla Ferreira

NOVA University Lisbon, Lisbon, Portugal

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 January 2016
Verified
Conference Paper
Open access
AGAlexey Gotsman
Alexey Gotsman
HYHongseok Yang
Hongseok Yang
CFCarla Ferreira
Carla Ferreira
MNMahsa Najafzadeh
Mahsa Najafzadeh
MSMarc Shapiro
Marc Shapiro
International audienceLarge-scale distributed systems often rely on replicated databases that allow a programmer to request different data consistency guarantees for different operations, and thereby control their performance. Using such databases is far from trivial: requesting stronger consistency in too many places may hurt performance, and requesting it in too few places may violate correctness. To help programmers in this task, we propose the first proof rule for establishing that a particular choice of consistency guarantees for various operations on a replicated database is enough to ensure the preservation of a given data integrity invariant. Our rule is modular: it allows reasoning about the behaviour of every operation separately under some assumption on the behaviour of other operations. This leads to simple reasoning, which we have automated in an SMT-based tool. We present a nontrivial proof of soundness of our rule and illustrate its use on several examples

17 April 2015
Verified
Conference Paper
Open access
PDF file
VBValter Balegas
Valter Balegas
SDSérgio Duarte
Sérgio Duarte
CFCarla Ferreira
Carla Ferreira
RRRodrigo Rodrigues
Rodrigo Rodrigues
NPNuno Preguiça
Nuno Preguiça
MSMarc Shapiro
Marc Shapiro
International audienceGeo-replicated storage systems are at the core of current Internet services. The designers of the replication protocols used by these systems must choose between either supporting low-latency, eventually-consistent operations, or ensuring strong consistency to ease application correctness. We propose an alternative consistency model, Explicit Consistency, that strengthens eventual consistency with a guarantee to preserve specific invariants defined by the applications. Given these application-specific invariants, a system that supports Explicit Consistency identifies which operations would be unsafe under concurrent execution, and allows programmers to select either violation-avoidance or invariant-repair techniques. We show how to achieve the former, while allowing operations to complete locally in the common case, by relying on a reservation system that moves coordination off the critical path of operation execution. The latter, in turn, allows operations to execute without restriction, and restore invariants by applying a repair operation to the database state. We present the design and evaluation of Indigo, a middleware that provides Explicit Consistency on top of a causally-consistent data store. Indigo guarantees strong application invariants while providing similar latency to an eventually-consistent system in the common case

1 January 2005
Verified
Book Chapter
Closed access
PDF file
MBMichael Butler
Michael Butler
THTony Hoare
Tony Hoare
CFCarla Ferreira
Carla Ferreira


1 January 2005
Verified
Book Chapter
Closed access
PDF file
RBRoberto Bruni
Roberto Bruni
MBMichael Butler
Michael Butler
CFCarla Ferreira
Carla Ferreira
THTony Hoare
Tony Hoare
HMHernán Melgratti
Hernán Melgratti
UMUgo Montanari
Ugo Montanari

1 January 2002 in IBM Systems Journal
Verified
Journal Article
Closed access
MCM. Chessell
M. Chessell
CGC. Griffin
C. Griffin
DVD. Vines
D. Vines
MBM. Butler
M. Butler
CFC. Ferreira
C. Ferreira
PHP. Henderson
P. Henderson
The ability to compensate for previous activities, often in the case of failure or exceptional events, is an important feature of long-running business transactions. In this paper, we present several extensions to existing notions of compensation for business transactions. The extensions are described using a business process modeling language called StAC (Structured Activity Compensation) but are also placed in the context of IBM's BPBeans (Business Process Beans) enterprise technology. The meaning of the compensation mechanisms is made precise, as are issues of compensation scoping in multilevel transactions. The compensation extensions result in flexible and powerful mechanisms for modeling and implementing long-running business transactions.