Publications related to Foreach loop

Automated Formal Verification of Software Network Functions

Formally verifying the correctness of software is necessary to merit the trust people put in software systems. Currently, formal verification requires human effort to prove that a piece of code matches its specification and code changes to improve verifiab ...

EPFL2024

Tri-Axial Magnetic Field Sensor up to VHF with Frequency Weighing

German Augusto Ramirez Arroyave

This contribution presents an isotropic magnetic field probe with shaped frequency response in the band 100 kHz - 400 MHz to ponder the aggregate response according to the ICNIRP 2020 guidelines. The basic sensor is a printed loop which is modelled as a Th ...

IEEE2023

Locomotion of Sensor‐Integrated Soft Robotic Devices Inside Sub‐Millimeter Arteries with Impaired Flow Conditions

Diego Ghezzi, Mahmut Selman Sakar, Lorenzo Francesco John Noseda, Amit Yedidia Dolev, Lucio Feo Pancaldi-Giubbini, Adele Fanelli

One of the grand challenges in interventional cardiology and neuroradiology is to minimize the operation time and risk of damage during catheterization. These two factors drastically increase if the target location resides in small and tortuous vessels. Fl ...

Wiley2022

Stochastic gravitational-wave background from metastable cosmic strings

Valerie Fiona Domcke

A metastable cosmic-string network is a generic consequence of many grand unified theories (GUTs) when combined with cosmic inflation. Metastable cosmic strings are not topologically stable, but decay on cosmic time scales due to pair production of GUT mon ...

IOP Publishing Ltd2021

Discrete Time Analysis of Phase Detector Linear Range Extension in Sub-Sampling PLL

Yusuf Leblebici, Duygu Kostak

The discrete time analysis of the phase detector linear range extension in the first and the second order sub sampling phase-locked loop (SSPLL) is presented. The aim is to understand how much the stability and the pull-in range are affected by the linear ...

IEEE2020

An open-loop control scheme to increase the speed and reduce the viscoelastic drift of dielectric elastomer actuators

Samuel Rosset, Alexandre Poulin

We present a simple open-loop method to increase the response speed and suppress the viscoelastic creep of dielectric elastomer actuators. The parameters of the model can be extracted from two simple measurements: a strain vs. voltage ramp, and the strain ...

2019

Quoted Staged Rewriting: A Practical Approach to Library-Defined Optimizations

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Staging has proved a successful technique for programmatically removing code abstractions, thereby allowing for faster program execution while retaining a high-level interface for the programmer. Unfortunately, techniques based on staging suffer from a num ...

ACM2017

Simplicitly: Foundations and Applications of Implicit Function Types

Martin Odersky, Heather Christine Klug, Fengyun Liu, Sandro Stucki, Olivier Eric Paul Blanvillain

Understanding a program entails understanding its context; dependencies, configurations and even implementations are all forms of contexts. Modern programming languages and theorem provers offer an array of constructs to define contexts, implicitly. Scala ...

2017

Update of the Binoth Les Houches Accord for a standard interface between Monte Carlo tools and one-loop programs

Valentin Hirschi

We present an update of the Binoth Les Houches Accord (BLHA) to standardise the interface between Monte Carlo programs and codes providing one-loop matrix elements. (C) 2013 Elsevier B.V. All rights reserved. ...

Elsevier Science Bv2014

Long knots and maps between operads

Kathryn Hess Bellwald

We identify the space of tangentially straightened long knots in R^m, for m greater than or equal to 4, as the double loops on the space of derived operad maps from the associative operad into a version of the little m-disk operad. This verifies a conjectu ...

Geometry & Topology Publications2012

Le foncteur de bi-ensembles des modules de p-permutation

Mélanie Baumann

Let k be an algebraically closed field of characteristic p, where p is a prime number or 0. Let G be a finite group and ppk(G) be the Grothendieck group of p-permutation kG-modules. If we tensor it with C, then Cppk becomes a C-linear biset functor. Recall ...

EPFL2012

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