'Abstraction refinement' diaporamas de présentation

Scalable Program Verification by Lazy Abstraction

Scalable Program Verification by Lazy Abstraction. Ranjit Jhala U.C. Berkeley. Mars, July 4, 1997. Lost contact due to real-time priority inversion bug. Mars, December 3, 1999. Crashed due to uninitialized variable. French Guyana, June 4, 1996. $600 million software failure.

611 views • 61 slides

Software Verification

Software Verification. Natasha Sharygina The University of Lugano, Carnegie Mellon University. Computer Science Club, Steklov Math Institute Lecture 1. Outline . Lecture 1: Motivation Model Checking in a Nutshell Software Model Checking SAT-based approach Lecture 2:

687 views • 58 slides

A Decision Procedure for Program Analysis and Bug Finding

A Decision Procedure for Program Analysis and Bug Finding. Vijay Ganesh Affiliation: CSAIL, MIT Supported by Lincoln Labs February 7 th , 2008. Motivating Example. A[0]=0 A[1]=1 0<=x<=1 A[x]+x=0. Foo(int x){ int A[2]; int t; A[0] = 0; A[1] = 1; if(0 <= x <= 1) { t = 2/(A[x] + x);

509 views • 43 slides

A Decision Procedure for Program Analysis and Bug Finding

A Decision Procedure for Program Analysis and Bug Finding. Vijay Ganesh Affiliation: CSAIL, MIT Supported by Lincoln Labs February 7 th , 2008. Motivating Example. A[0]=0 A[1]=1 0<=x<=1 A[x]+x=0. Foo(int x){ int A[2]; int t; A[0] = 0; A[1] = 1; if(0 <= x <= 1) { t = 2/(A[x] + x);

532 views • 43 slides

A Decision Procedure for Program Analysis and Bug Finding

A Decision Procedure for Program Analysis and Bug Finding. Vijay Ganesh Affiliation: CSAIL, MIT Supported by Lincoln Labs February 7 th , 2008. Motivating Example. A[0]=0 A[1]=1 0<=x<=1 A[x]+x=0. Foo(int x){ int A[2]; int t; A[0] = 0; A[1] = 1; if(0 <= x <= 1) { t = 2/(A[x] + x);

431 views • 43 slides

A Decision Procedure for Program Analysis and Bug Finding

A Decision Procedure for Program Analysis and Bug Finding. Vijay Ganesh Affiliation: CSAIL, MIT Supported by Lincoln Labs February 7 th , 2008. Motivating Example. A[0]=0 A[1]=1 0<=x<=1 A[x]+x=0. Foo(int x){ int A[2]; int t; A[0] = 0; A[1] = 1; if(0 <= x <= 1) { t = 2/(A[x] + x);

435 views • 43 slides

Software Verification using Predicate Abstraction and Iterative Refinement: Part 1

Software Verification using Predicate Abstraction and Iterative Refinement: Part 1. 15-414 Bug Catching: Automated Program Verification and Testing Sagar Chaki November 28, 2011. Outline. Overview of Model Checking Creating Models from C Code: Predicate Abstraction

526 views • 36 slides

Model-Checking Frameworks: Outline

Model-Checking Frameworks: Outline. Theory (Part 1) Notion of Abstraction Aside: over- and under-approximation, simulation, bisimulation Counter-example-based abstraction refinement Abstraction and abstraction refinement in program analysis (Part 2) Kinds of abstraction: Data, predicate

495 views • 35 slides

Thread-modular Abstraction Refinement

455 views • 33 slides

Decision heuristics based on an Abstraction/Refinement model

Decision heuristics based on an Abstraction/Refinement model. (HaifaSat). Ofer Strichman Roman Gershman An earlier version was presented in IBM’s verification conference (Haifa, Oct. 05). Technion. SAT solving. “Naïve” point of view: Searches in the decision tree, prunes subspaces .

434 views • 31 slides

Consequence Generation, Interpolants, and Invariant Discovery

Consequence Generation, Interpolants, and Invariant Discovery. Ken McMillan Cadence Berkeley Labs. Automated abstraction. Abstraction means throwing away information about a system not needed to prove a given property.

443 views • 30 slides

Thread-modular Abstraction Refinement

308 views • 30 slides

Automatic Abstraction Refinement for GSTE

281 views • 27 slides

Introduction to Formal Verification/Reasoning

Introduction to Formal Verification/Reasoning. Fall 2018: CSCI 699 Instructor: Jyo Deshmukh Course materials: http://www-bcf.usc.edu/~jdeshmuk/teaching/cs699-fm-for-cps/index.html. Formal Verification: Problem Definition. Let be a program (or process or a CPS)

272 views • 25 slides

Possibilistic and probabilistic abstraction-based model checking

Possibilistic and probabilistic abstraction-based model checking. Michael Huth Computing Imperial College London, United Kingdom. Outline of talk. need for abstraction modal quantitative systems possibilistic semantics probabilistic semantics specification of abstractions

302 views • 19 slides

A Framework on Synchronization Verification in System-Level Design

A Framework on Synchronization Verification in System-Level Design. Thanyapat Sakunkonchak Satoshi Komatsu Masahiro Fujita Fujita Laboratory University of Tokyo. Contents. Introduction System-level design VS Verification Counterexample-guided abstraction refinement (CEGAR)

366 views • 19 slides