Context-Switch-Directed Verification in DIVINE
|
|
|
- Pierce Stevens
- 5 years ago
- Views:
Transcription
1 Context-Switch-Directed Verification in DIVINE MEMICS 2014 Vladimír Štill Petr Ročkai Jiří Barnat Faculty of Informatics Masaryk University, Brno October 18, 2014 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
2 Introduction C/C++ with threads (.c/.cpp) Property assertion, memory safety, LTL clang + DIVINE libs LLVM bitcode (.bc) DIVINE model-checker OK Counterexample Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
3 Introduction Automatic verification of real-world parallel C & C++ unit tests and programs race conditions are hard to detect (depend on timing) nondeterministic test results one failure in several thousand runs explicit-state model checking can explore all possible outcomes produces counterexample = path to point in the program violating the property should be short and simple Thread 1 Thread 2 x := 0 y := x x := 2 x := y assert(x == 2) Thread 1 Thread 2 x := 0 y := x x := 2 x := y assert(x == 2) Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
4 Introduction Model checking of real-world parallel C++ programs in DIVINE: what we have explicit-state model checking support for C and C++ including C++11, pthreads (using Low Level Virtual Machine bitcode) use case: parallel unit test detect assertion, memory failure, mutex deadlocks and Linear Temporal Logic violations in any possible interleaving gives a counterexample if property does not hold time and memory consuming multiple reduction strategies implemented Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
5 Introduction Goal of this work improve on-the-fly exploration efficiency improve counterexample readability should be short should not contain unnecessary context switches we primarily target safety properties without negatively affecting verification of bug-free programs Thread 1 Thread 2 x := 42 context switches assert(x! = 0) y := 0 x := 0 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
6 Introduction Bounded Context Switch Model Checking as an inspiration well established (especially) in symbolic model checking limit number of context switches to some preset value idea: common bugs usually require only a few context switches state space size is reduced may not find all bugs Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
7 Context-Switch-Directed Exploration in DIVINE Our contribution: Context-Switch-Directed Reachability used as exploration heuristic for explicit-state model checking implemented for C & C++ models in latest development version of DIVINE alternative to parallel breath-first-search-based reachability explores state space in layers explores in parallel number of context switches can be limited (unlimited by default) Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
8 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 0 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
9 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 0 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
10 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 0 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
11 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 0 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
12 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 0 Layer done Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
13 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Layer init Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
14 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
15 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
16 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
17 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
18 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
19 Exploration Order Context-Switch-Directed Reachability: simplified example Layer: 1 Goal reached Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
20 Results 11 C++ test cases, both real-world bugs and crafted 8 with bugs compare new Context-Switch-Directed Reachability (= CSDR) with breath-first-search-based parallel reachability (= reach.) Counterexample length and number of context switches (CS = context switch, CE = counterexample): model CE length # of CSs in CEs CSDR reach. CSDR reach. barrier-1-bug barrier-1-re-bug barrier-1-re-bug barrier-1-re-bug-test barrier-n-bug fifo-bug mutex-part-deadlock mutex-part-deadlock Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
21 Results Time and scalability: without counterexample Wall Time [s] barrier-1-re Wall Time [s] fifo Algorithm CSDR Reachability Threads Threads Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
22 Results Time and scalability: with counterexample Wall Time [s] barrier-1-re-bug-2 Wall Time [s] 2000 mutex-partial-deadlock-2 Algorithm CSDR Reachability Threads Threads Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
23 Conclusion Conclusion verification of parallel unit tests in C & C++ more readable counterexamples better scalability and result stability viable heuristic, can speed up counterexample search little to no overhead in case of correct model Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
24 Conclusion Conclusion verification of parallel unit tests in C & C++ more readable counterexamples better scalability and result stability viable heuristic, can speed up counterexample search little to no overhead in case of correct model Future work extension to Linear Temporal Logic model checking extension to other input formalisms Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
25 Conclusion Conclusion verification of parallel unit tests in C & C++ more readable counterexamples better scalability and result stability viable heuristic, can speed up counterexample search little to no overhead in case of correct model Future work extension to Linear Temporal Logic model checking extension to other input formalisms Thank you. Vladimír Štill et al. Context-Switch-Directed Verification in DIVINE October 18, / 12
Context-Switch-Directed Verification in DIVINE
Context-Switch-Directed Verification in DIVINE Vladimír Štill, Petr Ročkai, and Jiří Barnat Faculty of Informatics, Masaryk University Brno, Czech Republic {xstill,xrockai,barnat}@fi.muni.cz Abstract.
Model Checking of C and C++ with DIVINE 4
Model Checking of C and C++ with DIVINE 4 Zuzana Baranová, Jiří Barnat, Katarína Kejstová, Tadeáš Kučera, Henrich Lauko, Jan Mrázek, Petr Ročkai, Vladimír Štill Faculty of Informatics, Masaryk University
Symbolic Computation via Program Transformation
Symbolic Computation via Program Transformation Henrich Lauko, Petr Ročkai and Jiří Barnat Masaryk University Brno, Czech Republic Symbolic Computation Motivation verify programs with inputs from the environment
}w!"#$%&'()+,-./012345<ya
Masaryk University Faculty of Informatics }w!"#$%&'()+,-./012345
Copyright 2008 CS655 System Modeling and Analysis. Korea Advanced Institute of Science and Technology
The Spin Model Checker : Part I Copyright 2008 CS655 System Korea Advanced Institute of Science and Technology System Spec. In Promela Req. Spec. In LTL Overview of the Spin Architecture Spin Model pan.c
4/6/2011. Model Checking. Encoding test specifications. Model Checking. Encoding test specifications. Model Checking CS 4271
Mel Checking LTL Property System Mel Mel Checking CS 4271 Mel Checking OR Abhik Roychoudhury http://www.comp.nus.edu.sg/~abhik Yes No, with Counter-example trace 2 Recap: Mel Checking for mel-based testing
arxiv: v1 [cs.se] 31 May 2018
![arxiv: v1 [cs.se] 31 May 2018](/thumbs/88/116218808.jpg "arxiv: v1 [cs.se] 31 May 2018")
From Model Checking to Runtime Verification and Back Katarína Kejstová, Petr Ročkai, and Jiří Barnat arxiv:1805.12428v1 [cs.se] 31 May 2018 Faculty of Informatics, Masaryk University Brno, Czech Republic
Symbolic Execution, Dynamic Analysis
Symbolic Execution, Dynamic Analysis http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Symbolic execution Pavel Parízek Symbolic Execution, Dynamic Analysis
Distributed Systems Programming (F21DS1) SPIN: Formal Analysis I
Distributed Systems Programming (F21DS1) SPIN: Formal Analysis I Andrew Ireland Department of Computer Science School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh Overview Introduce
INF5140: Specification and Verification of Parallel Systems
INF5140: Specification and Verification of Parallel Systems Lecture 09 Defining Correctness Claims Gerar Schneider Department of Informatics University of Oslo INF5140, Spring 2007 Gerar Schneider (Ifi,
Introduction to the Case- Study: A Model-Checker
Real stuff! Introduction to the Case- Study: A Model-Checker Alexandre David 1.2.05 http://www.cs.aau.dk/~adavid/teaching/mvp-08/ 1 Classification of Problems Computation is known in advance can divide
ESBMC 1.22 (Competition Contribution) Jeremy Morse, Mikhail Ramalho, Lucas Cordeiro, Denis Nicole, Bernd Fischer
ESBMC 1.22 (Competition Contribution) Jeremy Morse, Mikhail Ramalho, Lucas Cordeiro, Denis Nicole, Bernd Fischer ESBMC: SMT-based BMC of single- and multi-threaded software exploits SMT solvers and their
Model Checking Parallel Programs with Inputs
Model Checking Parallel Programs with Inputs Jiří Barnat, Petr Bauch and Vojtěch Havel 12 February 2014 Barnat et. al. (ParaDiSe) Control Explicit Data Symbolic 1 / 23 Motivation: Parallel Software Verification
Research Collection. Formal background and algorithms. Other Conference Item. ETH Library. Author(s): Biere, Armin. Publication Date: 2001
Research Collection Other Conference Item Formal background and algorithms Author(s): Biere, Armin Publication Date: 2001 Permanent Link: https://doi.org/10.3929/ethz-a-004239730 Rights / License: In Copyright
INF672 Protocol Safety and Verification. Karthik Bhargavan Xavier Rival Thomas Clausen
INF672 Protocol Safety and Verication Karthik Bhargavan Xavier Rival Thomas Clausen 1 Course Outline Lecture 1 [Today, Sep 15] Introduction, Motivating Examples Lectures 2-4 [Sep 22,29, Oct 6] Network
Testing Concurrent Java Programs Using Randomized Scheduling
Testing Concurrent Java Programs Using Randomized Scheduling Scott D. Stoller Computer Science Department State University of New York at Stony Brook http://www.cs.sunysb.edu/ stoller/ 1 Goal Pillars of
Using Off-the-Shelf Exception Support Components in C++ Verification
Using Off-the-Shelf Exception Support Components in C++ Verification Vladimír Štill Faculty of Informatics, Masaryk University Brno, Czech Republic Email: xstill@fi.muni.cz Petr Ročkai Faculty of Informatics,
Counterexample Guided Synthesis of Monitors for Realizability Enforcement. Matthias Güdemann Gwen Salaün Meriem Ouederni
Counterexample Guided Synthesis of Monitors for Realizability Enforcement Matthias Güdemann Gwen Salaün Meriem Ouederni Choreographies Global contract specifications Participants, communication, message
Predicting Data Races from Program Traces
Predicting Data Races from Program Traces Luis M. Carril IPD Tichy Lehrstuhl für Programmiersysteme KIT die Kooperation von Forschungszentrum Karlsruhe GmbH und Universität Karlsruhe (TH) Concurrency &
Bounded Model Checking of Concurrent Programs
Bounded Model Checking of Concurrent Programs Ishai Rabinovitz 1, and Orna Grumberg 1 1 Technion - Israel Institute of Technology IBM Haifa Research Laboratory, Haifa, Israel ishai@il.ibm.com orna@cs.technion.ac.il
Distributed Binary Decision Diagrams for Symbolic Reachability
Distributed Binary Decision Diagrams for Symbolic Reachability Wytse Oortwijn Formal Methods and Tools, University of Twente November 1, 2015 Wytse Oortwijn (Formal Methods and Tools, Distributed University
Reachability testing for concurrent programs. Yu Lei and Richard Carver Presented by Thuan Huynh
Reachability testing for concurrent programs Yu Lei and Richard Carver Presented by Thuan Huynh Introduction Some existing tools Reachability testing Concepts Algorithm Implementation Optimizations Results
Distributed LTL Model Checking with Hash Compaction 1
Available online at www.sciencedirect.com Electronic Notes in Theoretical Computer Science 296 (2013) 79 93 www.elsevier.com/locate/entcs Distributed LTL Model Checking with Hash Compaction 1 J. Barnat,
THE MODEL CHECKER SPIN
THE MODEL CHECKER SPIN Shin Hong, KAIST 17 th April,2007 1/33 Contents Introduction PROMELA Linear Temporal Logic Automata-theoretic software verification Example : Simple Elevator 2 SPIN is a software
Model Checking with Automata An Overview
Model Checking with Automata An Overview Vanessa D Carson Control and Dynamical Systems, Caltech Doyle Group Presentation, 05/02/2008 VC 1 Contents Motivation Overview Software Verification Techniques
The Spin Model Checker : Part I/II
The Spin Model Checker : Part I/II Moonzoo Kim CS Dept. KAIST Korea Advanced Institute of Science and Technology Motivation: Tragic Accidents Caused by SW Bugs 2 Cost of Software Errors June 2002 Software
Simulink 모델과 C/C++ 코드에대한매스웍스의정형검증툴소개 The MathWorks, Inc. 1
Simulink 모델과 C/C++ 코드에대한매스웍스의정형검증툴소개 2012 The MathWorks, Inc. 1 Agenda Formal Verification Key concept Applications Verification of designs against (functional) requirements Design error detection Test
CS510 Advanced Topics in Concurrency. Jonathan Walpole
CS510 Advanced Topics in Concurrency Jonathan Walpole Threads Cannot Be Implemented as a Library Reasoning About Programs What are the valid outcomes for this program? Is it valid for both r1 and r2 to
Efficient Large-Scale Model Checking
Efficient Large-Scale Model Checking Kees Verstoep versto@cs.vu.nl VU University, Amsterdam, The Netherlands Joint work with: Henri Bal bal@cs.vu.nl VU, Amsterdam, NL Jiří Barnat, Luboš Brim {barnat,brim}@fi.muni.cz
Environment Modeling for Modular Software Analysis with Java PathFinder Part 1
Environment Modeling for Modular Software Analysis with Java PathFinder Part 1 Oksana Tkachuk SGT/NASA Ames oksana.tkachuk@nasa.gov Peter Mehlitz SGT/NASA Ames peter.c.mehlitz@nasa.gov Software Model Checking
Multi-Threaded Nested DFS
Faculty of Informatics, Masaryk University Multi-Threaded Nested DFS Bachelor s Thesis Petr Ročkai Brno, spring 2007 Declaration Thereby I declare that this thesis is my original work, which I have created
Combining Complementary Formal Verification Strategies to Improve Performance and Accuracy
Combining Complementary Formal Verification Strategies to Improve Performance and Accuracy David Owen June 15, 2007 2 Overview Four Key Ideas A Typical Formal Verification Strategy Complementary Verification
Testing. ECE/CS 5780/6780: Embedded System Design. Why is testing so hard? Why do testing?
Testing ECE/CS 5780/6780: Embedded System Design Scott R. Little Lecture 24: Introduction to Software Testing and Verification What is software testing? Running a program in order to find bugs (faults,
CS 267: Automated Verification. Lecture 13: Bounded Model Checking. Instructor: Tevfik Bultan
CS 267: Automated Verification Lecture 13: Bounded Model Checking Instructor: Tevfik Bultan Remember Symbolic Model Checking Represent sets of states and the transition relation as Boolean logic formulas
Patrick Trentin Formal Methods Lab Class, March 03, 2017
Spin: Introduction Patrick Trentin patrick.trentin@unitn.it http://disi.unitn.it/trentin Formal Methods Lab Class, March 03, 2017 These slides are derived from those by Stefano Tonetta, Alberto Griggio,
Verifying Concurrent Programs
Verifying Concurrent Programs Daniel Kroening 8 May 1 June 01 Outline Shared-Variable Concurrency Predicate Abstraction for Concurrent Programs Boolean Programs with Bounded Replication Boolean Programs
Software Model Checking. Xiangyu Zhang
Software Model Checking Xiangyu Zhang Symbolic Software Model Checking CS510 S o f t w a r e E n g i n e e r i n g Symbolic analysis explicitly explores individual paths, encodes and resolves path conditions
Computer Aided Verification 2015 The SPIN model checker
Computer Aided Verification 2015 The SPIN model checker Grigory Fedyukovich Universita della Svizzera Italiana March 11, 2015 Material borrowed from Roberto Bruttomesso Outline 1 Introduction 2 PROcess
System Correctness. EEC 421/521: Software Engineering. System Correctness. The Problem at Hand. A system is correct when it meets its requirements
System Correctness EEC 421/521: Software Engineering A Whirlwind Intro to Software Model Checking A system is correct when it meets its requirements a design without requirements cannot be right or wrong,
The SPIN Model Checker
The SPIN Model Checker Metodi di Verifica del Software Andrea Corradini Lezione 1 2013 Slides liberamente adattate da Logic Model Checking, per gentile concessione di Gerard J. Holzmann http://spinroot.com/spin/doc/course/
Bounded Model Checking of C++ Programs based on the Qt Cross-Platform Framework (Journal-First Abstract)
Bounded Model Checking of C++ Programs based on the Qt Cross-Platform Framework (Journal-First Abstract) Felipe R. Monteiro Mário A. P. Garcia Lucas C. Cordeiro Eddie B. de Lima Filho 33 rd IEEE/ACM International
The C/C++ Memory Model: Overview and Formalization
The C/C++ Memory Model: Overview and Formalization Mark Batty Jasmin Blanchette Scott Owens Susmit Sarkar Peter Sewell Tjark Weber Verification of Concurrent C Programs C11 / C++11 In 2011, new versions
Safety and liveness for critical sections
Safety and liveness for critical sections! At most k threads are concurrently in the critical section A. Safety B. Liveness C. Both! A thread that wants to enter the critical section will eventually succeed
Improving Parallel State-Space Exploration Using Genetic Algorithms
Improving Parallel State-Space Exploration Using Genetic Algorithms Etienne Renault LRDE, EPITA, Kremlin-Bicêtre, France Abstract. The verification of temporal properties against a given system may require
Java PathFinder. Pavel Parízek. CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics
Java PathFinder http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Java PathFinder (JPF) Verification framework for Java programs Explicit state space
Finding Errors in Multithreaded GUI Applications
Finding Errors in Multithreaded GUI Applications Sai Zhang University of Washington Joint work with: Hao Lu, Michael D. Ernst GUIs are everywhere in modern software 2 Multithreading in GUI applications
Java PathFinder JPF 2 Second Generation of Java Model Checker
Java PathFinder JPF 2 Second Generation of Java Model Checker Guenther Brand Mat. Nr. 9430535 27. 06. 2003 Abstract This essay is based on the papers Java PathFinder, Second Generation of Java Model Checker
The Spin Model Checker : Part I. Moonzoo Kim KAIST
The Spin Model Checker : Part I Moonzoo Kim KAIST Hierarchy of SW Coverage Criteria Complete Value Coverage CVC (SW) Model checking Complete Path Coverage CPC Concolic testing All-DU-Paths Coverage ADUP
Dynamic Monitoring Tool based on Vector Clocks for Multithread Programs
, pp.45-49 http://dx.doi.org/10.14257/astl.2014.76.12 Dynamic Monitoring Tool based on Vector Clocks for Multithread Programs Hyun-Ji Kim 1, Byoung-Kwi Lee 2, Ok-Kyoon Ha 3, and Yong-Kee Jun 1 1 Department
Warm-up question (CS 261 review) What is the primary difference between processes and threads from a developer s perspective?
Warm-up question (CS 261 review) What is the primary difference between processes and threads from a developer s perspective? CS 470 Spring 2018 POSIX Mike Lam, Professor Multithreading & Pthreads MIMD
JPF SE: A Symbolic Execution Extension to Java PathFinder
JPF SE: A Symbolic Execution Extension to Java PathFinder Saswat Anand 1,CorinaS.Păsăreanu 2, and Willem Visser 2 1 College of Computing, Georgia Institute of Technology saswat@cc.gatech.edu 2 QSS and
Thread Synchronization: Too Much Milk
Thread Synchronization: Too Much Milk 1 Implementing Critical Sections in Software Hard The following example will demonstrate the difficulty of providing mutual exclusion with memory reads and writes
Translating C programs using POSIX thread into CSP for refinement checking
Translating C programs using POSIX thread into CSP for refinement checking Hisabumi HATSUGAI hatsugai@principia-m.com PRINCIPIA Limited http://www.principia-m.com/ 2017 PRINCIPIA Limited 1 Pthread Model
Verifying C & C++ with ESBMC
Verifying C & C++ with ESBMC Denis A Nicole dan@ecs.soton.ac.uk CyberSecuritySoton.org [w] @CybSecSoton [fb & tw] ESBMC ESBMC, the Efficient SMT-Based Context-Bounded Model Checker was originally developed
Distributed Memory LTL Model Checking
! " #$ %& D E ')(+*,.-0/132?@ACB 46587:9= F GH Faculty of Informatics Masaryk University Brno Distributed Memory LTL Model Checking Ph.D. Thesis Jiří Barnat September 2004 Abstract Distribution and
Parallel Model Checking of ω-automata
Parallel Model Checking of ω-automata Vincent Bloemen Formal Methods and Tools, University of Twente v.bloemen@utwente.nl Abstract. Specifications for non-terminating reactive systems are described by
Program Analysis and Code Verification
Program Analysis and Code Verification http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Language Lectures: English Labs: English Homework: Czech/English
Assaf Marron. Weizmann Institute of Science
Assaf Marron Weizmann Institute of Science » Decades of advances in languages, tools and methodologies» Growing demand, criticality of software systems» Yet, software development is still hard, expensive,
Scenario Graphs Applied to Security (Summary Paper)
Book Title Book Editors IOS Press, 2003 1 Scenario Graphs Applied to Security (Summary Paper) Jeannette M. Wing Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 US Abstract.
CS/ECE 5780/6780: Embedded System Design
CS/ECE 5780/6780: Embedded System Design John Regehr Lecture 18: Introduction to Verification What is verification? Verification: A process that determines if the design conforms to the specification.
Computer Lab 1: Model Checking and Logic Synthesis using Spin (lab)
Computer Lab 1: Model Checking and Logic Synthesis using Spin (lab) Richard M. Murray Nok Wongpiromsarn Ufuk Topcu Calornia Institute of Technology AFRL, 25 April 2012 Outline Spin model checker: modeling
Honours/Master/PhD Thesis Projects Supervised by Dr. Yulei Sui
Honours/Master/PhD Thesis Projects Supervised by Dr. Yulei Sui Projects 1 Information flow analysis for mobile applications 2 2 Machine-learning-guide typestate analysis for UAF vulnerabilities 3 3 Preventing
To Store or Not To Store
To Store or Not To Store Radek Pelánek Masaryk University, Brno Gerd Behrmann, Kim G. Larsen Aalborg University To Store or Not To Store p.1/24 Reachability Problem Model: networks of timed automata with
Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols
Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols Lee Pike (Presenting), Galois, Inc. leepike@galois.com Geoffrey M. Brown, Indiana University geobrown@cs.indiana.edu
Distributed Systems Programming (F21DS1) SPIN: Formal Analysis II
Distributed Systems Programming (F21DS1) SPIN: Formal Analysis II Andrew Ireland Department of Computer Science School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh Overview Introduce
ClabureDB: Classified Bug-Reports Database
ClabureDB: Classified Bug-Reports Database Tool for developers of program analysis tools Jiri Slaby, Jan Strejček, and Marek Trtík Faculty of Informatics, Masaryk University Botanická 68a, 60200 Brno,
Network Protocol Design and Evaluation
Network Protocol Design and Evaluation 05 - Validation, Part III Stefan Rührup Summer 2009 Overview In the first parts of this chapter: Validation models in Promela Defining and checking correctness claims
CS 450 Exam 2 Mon. 4/11/2016
CS 450 Exam 2 Mon. 4/11/2016 Name: Rules and Hints You may use one handwritten 8.5 11 cheat sheet (front and back). This is the only additional resource you may consult during this exam. No calculators.
Fast, Dynamically-Sized Concurrent Hash Table
Fast, Dynamically-Sized Concurrent Hash Table J. Barnat, P. Ročkai, V. Štill, and J. Weiser Faculty of Informatics, Masaryk University Brno, Czech Republic {barnat,xrockai,xstill,xweiser1}@fi.muni.cz Abstract.
FORMAL METHODS IN NETWORKING COMPUTER SCIENCE 598D, SPRING 2010 PRINCETON UNIVERSITY LIGHTWEIGHT MODELING IN PROMELA/SPIN AND ALLOY
FORMAL METHODS IN NETWORKING COMPUTER SCIENCE 598D, SPRING 2010 PRINCETON UNIVERSITY LIGHTWEIGHT MODELING IN PROMELA/SPIN AND ALLOY Pamela Zave AT&T Laboratories Research Florham Park, New Jersey, USA
The Maude LTL Model Checker and Its Implementation
The Maude LTL Model Checker and Its Implementation Steven Eker 1,José Meseguer 2, and Ambarish Sridharanarayanan 2 1 Computer Science Laboratory, SRI International Menlo Park, CA 94025 eker@csl.sri.com
Non-blocking Array-based Algorithms for Stacks and Queues. Niloufar Shafiei
Non-blocking Array-based Algorithms for Stacks and Queues Niloufar Shafiei Outline Introduction Concurrent stacks and queues Contributions New algorithms New algorithms using bounded counter values Correctness
T Reactive Systems: Kripke Structures and Automata
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Kripke Structures and Automata Spring 2005, Lecture 3 January 31, 2005 Tik-79.186 Reactive Systems 2 Properties of systems invariants: the system
Verifying Periodic Programs with Priority Inheritance Locks
Verifying Periodic Programs with Priority Inheritance Locks Sagar Chaki, Arie Gurfinkel, Ofer Strichman FMCAD, October, 03 Software Engineering Institute, CMU Technion, Israel Institute of Technology Copyright
Model checking Timber program. Paweł Pietrzak
Model checking Timber program Paweł Pietrzak 1 Outline Background on model checking (spam?) The SPIN model checker An exercise in SPIN - model checking Timber Deriving finite models from Timber programs
Java Pathfinder. State of Affairs. Pavel Parizek. School of Computer Science, University of Waterloo
Java Pathfinder General Overview and Current State of Affairs School of Computer Science, University of Waterloo Java Pathfinder Highly customizable and extensible platform for analysis and verification
WHITE PAPER. 10 Reasons to Use Static Analysis for Embedded Software Development
WHITE PAPER 10 Reasons to Use Static Analysis for Embedded Software Development Overview Software is in everything. And in many embedded systems like flight control, medical devices, and powertrains, quality
C Code Verification based on the Extended Labeled Transition System Model
C Code Verification based on the Extended Labeled Transition System Model Dexi Wang, Chao Zhang, Guang Chen, Ming Gu, and Jiaguang Sun School of Software, TNLIST, Tsinghua University, China {dx-wang12,zhang-chao13,chenguan14}@mails.tsinghua.edu.cn
Ionuţ Buricea. Trying to extend this work to timed protocols, I studied the verification of timed systems
Ionut Buricea Ionuţ Buricea phone: (650) 967-6253 email: ionutb@cis.ksu.edu URL: http://www.cis.ksu.edu/ ionutb/ Research Interests Modular design and compositional verification of communication protocols,
Patrick Trentin Formal Methods Lab Class, Feb 26, 2016
Spin: Introduction Patrick Trentin patrick.trentin@unitn.it http://disi.unitn.it/~trentin Formal Methods Lab Class, Feb 26, 2016 These slides are derived from those by Stefano Tonetta, Alberto Griggio,
Formal Verification of Control Software: A Case Study
Formal Verification of Control Software: A Case Study Andreas Griesmayer 1, Roderick Bloem 1, Martin Hautzendorfer 2, and Franz Wotawa 1 1 Graz University of Technology, Austria {agriesma,rbloem,fwotawa}@ist.tu-graz.ac.at
Formal Specification and Verification
Formal Specification and Verification Model Checking with Temporal Logic Bernhard Beckert Based on a lecture by Wolfgang Ahrendt and Reiner Hähnle at Chalmers University, Göteborg Formal Specification
Administrivia. ECE/CS 5780/6780: Embedded System Design. Acknowledgements. What is verification?
Administrivia ECE/CS 5780/6780: Embedded System Design Scott R. Little Lab 8 status report. Set SCIBD = 52; (The Mclk rate is 16 MHz.) Lecture 18: Introduction to Hardware Verification Scott R. Little
SimGrid MC 101. Getting Started with the SimGrid Model-Checker. Da SimGrid Team. April 11, 2017
SimGrid MC 101 Getting Started with the SimGrid Model-Checker Da SimGrid Team April 11, 2017 About this Presentation Goals and Contents Understanding the basics of Model checking Running SimGrid as a Model
Formal Verification by Model Checking
Formal Verication by Model Checking Jonathan Aldrich Carnegie Mellon University Based on slides developed by Natasha Sharygina 17-654/17-754: Analysis of Software Artacts Spring 2006 1 CTL Model Checking
FORMAL METHODS IN NETWORKING COMPUTER SCIENCE 598D, SPRING 2010 PRINCETON UNIVERSITY LIGHTWEIGHT MODELING IN PROMELA/SPIN AND ALLOY
FORMAL METHODS IN NETWORKING COMPUTER SCIENCE 598D, SPRING 2010 PRINCETON UNIVERSITY LIGHTWEIGHT MODELING IN PROMELA/SPIN AND ALLOY Pamela Zave AT&T Laboratories Research Florham Park, New Jersey, USA
Finite State Verification. CSCE Lecture 21-03/28/2017
Finite State Verification CSCE 747 - Lecture 21-03/28/2017 So, You Want to Perform Verification... You have a property that you want your program to obey. Great! Let s write some tests! Does testing guarantee
Program Verification. Aarti Gupta
Program Verification Aarti Gupta 1 Agenda Famous bugs Common bugs Testing (from lecture 6) Reasoning about programs Techniques for program verification 2 Famous Bugs The first bug: A moth in a relay (1945)
Model Requirements and JAVA Programs MVP 2 1
Model Requirements and JAVA Programs MVP 2 1 Traditional Software The Waterfall Model Problem Area Development Analysis REVIEWS Design Implementation Costly wrt time and money. Errors are found too late
Model Checking Software with
Model Checking Software with Patrice Godefroid Bell Laboratories, Lucent Technologies PASTE 2004 Page 1 June 2004 Model Checking A B C deadlock Each component is modeled by a FSM. Model Checking = systematic
SPIN, PETERSON AND BAKERY LOCKS
Concurrent Programs reasoning about their execution proving correctness start by considering execution sequences CS4021/4521 2018 jones@scss.tcd.ie School of Computer Science and Statistics, Trinity College
Promela and SPIN. Mads Dam Dept. Microelectronics and Information Technology Royal Institute of Technology, KTH. Promela and SPIN
Promela and SPIN Mads Dam Dept. Microelectronics and Information Technology Royal Institute of Technology, KTH Promela and SPIN Promela (Protocol Meta Language): Language for modelling discrete, event-driven
Runtime Atomicity Analysis of Multi-threaded Programs
Runtime Atomicity Analysis of Multi-threaded Programs Focus is on the paper: Atomizer: A Dynamic Atomicity Checker for Multithreaded Programs by C. Flanagan and S. Freund presented by Sebastian Burckhardt
Module 11: The lastprivate Clause Lecture 22: Intel Compilers and Threading Tools. The Lecture Contains: Intel Compilers and Threading Tools
The Lecture Contains: Intel Compilers and Threading Tools Some Issues Involved in Parallel Programming Contd... We Need Help Intel Tools Build Correct Optimize Cluster Intel Compiler Example Code Intel
CS5232 Formal Specification and Design Techniques. Using PAT to verify the Needham-Schroeder Public Key Protocol
CS5232 Formal Specification and Design Techniques Using PAT to verify the Needham-Schroeder Public Key Protocol Semester 2, AY 2008/2009 1/37 Table of Contents 1. Project Introduction 3 2. Building the
Model Checking DSL-Generated C Source Code
Model Checking DSL-Generated C Source Code Martin Sulzmann and Axel Zechner Informatik Consulting Systems AG, Germany {martin.sulzmann,axel.zechner}@ics-ag.de Abstract. We report on the application of
Modular Verification of Web Services Using Efficient Symbolic Encoding and Summarization
Modular Verification of Web Services Using Efficient Symbolic Encoding and Summarization Fang Yu joint work with: Chao Wang, Aarti Gupta and Tevfik Bultan University of California, Santa Barbara and NEC
On Refinement of Büchi Automata for Explicit Model Checking
On Refinement of Büchi Automata for Explicit Model Checking František Blahoudek 1, Alexandre Duret-Lutz 2, Vojtěch Rujbr 1, and Jan Strejček 1 1 Faculty of Informatics, Masaryk University, Brno, Czech
Building Graphical Promela Models using UPPAAL GUI
Building Graphical Promela Models using UPPAAL GUI Master s Thesis Report by Vasu Hossaholal Lingegowda Software Systems Engineering Group: B2-201 under the guidance of Dr. Alexandre David Department of
Distributed Systems Programming (F21DS1) Formal Verification
Distributed Systems Programming (F21DS1) Formal Verification Andrew Ireland Department of Computer Science School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh Overview Focus on