Concept

Sémantique algébrique (informatique)

Publications associées (27)

Foundations of Implicit Function Types

Implicit parameters are used pervasively in Scala and are also present in a number of other programming and theorem proving languages. This paper describes a generalization of implicit parameters as they are currently found in Scala to implicit function types. We motivate the construct by a series of examples and provide formal foundations that closely follow the semantics implemented by the Scala compiler.

2017

Offer Semantics: Achieving Compositionality, Flattening and Full Expressiveness for the Glue Operators in BIP

Based on a concise but comprehensive overview of some fundamental properties required from component-based frameworks, namely compositionality, incrementality, flattening, modularity and expressiveness, we review three modifications of the semantics of glue operators in the Behaviour-Interaction-Priority (BIP) framework. We provide theoretical results and examples illustrating the degree, to which the three semantics meet these requirements. In particular, we show that the latest semantics, based on the off

2014

Architectures: Design patterns for component-based systems

Architectures depict design principles, paradigms that can be understood by all, allow thinking on a higher plane and avoiding low-level mistakes. They provide means for ensuring correctness by construction by enforcing global properties characterizing the coordination between components. An architecture can be considered as an operator A that, applied to a set of components B, builds a composite component A(B) meeting a characteristic property P. A theory of architectures must address several fundamental q

2014

Formalizing and verifying transactional memories

Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. TM shifts the burden of managing concurrency from the programmer to the TM algorithm. The correctness of TM algorithms is generally proved manually. The goal ...

EPFL2010

Isolation-only Transactions by Typing and Versioning

In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be encoded using the low-level synchronization constructs. The key concept of ou ...

2005

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 in the component code. Adding a new component or modifying existing components, which may require a change of the (global) synchronization policy, is therefore subjected to an extensive inspection of the complete code. We propose a calculus of concurrency c

Springer2004

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 runtime execution of tasks. We present a first-order type system which can verify information for the concurrency controller. We use an operational semantics to formalize and prove the type soundness result and an isolation property of tasks. The semantics u

2004

Operational ASM Semantics behind Graphical SEAM Notation

Alain Wegmann, 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 is called SEAM. The current version of SEAM has a formal denotational seman- tics for its modeling language. In order to provide model simulation and checking at each level of abstraction, SEAM needs an operational se- mantics. Currently this work is at t

2003

Unreliable Failure Detectors via Operational Semantics

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 as each being the weakest to solve some specific distributed programming problem. In this paper, we provide a fresh look at failure detectors from the point of view of programming languages, more precisely using the formal tool of operational semantics. In

2003

Unreliable Failure Detectors via Operational Semantics

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 as each being the weakest to solve some specific distributed programming problem. In this paper, we provide a fresh look at failure detectors from the point of view of programming languages, more precisely using the formal tool of operational semantics. In

2003

An Equational Theory for Transactions

Martin Odersky

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 property from the others. Among the benefits of such a semantics would be the ability to trade-off the value of a property against the cost of its implementation. This paper gives a sound equational semantics for the transaction properties. We define three c

2003

An Equational Theory for Transactions

Rachid Guerraoui, Martin Odersky

2003

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

Alain Wegmann

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. Using sentential logic we demonstrate the necessity and sufficiency of Tarski

s semantics for effectively addressing several issues that arise in the design of modeling languages. We explain what role Tarski

s semantics play in the organization of a modeli

2003

Stepwise refinement of formal specifications based on logical formulae : from CO-OPN/2 specifications to Java programs

Giovanna Di Marzo Serugendo

One of the steps making it possible to increase the quality and the reliability of the software executing on distributed systems consists of the use of methods of software engineering that are known as formal. The majority of the formal methods currently existing correspond in fact more to formal specifications languages than to methods themselves. This is due to the fact that the two fundamental aspects which are: the logic of use of the language and the coverage of the software life cycle are not, for the

EPFL1999

Formal Development and Validation of Java Dependable Distributed Systems

The rapid expansion of Java programs into software market is often not supported by a proper development methodology. Here, we present a formal development methodology well-suited for Java dependable distributed applications. It is based on the stepwise refinement of model-oriented formal spcifications, and enables validation of the obtained systme wrt the client's requirements. Three refinement steps have been identified in the case of fault-tolerant distributed applications: first, starting from informal

IEEE Computer Society Press1999

Programming with Variable Functions

Martin Odersky

What is a good method to specify and derive imperative programs? This paper argues that a new form of functional programming fits the bill, where variable functions can be updated at specified points in their domain. Traditional algebraic specification and functional programming are a powerful pair of tools for specifying and implementing domains of discourse and operations on them. Recent work on evolving algebras has introduced the function update in algebraic specifications, and has applied it with good

1998

Experiences in Coordination Programming

The term coordination is now unavoidable when speaking about software systems composed of many computing entities. More and more coordination models and languages are available, but they are used mainly in toy examples. This paper relates concrete experiences in the field of coordination programming, starting with formal object-oriented specifications and ending with Java programs. It shows that suitable coordination model and language are actually fruitful whn used since the design phase of software develo

IEEE Computer Society1998

Hierarchical Algebraic Nets

This paper presents a specifications formalism, Hierarchical Algebraic Nets (HAN), which allows the specification and design of heterogeneous concurrent distributed systems using hierarchical descriptions based on algebraic specifications and Petri nets. A simple example is firstly given in order to present the graphical representation associated to HAN, then the abstract syntax and formal semantics are described. The interesting aspects of HAN for reactive distributed systems development are listed and the

1997

Formal Development of Java Programs

The Java object-oriented programming language has been the subject of an important involvement from programmers and industry. Especially for applications related to the Web. The problem of such rapid penetration of Java programs into commercial product is that software engineers does not have any methodology and have to develop complex parallel applications. In this paper, we present, using a real (http://lglsun.epfl.ch/Team/GDM/DSGamma.html) but simple Web parallel application, a possible formal developmen

1997

Using the COOPN/2 Formal Method for Groupware Systems Engineering

COOPN/2 (Concurrent Object Oriented Petri Nets) is an object-oriented specification formalism based on Petri Nets and algebraic specifications. It is fully adapted to the specification of complex concurrent systems because it inherits the advantages of algebraic specifications for the specification of abstract data types, from Petri nets to describe partially ordered events and from the object-oriented paradigm for the 'structuring' of the specification. All these features are especially useful when speakin

1996

Graph Chat

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.

Publications associées (27)

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. Using sentential logic we demonstrate the necessity and sufficiency of Tarski

s semantics for effectively addressing several issues that arise in the design of modeling languages. We explain what role Tarski

s semantics play in the organization of a modeli

2003