Concept

Système F

Publications associées (43)

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

Sirtuin polymorphisms and methods of use thereof

Johan Auwerx

Provided herein are methods for diagnosis and prognosis using polymorphic variants of sirtuins. Such polymorphic may be used, for example, to identify subjects that would be responsive to treatment with a sirtuin modulating compound and/or subjects that ar ...

2008

Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis

Dirk Thilo Beyer, Grégory Théoduloz

In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concerned with precision, e.g., the removal of spurious counterexamples; for this p ...

Springer2007

Comparative transient analysis of critical and subcritical 80-MW Pb-Bi eutectic-cooled reactor systems

Rakesh Chawla, Konstantin Mikityuk

A consistent analytical comparison has been made of the transient behavior of critical and subcritical fast-spectrum reactor systems, the basic core design assumed in each case being that of the 80-MW(thermal) mixed-oxide-fueled, Pb-Bi-cooled, experimental ...

American Nucl. Soc.2007

Integrating Shape Analysis into the Model Checker BLAST

Dirk Thilo Beyer, Grégory Théoduloz

Many software model checkers are based on predicate abstraction. Values of variables in branching conditions are represented abstractly using predicates. The strength of this approach is its path-sensitive nature. However, if the control flow depends heavi ...

2006

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

Lazy Shape Analysis

Dirk Thilo Beyer, Grégory Théoduloz

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

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

A Nominal Theory of Objects with Dependent Types

Martin Odersky, Vincent Cremet, Matthias Zenger

We design and study newObj, a calculus and dependent type system for objects and classes which can have types as members. Type members can be aliases, abstract types, or new types. The type system can model the essential concepts of Java's inner classes as ...

2002

A Functional View of Join

Martin Odersky, Matthias Zenger

Join calculus, usually presented as a process calculus, is suitable as a foundation of both sequential and concurrent programming. We give a new operational semantics of join calculus, expressed as a reduction system with a single reduction rule similar to ...

1999