Publication

An Equational Theory for Transactions

Publications associées (38)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Validation of Visual Contracts for Services

Alain Wegmann, Lam Son Lê, José Diego de la Cruz Garcia

Visual modeling languages have specialized diagrams to represent behavior and concepts. This diagram specialization has drawbacks like the dif-ficulty to represent the effects of actions. We claim that visual contracts can de-scribe actions in a more compl ...

2006

Action Semantics in Smart Objects

Daniel Thalmann, Tolga Abaci, Jan Ciger

We present a method of formal description of the action semantics in smart objects. Smart objects were primarily used for behavioral animation in the past. We demonstrate, how a formally described semantics can be used for action planning purposes by intel ...

2005

A Formal Semantics For Protocol Narrations

Sébastien Briais

Protocol narrations are an informal means to describe, in an idealistic manner, the functioning of cryptographic protocols as a single intended sequence of cryptographic message exchanges among the protocol's participants. Protocol narrations have also bee ...

2005

Isolation-only Transactions by Typing and Versioning

In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks) that are intended for time-critical systems. The key concept of our design is the use of a type system to support rollback-free and safe ru ...

2004

Concurrency Combinators for Declarative Synchronization

Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronization is required. A synchronization logic, or policy, is at present entangled i ...

Springer2004

An Equational Theory for Transactions

Rachid Guerraoui, Martin Odersky, Vincent Cremet

Transactions are commonly described as being ACID: All-or-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID properties have never been given a precise semantics in a way that disentangles each pr ...

2003

The Role of Tarski’s Declarative Semantics in the Design of Modeling Languages

Alain Wegmann, Andrey Naumenko

This paper focuses on Tarski

s declarative semantics and their usefulness in the design of a modeling language. We introduce the principles behind Tarski

s approach to semantics and explain what advantages this offers in the context of modeling languages. ...

2003

Operational ASM Semantics behind Graphical SEAM Notation

Alain Wegmann, Irina Rychkova, Pavel Balabko

The context of this paper is Enterprise Architecture (EA). EA is a multi-disciplinary approach that allows dierent specialists to design new business and IT systems and focuses on the integration of these systems. Our group develops a specic EA method that ...

2003

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of Unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003