Publications related to Loop variant

Write Termination circuits for RRAM : A Holistic Approach From Technology to Application Considerations

David Atienza Alonso, Alexandre Sébastien Julien Levisse, Marco Antonio Rios

While Resistive Random Access Memories (RRAM) are perceived nowadays as a promising solution for the future of computing, these technologies suffer from intrinsic variability regarding programming voltage, switching speed and achieved resistance values. Wr ...

IEEE2020

An adaptive primal-dual framework for nonsmooth convex minimization

Volkan Cevher, Quoc Tran Dinh, Ahmet Alacaoglu

We propose a new self-adaptive and double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov’s smoothing technique via general Bregman distance functions. It self-adaptiv ...

2019

Switching event detection and self-termination programming circuit for energy efficient ReRAM memory arrays

Alexandre Sébastien Julien Levisse, Etienne Nowak

Energy efficiency remains a challenge for the design of non-volatile resistive memories (ReRAMs) arrays. This memory technology suffers from intrinsic variability in switching speed, programming voltages and resistance levels. The programming conditions of ...

2019

Algorithmic Resource Verification

Ravichandhran Kandhadai Madhavan

Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...

EPFL2017

Automating Verification of Functional Programs with Quantified Invariants

Viktor Kuncak, Nicolas Charles Yves Voirol

We present the foundations of a verifier for higher-order functional programs with generics and recursive algebraic data types. Our ver- ifier supports finding sound proofs and counterexamples even in the presence of certain quantified invariants and recur ...

2016

Satisfiability Modulo Recursive Programs

Viktor Kuncak, Philippe Paul Henri Suter, Ali Sinan Köksal

We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We impl ...

Springer-Verlag Berlin2011

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.

Loop variant

Write Termination circuits for RRAM : A Holistic Approach From Technology to Application Considerations

An adaptive primal-dual framework for nonsmooth convex minimization

Switching event detection and self-termination programming circuit for energy efficient ReRAM memory arrays

Algorithmic Resource Verification

Automating Verification of Functional Programs with Quantified Invariants

On an Efficient Decision Procedure for Imperative Tree Data Structures

Satisfiability Modulo Recursive Programs

Graph Chatbot

Chat with Graph Search

Switching event detection and self-termination programming circuit for energy efficient ReRAM memory arrays

Write Termination circuits for RRAM : A Holistic Approach From Technology to Application Considerations

Algorithmic Resource Verification

Satisfiability Modulo Recursive Programs

On an Efficient Decision Procedure for Imperative Tree Data Structures

An adaptive primal-dual framework for nonsmooth convex minimization

Automating Verification of Functional Programs with Quantified Invariants