Concept

For loop

Related publications (58)

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.

Non-linear matter power spectrum from Time Renormalisation Group: efficient computation and comparison with one-loop

Julien Lesgourgues, Benjamin Audren

We address the issue of computing the non-linear matter power spectrum on mildly non-linear scales with efficient semi-analytic methods. We implemented M. Pietroni's Time Renormalization Group (TRG) method and its Dynamical 1-Loop (D1L) limit in a numerica ...

2011

Online loop closure for real-time interactive 3D scanning

We present a real-time interactive 3D scanning system that allows users to scan complete object geometry by turning the object around in front of a real-time 3D range scanner. The incoming 3D surface patches are registered and integrated into an online 3D ...

Elsevier2011

ABC: Algebraic Bound Computation for Loops

Régis William Blanc, Laura Ildiko Kovacs, Thibaud Hottelier

We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations bet ...

Springer Berlin Heidelberg2010

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the program execute and thereby read the important dynamic configuration data, the ...

Springer2010

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

2010

Disaggregate path flow estimation in an iterated DTA microsimulation

Gunnar Flötteröd

This text describes the first application of a novel path flow and origin/destination (OD) matrix estimator for iterated dynamic traffic assignment (DTA) microsimulations. The presented approach, which operates on a trip-based demand representation, is der ...

2010

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

Atomistic simulations of nanometric dislocation loops in bcc tungsten

Robin Schäublin

Small dislocation loops formed from self-interstitial atoms (SIAs) are commonly found in irradiated metals. These defects signiﬁcantly inﬂuence the mechanical properties of the materials. Atomistic simulations are used to describe nanometric circular dislo ...

Elsevier2009

Invariant generation for P-solvable loops with assignments

Laura Ildiko Kovacs

We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and co ...

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

Optimizing Higher-Order Functions in Scala

Iulian Dragos

Scala relies on libraries as the default mechanism for language extension. While this provides an elegant solution for growing the language, the performance penalty incurred by call-by-name parameters, boxing and anonymous functions is high. We show that i ...

2008