Publications associées à Automatic Verification of Parametric Specifications with Complex Topologies

Publications associées (23)

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

Influence of model uncertainty and long term deformations in action effects calculation in reinforced concrete structures

Xhemsi Malja

Most codes of practice adopt a semi probabilistic design approach for the dimensioning and assessment of structures. Accordingly, structural safety is ensured by performing limit state verifications using design values determined with adequately calibrated ...

EPFL2024

Decentralized learning made easy with DecentralizePy

Anne-Marie Kermarrec, Rafael Pereira Pires, Rishi Sharma, Akash Balasaheb Dhasade, Milos Vujasinovic

Decentralized learning (DL) has gained prominence for its potential benefits in terms of scalability, privacy, and fault tolerance. It consists of many nodes that coordinate without a central server and exchange millions of parameters in the inherently ite ...

2023

Automated Verification of Network Function Binaries

George Candea, Aikaterini Argyraki, Solal Vincenzo Pirelli

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

USENIX Association2022

Scaling Language Features for Program Verification

Georg Stefan Schmid

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...

EPFL2022

Direct Model-checking of SysML Models

Alessandro Tempia Calvino

Model-checking intends to verify whether a property is satisfied by a model, or not. Model-checking of high-level models, e.g. SysML models, usually first requires a model transformation to a low level formal specification. The present papers proposes a ne ...

SCITEPRESS2021

Verification of Software Network Functions with No Verification Expertise

Arseniy Zaostrovnykh

Software network functions (NFs), such as a network address translator, load balancer, or proxy, promise to bring flexibility and rapid innovation to computer networks and to reduce operational costs. However, continuous updates and flexibility typically c ...

EPFL2020

Variance-Reduced Stochastic Learning Under Random Reshuffling

Ali H. Sayed, Kun Yuan, Bicheng Ying

Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizer. The existing convergence results assume uniform d ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Scaling Functional Synthesis and Repair

Emmanouil Koukoutos

Program synthesis was first proposed a few decades ago, but in the last decade it has gained increased momentum in the research community. The increasing complexity of software has dictated the urgent need for improved supporting tools that verify the soft ...

EPFL2019

Design of Truss Structures Through Reuse

Corentin Jean Dominique Fivet, Gennaro Senatore, Jan Friedrich Georg Brütting

This paper presents structural optimization techniques to design truss structures that make best use of a given stock of structural components. Still little explored, the reuse of structural components over multiple service lives has the potential to signi ...

2019

Convergence Of Variance-Reduced Learning Under Random Reshuffling

Ali H. Sayed, Kun Yuan, Bicheng Ying

Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizers. The existing convergence results assume uniform ...

IEEE2018

Algorithmic Verification of Component-based Systems

Qiang Wang

This dissertation discusses algorithmic verification techniques for concurrent component-based systems modeled in the Behavior-Interaction-Priority (BIP) framework with both bounded and unbounded concurrency. BIP is a component framework for mixed software ...

EPFL2017

A Formally Verified NAT

George Candea, Aikaterini Argyraki, Solal Vincenzo Pirelli, Luis David Figueiredo Mascarenhas Moreira Pedrosa, Arseniy Zaostrovnykh

We present a Network Address Translator (NAT) written in C and proven to be semantically correct according to RFC 3022, as well as crash-free and memory-safe. There exists a lot of recent work on network verification, but it mostly assumes models of networ ...

Assoc Computing Machinery2017

Translating Scala Programs to Isabelle/HOL, Automated Reasoning

Viktor Kuncak

We present a trustworthy connection between the Leon verification system and the Isabelle proof assistant. Leon is a system for verifying functional Scala programs. It uses a variety of automated theorem provers (ATPs) to check verification conditions (VCs ...

2016

Approximate BDD Optimization with Prioritized epsilon-Preferred Evolutionary Algorithm

Mathias Soeken

Approximate computing has gained high attention in various applications that can benefit from a reduction in costs by lowering the accuracy. In this paper we present an optimization approach for functional approximation of Binary Decision Diagrams (BDDs) w ...

Assoc Computing Machinery2016

Formal verification of infinite-state BIP models

Simon Bliudze, Wajeb Saab

We propose two expressive and complementary techniques for the verification of safety properties of infinite-state BIP models. Both our techniques deal with the full BIP specification, while the existing approaches impose con- siderable restrictions: they ...

Springer2015

Verification of Component-based Systems via Predicate Abstraction and Simultaneous Set Reduction

Simon Bliudze, Qiang Wang

This paper presents a novel safety property verification approach for component-based systems modelled in BIP (Behaviour, Interaction and Priority), encompassing multiparty synchronisation with data transfer and priority. Our contributions consist of: (1 ...

Springer2015

Applying model checking to industrial-sized PLC programs

Simon Bliudze, Jean-Charles Tournier

Programmable Logic Controllers (PLCs) are embedded computers widely used in industrial control systems. Ensuring that a PLC software complies with its specification is a challenging task. Formal verification has become a recommended practice to ensure the ...

Institute of Electrical and Electronics Engineers2015

Timber Folded Plate Structures – Topological and Structural Considerations

Yves Weinand, Andrea Stitic

This paper analyses the potential of different possible folded form topologies for generating timber folded surface structures. The main advantage of such structures lies primarily in the realm of ecology and sustainability. By offering an integral way of ...

2015

A deployable tensegrity footbridge that connects at mid-span

Ian Smith, Nicolas Willy Veuve, Seif Dalil Safaei

This paper describes a near full-scale deployable tensegrity footbridge that deploys from both sides and connects at mid-span. Tensegrity structures are pre-stressed structures composed of tension elements (cables) surrounded by compression elements (strut ...

2015