Concept

Class-based programming

Publications associées (35)

Uniform Analysis for Communicating Timed Systems (Extended Technical Report)

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in an industrial and academic context. Model checking for timed automata has been studied extensively ...

2013

On the active site of mononuclear B1 metallo beta-lactamases: a computational study

Matteo Dal Peraro, Paolo Carloni

Metallo-beta-lactamases (M beta Ls) are Zn(II)-based bacterial enzymes that hydrolyze beta-lactam antibiotics, hampering their beneficial effects. In the most relevant subclass (B1), X-ray crystallography studies on the enzyme from point to either two zinc ...

2012

Recursive column generation for the Tactical Berth Allocation Problem

Michel Bierlaire, Matteo Salani, Ilaria Vacca

Seaport container terminals are source of many interesting large-scale optimization problems, that arise in the management of operations at several decision levels. In this work we study exact methods to solve the Tactical Berth Allocation Problem with Qua ...

2010

Efficient Distributed Subtyping Tests

Rachid Guerraoui, João Barreto, Patrick Eugster

Subtyping tests are essential in typed publish/subscribe infrastructures, especially when the underlying programming language supports subtype conformance, as in Java or C#. These tests are particularly challenging when the publish/subscribe infrastructure ...

2007

Object-oriented pattern matching

Burak Emir

Pattern matching is a programming language construct considered essential in functional programming. Its purpose is to inspect and decompose data. Instead, object-oriented programming languages do not have a dedicated construct for this purpose. A possible ...

EPFL2007

Progressive Coding of 3-D Objects Based on Overcomplete Decompositions

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

This paper presents a progressive coding scheme for 3-D objects, based on overcomplete signal expansions on the 2-D sphere. Due to increased freedom in the basis construction, redundant expansions have shown interesting approximation properties in the deco ...

2006

Metamodel-Aware Textual Concrete Syntax Specification

Frédéric Fondement

Metamodeling is raising more and more interest in the field of language engineering. While this approach is now well understood for the definition of abstract syntaxes, the formal definition of concrete syntaxes is still a challenge. Concrete syntaxes are ...

2006

Frugal Mobile Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices. The originality of the model lies in the integration of a strongly-typed event-based communication paradigm with abstractions for frugal control, assuming a small footprint runtime. ...

2005

Inner Classes and Virtual Types

Vincent Cremet, Philippe Altherr

This paper studies the interplay between inner classes and virtual types. The combination of these two concepts can be observed in object-oriented languages like Beta or Scala. This study is based on a calculus of classes and objects composed of a very lim ...

2005

Flexible subtyping relations for component-oriented formalisms and their verification

David Huerzeler

In this thesis we address the problem of safe substitutability in mobile component-oriented formalisms. We try to give a solution for different definitions of "safe" through a new notion of subtyping based on flexibility and observation. The aim is to have ...

EPFL2004

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