Publication

Verifying and Synthesizing Software with Recursive Functions (Invited Contribution)

Related publications (36)

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.

New efficient synthesis of long chain di- and tri-aminopolyols

Sandrine Gerber, Gérald Coste

The asymmetric synthesis of long chain di- and tri-amino polyols is reported. The developed methodology is based on the functionalization of 3,3'-methylenebis{[6-(benzyloxy)methoxy]cyclohept-3-en-1-ol} derivatives that allows the selective introduction of ...

2006

Rigorous solution techniques for numerical constraint satisfaction problems

Xuan-Ha Vu

A constraint satisfaction problem (e.g., a system of equations and inequalities) consists of a finite set of constraints specifying which value combinations from given variable domains are admitted. It is called numerical if its variable domains are contin ...

EPFL2005

Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems

Xuan-Ha Vu

The pioneering paper by H. Schichl and A. Neumaier has founded the fundamentals of interval analysis on DAGs for global optimization, including a fundamental of constraint propagation. In this paper, we extend the constraint propagation technique for solvi ...

2004

Scalable intelligent electronic catalogs

Marc Torrens Arnal

The world today is full of information systems which make huge quantities of information available. This incredible amount of information is clearly overwhelming Internet endusers. As a consequence, intelligent tools to identify worthwhile information are ...

EPFL2003

Extensible Adaptation via Constraint Solving

Willy Zwaenepoel

Applications running on a mobile and wireless devices must be able to adapt gracefully to limited and fluctuating network resources. The variety of applications, platforms upon which they run, and desires of their users, require a variety of adaptation pol ...

2002

Type Inference with Constrained Types

Martin Odersky

In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X) framework in constrained logic programming. We show that the type system is sound with respect to a standard untyped composit ...

1999