Publications associées à Vérification de modèles

Striking a New Balance Between Program Instrumentation and Debugging Time

Willy Zwaenepoel, Ricardo Bianchini, Olivier Crameri

Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the developer in locating the problem. In this paper, we explore a new approach to b ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Verification of STM on relaxed memory models

Rachid Guerraoui, Vasu Singh

Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed ...

Springer Verlag2011

Numerical modeling and neural networks to identify model parameters from piezocone tests: I. FEM analysis of penetration in two-phase continuum

Laurent Vulliet, Rafal Filip Obrzud, Andrzej Truty

This study presents a numerical approach designed for material parameter identification for the coupled hydro-mechanical boundary value problem (BVP) of the piezocone test (CPTU) in normally and lightly overconsolidated clayey soils. The study is presented ...

Wiley-Blackwell2011

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

Scala to the Power of Z3: Integrating SMT and Programming

Viktor Kuncak, Philippe Paul Henri Suter

We describe a system that integrates the SMT solver Z3 with the Scala programming language. The system supports the use of the SMT solver for checking satisfiability, unsatisfiability, as well as solution enumeration. The embedding of formula trees into Sc ...

Springer-Verlag Berlin2011

Shape Refinement through Explicit Heap Analysis

Dirk Thilo Beyer, Grégory Théoduloz, Damien Zufferey

Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structu ...

Springer2010

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

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Vérification de modèles

Striking a New Balance Between Program Instrumentation and Debugging Time

Verification of STM on relaxed memory models

Numerical modeling and neural networks to identify model parameters from piezocone tests: I. FEM analysis of penetration in two-phase continuum

Satisfiability Modulo Recursive Programs

Scala to the Power of Z3: Integrating SMT and Programming

Software Verification by Combining Program Analyses of Adjustable Precision

Shape Refinement through Explicit Heap Analysis

Automatic Verification of Parametric Specifications with Complex Topologies

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Graph Chatbot

Chattez avec Graph Search

Numerical modeling and neural networks to identify model parameters from piezocone tests: I. FEM analysis of penetration in two-phase continuum

Software Verification by Combining Program Analyses of Adjustable Precision

Shape Refinement through Explicit Heap Analysis

Satisfiability Modulo Recursive Programs

Scala to the Power of Z3: Integrating SMT and Programming

Verification of STM on relaxed memory models

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Automatic Verification of Parametric Specifications with Complex Topologies

Striking a New Balance Between Program Instrumentation and Debugging Time