Publication

Generation of object-oriented programs from CO-OPN specifications

Related publications (159)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Widget-Based Approach for Remote Control Labs

Denis Gillet, Christophe Salzmann, Evgeny Bogdanov

The paper presents a novel approach to conduct laboratory experiments in relation with the Control class taught at EPFL. The existing laboratory interface built as a Java applet, which allows students to access experimentation devices locally or remotely, ...

2012

Towards Complete Reasoning about Axiomatic Specifications

Viktor Kuncak, Swen Jacobs

To support verification of expressive properties of functional programs, we consider algebraic style specifications that may relate multiple user-defined functions, and compare multiple invocations of a function for different arguments. We present decision ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Models capturing latent constructs

Michel Bierlaire, Aurélie Glerum

In the context of the development of hybrid choice models (HCM), we are interested in understanding better how to design models which can account for the latent information contained in new data types (psychometrics, data from smartphones, etc.) for which ...

2011

Communix: A Framework for Collaborative Deadlock Immunity

George Candea, Pinar Tözün, Horatiu Jula

We present Communix, a collaborative deadlock immunity framework for Java programs. Deadlock immunity enables applications to avoid deadlocks that they previously encountered. Dimmunix [1], our deadlock immunity system, detects deadlocks and saves their si ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Atomic boxes: coordinated exception handling with transactional memory

Vincent Gramoli, Pascal Felber

In concurrent programs raising an exception in one thread does not prevent others from operating on an inconsistent shared state. Instead, exceptions should ideally be handled in coordination by all the threads that are affected by their cause. In this pap ...

2011

iProve: A Scalable Approach to Consumer-Verifiable Software Guarantees

George Candea, Horatiu Jula, Silviu Andrica

Formally proving complex program properties is still considered impractical for systems with over a million lines of code (MLOC). We present iProve, an approach that enables the generation and verification of proofs for interesting program properties in la ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (term a ...

2010

On Complete Reasoning about Axiomatic Specifications

Viktor Kuncak, Swen Jacobs

Automated software verification tools typically accept specifications of functions in terms of pre- and postconditions. However, many properties of functional programs can be more naturally specified using a more general form of universally quantified prop ...

2010

Reﬂexes: Abstractions for Integrating Highly Responsive Tasks into Java Applications

Rachid Guerraoui, Jesper Honig Spring

Achieving submillisecond response times in a managed language environment such as Java or C# requires overcoming signiﬁcant challenges. In this article, we propose Reﬂexes, a programming model and runtime system infrastructure that lets developers seamless ...

2010

Shape Refinement through Explicit Heap Analysis

Dirk Thilo Beyer, Grégory Théoduloz, Damien Zufferey

Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structu ...

Springer2010