Concept

Logique de Hoare

Publications associées (26)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Decision Procedures for Automating Termination Proofs

Ruzica Piskac

Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current too ...

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

Fluid-Structure Interaction Problems in Hemodynamics

Paolo Crosetto

In this work we aim at the description, study and numerical investigation of the fluid-structure interaction (FSI) problem applied to hemodynamics. The FSI model considered consists of the Navier-Stokes equations on moving domains modeling blood as a visco ...

EPFL2011

Approximating Parameterized Convex Optimization Problems.

Martin Jaggi

We extend Clarkson's framework by considering parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an ε-approximate solution (and a corresponding ε-coreset) ...

2010

On Delayed Choice Execution for Falsification

Viktor Kuncak, Tihomir Gvero, Milos Gligoric

We present an approach for finding errors in programs and specifications. We formulate our approach as an execution mechanism for a non-deterministic guarded-command language. Guarded commands have already proved useful for verification-condition generatio ...

2008

Proving non-termination

Andrey Rybalchenko, Ashutosh Kumar Gupta

The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of verification tools. While this is well-understood in safety verification, th ...

2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui, Vasu Singh

Abstract. Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability ...

2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui, Vasu Singh

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first \emph{deterministic} specification automata for strict serializability and ...

Springer2008

How to specify and how to prove correctness of secure routing protocols for MANET

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Secure routing protocols for mobile ad hoc networks have been developed recently yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper we are concerned with this problem, how ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

How to specify and how to prove correctness of secure routing protocols for MANET

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper we are concerned with this problem, ho ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET

Jean-Pierre Hubaux, Panagiotis Papadimitratos

2006