Concept

Real closed field

Related publications (42)

Higman ideal, stable Hochschild homology and Auslander-Reiten conjecture

Let A and B be two finite dimensional algebras over an algebraically closed field, related to each other by a stable equivalence of Morita type. We prove that A and B have the same number of isomorphism classes of simple modules if and only if their 0-degr ...

Springer-Verlag2012

Software Synthesis Procedures

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Automated synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, software synthesis algorithms should behave in a predictable way: they should succ ...

2012

Centres of centralizers of unipotent elements in simple algebraic groups

Donna Testerman

Let G be a simple algebraic group defined over an algebraically closed field k whose characteristic is either 0 or a good prime for G, and let u is an element of G be unipotent. We study the centralizer C-G(u), especially its centre Z(C-G(u)). We calculate ...

2011

Modeling and Flatness of Rigid and Flexible Cable Suspended Underactuated Robots

Philippe Müllhaupt, Basile Graf

A modeling framework is proposed for the control of rigid and flexible cable-like systems such as cranes, together with a systematic algorithm for computing flat outputs of mechanical systems for which the flat output is a linear combi- nation of free coor ...

IEEE2010

Comfusy: A Tool for Complete Functional Synthesis

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the general-purpose programming language Scala with (non-reactive) functional synthesi ...

Springer2010

Modeling and Flatness of Rigid and Flexible Cable Suspended Underactuated Robots

Philippe Müllhaupt, Basile Graf

2010

On Deciding Functional Lists with Sublist Sets

Viktor Kuncak

Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...

2010

Building a Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets ...

Springer2010

On Combining Theories with Shared Set Operations

Viktor Kuncak, Ruzica Piskac

We explore the problem of automated reasoning about the non-disjoint combination of theories that share set variables and operations. We prove a combination theorem and apply it to show the decidability of the satisfiability problem for a class of formulas ...

2009

Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

Laura Ildiko Kovacs

We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate first-order invariants containing alternations of quantifiers. The method is based on ...

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

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.