Introduction to Software Verification


 Maurice Hunt
 3 years ago
 Views:
Transcription
1 Introduction to Software Verification Orna Grumberg Lectures Material winter
2 Lecture
3 Model Checking Automated formal verification: A different approach to formal verification
4 Model Checking [CE81,QS82] An efficient procedure that receives: A finitestate model describing a system A temporal logic formula describing a property It returns yes, if the system has the property no + Counterexample, otherwise 4
5 Building a model from a program 5
6 Back to the Mutual Exclusion Example Two processes with a joint Boolean signal sem Each process P i has a variable v i describing its state: v i := N Non critical v i := T Trying v i := C Critical
7 Mutual Exclusion Example Each process runs the following program: Atomic action P i :: while (true) { } if (v i == N) v i = T; else if (v i == T && sem) { v i = C; sem = 0; } else if (v i == C) {v i = N; sem = 1; } The full program is: P 1 P 2 Initial state: (v 1 =N, v 2 =N, sem) The execution is interleaving
8 Mutual Exclusion Example v 1 =N, v 2 =N, sem v 1 =T, v 2 =N, sem v 1 =N, v 2 =T, sem v 1 =C, v 2 =N, sem v 1 =T, v 2 =T, sem v 1 =N, v 2 =C, sem v 1 =C, v 2 =T, sem v 1 =T, v 2 =C, sem
9 v 1 =N, v 2 =N, sem T 1 v 1 =T, v 2 =N, sem v 1 =N, v 2 =T, sem C 1 v 1 =C, v 2 =N, sem v 1 =T, v 2 =T, sem v 1 =N, v 2 =C, sem C 1,T 2 v 1 =C, v 2 =T, sem v 1 =T, v 2 =C, sem We define atomic propositions: AP={C 1,C 2,T 1,T 2 ) A state is marked with T i if v i =T A state is marked with C i if v i =C
10 T 1 T 2 C 1 T 1,T 2 C 2 C 1,T 2 T 1,C 2 Property 1: AG (C 1 C 2 ) Property 2: AG((T 1 FC 1 ) (T 2 FC 2 ))
11 Temporal Logic
12 Kripke Structure M=(S,R,L,S 0 ) Given AP finite set of atomic proposition S (finite) set of states R S S total transition relation For every s S there exists s S such that (s,s ) R. Totality means that every path is infinite L:S 2 AP  labeling function that associates every state with the atomic propositions true in that state S 0 S set of initial states (optional)
13 = s 0,s 1, is a path in M from a state s if s = s 0 and R(s i,s i+1 ) for every I i the suffix of starting at s i 13
14 Temporal Logics Express properties of event orderings in time Linear Time Every moment has a unique successor Infinite sequences (words) Linear Time Temporal Logic (LTL) Branching Time Every moment has several successors Infinite tree Computation Tree Logic (CTL) 14
15 Propositional Temporal Logic AP a set of atomic propositions, p AP Temporal operators: Xp Gp Fp puq Path quantifiers: A for all path E there exists a path 15
16 State formulas: p AP CTL* g 1, g 1 g 2, g 1 g 2 where g 1,g 2 are state formulas Ef, Af where f is a path formula Path formulas: Every state formula g is a path formula f 1, f 1 f 2, f 1 f 2, Xf 1, Gf 1, Ff 1, f 1 Uf 2 where f 1,f 2 are path formulas CTL*  set of all state formulas 16
17 Semantics of CTL* The truth value of CTL* formula f is determined with respect to A Kripke structure M = (S, R, L), and A state s S, if f is a state formula A path, if f is a path formula 17
18 Semantics of CTL* 18
19 Semantics of CTL* 19
20 Semantics of CTL* 20
21 Semantics of CTL* 21
22 Semantics of CTL* 22
23 Semantics of CTL* 23
24 Semantics of CTL* 24
25 Semantics of Path Formulas If p,q are state formulas then: Xp Gp Fp puq But in the general case, they can be path formulas 25
26 Semantics of CTL* 26
27 LTL/CTL/CTL* LTL state formulas of the form A  path formula, contains no path quantifiers interpreted over infinite computation paths CTL state formulas where path quantifiers and temporal operators appear in pairs: AG, AU, AF, AX, EG, EU, EF, EX interpreted over infinite computation trees CTL*  Allows any combination of temporal operators and path quantifiers. Includes both LTL and CTL 27
28 State formulas: LTL Af where f is a path formula Path formulas: p AP f 1, f 1 f 2, f 1 f 2, Xf 1, Gf 1, Ff 1, f 1 Uf 2 where f 1,f 2 are path formulas LTL  set of all state formulas 28
29 CTL CTL  set of all state formulas p AP g 1, g 1 g 2, g 1 g 2 AG g 1, A g 1 U g 2, AF g 1, AX g 1, EG g 1, E g 1 U g 2, EF g 1, EX g 1 where g 1,g 2 are state formulas 29
30 Semantics of CTL Recall: path =s 0,s 1, M,s p p L(s) for p AP M,s 1 2 M,s 1 or M,s 2 M,s EX there is s s.t. R(s,s ) and M,s M,s EG there is a path from s, s.t. for every i 0, M,s i 30
31 Semantics of CTL M,s E[ 1 U 2 ] there is a path from s and there is k 0 s.t. M,s k 2 and for every k>i 0, M,s i 1 M,s AG for every path from s and for every i 0, M,s i M,s AF for every path from s there exists i 0 s.t. M,s i 31
32 Examples (LTL) AG (start ready) AG (req F ack) A GF enbled A FG deadlock A (GF enbled GF running) Cannot express existential properties: from any state the system can 32
33 Examples (CTL) EF (start ready) AG (req AF ack) AG (AF enbled) AF (AG deadlock) AG (EF restart) AG (non_critical EX tryring) AG (try A[try U succeed]) 33
34 Illustration of CTL Semantics EFp : AFp : exists reachable state s.t. EGp : AGp : all reachable states. 34
35 Property types Universal Existential Safety AGp EGp Liveness AFp EFp 35
36 Examples 36
37 Equivalence 37
38 Expressiveness,, X, U, E suffice to express all CTL*: Ff true U f Gf F ( f) Af E ( f) EG f E F ( f) E [true U ( f)] In CTL: EX, EG, EU are sufficient A [puq] ( EG q) E[ q U ( p q)] 38
39 LTL vs. CTL A (FG p) has no equivalent in CTL in all paths, p globally holds from some point on Failed attempts: AFAGP : in every path there is a point from which all reachable states satisfy p. s 0 p s 1 s 2 p  s 0,s 0,s 0,  s 0,s 0, s 0,s 1,s 2,s 2,s 2 All paths satisfy FGp But first one does not sat FAGp 39
40 LTL vs. CTL A (FG p) has no equivalent in CTL in all paths, p globally holds from some point on What about AFEGP? in every path there is a point from which there is a path where p globally holds s 0 s All paths satisfy FEGp 1 p  since s 1 sat EGp But s 0,s 1,s 0,s 1,s 0,s 1 does not sat FGp 40
41 LTL vs. CTL AG (EFp) has no equivalent in LTL all reachable states can reach p Failed attempt: AGFp : in all paths, p holds infinitely many times. s 0 s 1 All reachable states (s 0, s 1 ) satisfy EFp p But s 0,s 0,s 0, does not satisfy GFp 41
42 LTL and CTL vs. CTL* E (GFp) has no equivalent in LTL or CTL 42
Model Checking II Temporal Logic Model Checking
1/32 Model Checking II Temporal Logic Model Checking Edmund M Clarke, Jr School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 2/32 Temporal Logic Model Checking Specification Language:
More informationModel Checking: An Introduction
Announcements Model Checking: An Introduction Meeting 2 Office hours M 1:30pm2:30pm W 5:30pm6:30pm (after class) and by appointment ECOT 621 Moodle problems? Fundamentals of Programming Languages CSCI
More informationlogic language, static/dynamic models SAT solvers Verified Software Systems 1 How can we model check of a program or system?
5. LTL, CTL Last part: Alloy logic language, static/dynamic models SAT solvers Today: Temporal Logic (LTL, CTL) Verified Software Systems 1 Overview How can we model check of a program or system? Modeling
More informationTemporal Logics. Computation Tree Logic
Temporal Logics CTL: definition, relationship between operators, adequate sets, specifying properties, safety/liveness/fairness Modeling: sequential, concurrent systems; maximum parallelism/interleaving
More informationAlgorithmic Software Verification
Algorithmic Software Verification (LTL Model Checking) Azadeh Farzan What is Verification Anyway? Proving (in a formal way) that program satisfies a specification written in a logical language. Formal
More informationFormal Verification and Lineartime Model Checking
Formal Verification and Lineartime Model Checking Paul Jackson University of Edinburgh Automated Reasoning 21st and 24th October 2013 Why Automated Reasoning? Intellectually stimulating and challenging
More informationSoftware Model Checking: Theory and Practice
Software Model Checking: Theory and Practice Lecture: Secification Checking  Temoral Logic Coyright 2004, Matt Dwyer, John Hatcliff, and Robby. The syllabus and all lectures for this course are coyrighted
More informationFormal Verification by Model Checking
Formal Verification by Model Checking Natasha Sharygina Carnegie Mellon University Guest Lectures at the Analysis of Software Artifacts Class, Spring 2005 1 Outline Lecture 1: Overview of Model Checking
More informationFormal Verification of Software
Formal Verification of Software Sabine Broda Department of Computer Science/FCUP 12 de Novembro de 2014 Sabine Broda (DCCFCUP) Formal Verification of Software 12 de Novembro de 2014 1 / 26 Formal Verification
More informationDevelopment of dynamically evolving and selfadaptive software. 1. Background
Development of dynamically evolving and selfadaptive software 1. Background LASER 2013 Isola d Elba, September 2013 Carlo Ghezzi Politecnico di Milano DeepSE Group @ DEIB 1 Requirements Functional requirements
More informationhttp://aejm.ca Journal of Mathematics http://rema.ca Volume 1, Number 1, Summer 2006 pp. 69 86
Atlantic Electronic http://aejm.ca Journal of Mathematics http://rema.ca Volume 1, Number 1, Summer 2006 pp. 69 86 AUTOMATED RECOGNITION OF STUTTER INVARIANCE OF LTL FORMULAS Jeffrey Dallien 1 and Wendy
More informationSoftware Modeling and Verification
Software Modeling and Verification Alessandro Aldini DiSBeF  Sezione STI University of Urbino Carlo Bo Italy 34 February 2015 Algorithmic verification Correctness problem Is the software/hardware system
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN02015 HUT, Finland
More informationSoftware Verification and Testing. Lecture Notes: Temporal Logics
Software Verification and Testing Lecture Notes: Temporal Logics Motivation traditional programs (whether terminating or nonterminating) can be modelled as relations are analysed wrt their input/output
More informationAutomatabased Verification  I
CS3172: Advanced Algorithms Automatabased Verification  I Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2006 Supporting and Background Material Copies of key slides (already
More informationCISC422/853: Formal Methods
Outline CISC422/853: Formal Methods in Software Engineering: ComputerAided Verification Topic 7: Specifying, or How to Describe How the System Should (or Should Not) Behave Juergen Dingel Feb, 2009 Readings:
More informationA Logic Approach for LTL System Modification
A Logic Approach for LTL System Modification Yulin Ding and Yan Zhang School of Computing & Information Technology University of Western Sydney Kingswood, N.S.W. 1797, Australia email: {yding,yan}@cit.uws.edu.au
More informationFundamentals of Software Engineering
Fundamentals of Software Engineering Model Checking with Temporal Logic Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard Bubel, Reiner
More informationSoftware Engineering using Formal Methods
Software Engineering using Formal Methods Model Checking with Temporal Logic Wolfgang Ahrendt 24th September 2013 SEFM: Model Checking with Temporal Logic /GU 130924 1 / 33 Model Checking with Spin model
More informationT79.186 Reactive Systems: Introduction and Finite State Automata
T79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 11 Reactive Systems Reactive systems are a class of software
More informationA computational model for MapReduce job flow
A computational model for MapReduce job flow Tommaso Di Noia, Marina Mongiello, Eugenio Di Sciascio Dipartimento di Ingegneria Elettrica e Dell informazione Politecnico di Bari Via E. Orabona, 4 70125
More informationLTL Model Checking with Logic Based Petri Nets
LTL Model Checking with Logic Based Petri Nets Tristan M. Behrens and Jürgen Dix IfI Technical Report Series IfI0704 Impressum Publisher: Institut für Informatik, Technische Universität Clausthal JuliusAlbert
More information2 Temporal Logic Model Checking
Bounded Model Checking Using Satisfiability Solving Edmund Clarke 1, Armin Biere 2, Richard Raimi 3, and Yunshan Zhu 4 1 Computer Science Department, CMU, 5000 Forbes Avenue Pittsburgh, PA 15213, USA,
More informationAutomated Route Planning for MilkRun Transport Logistics with the NuSMV Model Checker
IEICE TRANS. INF. & SYST., VOL.E96 D, NO.12 DECEMBER 2013 2555 PAPER Special Section on Parallel and Distributed Computing and Networking Automated Route Planning for MilkRun Transport Logistics with
More informationSchedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
More informationModel checking test models. Author: Kevin de Berk Supervisors: Prof. dr. Wan Fokkink, dr. ir. Machiel van der Bijl
Model checking test models Author: Kevin de Berk Supervisors: Prof. dr. Wan Fokkink, dr. ir. Machiel van der Bijl February 14, 2014 Abstract This thesis is about model checking testing models. These testing
More informationSanity Checks in Formal Verification
Sanity Checks in Formal Verification Orna Kupferman Hebrew University, School of Engineering and Computer Science, Jerusalem 91904, Israel Email:orna@cs.huji.ac.il, URL: http://www.cs.huji.ac.il/ orna
More informationFormal Verification of Computer Systems  (INFOF412)
Formal Verification of Computer Systems  (INFOF412) Thierry Massart Université Libre de Bruxelles Département d Informatique February 2013 Acknowledgment I want to thank Edmund Clarke, Keijo Heljanko,
More informationChecking. E. M. Clarke O. Grumberg K. L. McMillan X. Zhao
Ecient Generation of Counterexamples and Witnesses in Symbolic Model Checking E. M. Clarke O. Grumberg K. L. McMillan X. Zhao School of Computer Science Computer Science Dept. Cadence Berkeley Labs. School
More informationCounterexampleguided Design of Propertybased Dynamic Software Updates
Counterexampleguided Design of Propertybased Dynamic Software Updates Min Zhang 20141015 Min Zhang (JAIST) Counterexampleguided Design of Propertybased Dynamic Software Updates 20141015 [1/45] Contents
More informationSoftware safety  DEFSTAN 0055
Software safety  DEFSTAN 0055 Where safety is dependent on the safety related software (SRS) fully meeting its requirements, demonstrating safety is equivalent to demonstrating correctness with respect
More informationValidated Templates for Specification of Complex LTL Formulas
Validated Templates for Specification of Complex LTL Formulas Salamah Salamah Department of Electrical, computer, Software, and Systems Engineering Embry Riddle Aeronautical University 600 S. Clyde Morris
More informationFrom Workflow Design Patterns to Logical Specifications
AUTOMATYKA/ AUTOMATICS 2013 Vol. 17 No. 1 http://dx.doi.org/10.7494/automat.2013.17.1.59 Rados³aw Klimek* From Workflow Design Patterns to Logical Specifications 1. Introduction Formal methods in software
More informationBusiness Process Verification: The Application of Model Checking and Timed Automata
Business Process Verification: The Application of Model Checking and Timed Automata Luis E. Mendoza Morales Processes and Systems Department, Simón Bolívar University, P.O. box 89000, Baruta, Venezuela,
More informationThe Model Checker SPIN
The Model Checker SPIN Author: Gerard J. Holzmann Presented By: Maulik Patel Outline Introduction Structure Foundation Algorithms Memory management Example/Demo SPINIntroduction Introduction SPIN (Simple(
More informationFormal Specification and Verification
Formal Specification and Verification Stefan Ratschan Katedra číslicového návrhu Fakulta informačních technologíı České vysoké učení technické v Praze 2. 5. 2011 Stefan Ratschan (FIT ČVUT) PIPSC 4 2.
More informationFormal Verification Problems in a Bigdata World: Towards a Mighty Synergy
Dept. of Computer Science Formal Verification Problems in a Bigdata World: Towards a Mighty Synergy Matteo Camilli matteo.camilli@unimi.it http://camilli.di.unimi.it ICSE 2014 Hyderabad, India June 3,
More informationStatic Program Transformations for Efficient Software Model Checking
Static Program Transformations for Efficient Software Model Checking Shobha Vasudevan Jacob Abraham The University of Texas at Austin Dependable Systems Large and complex systems Software faults are major
More informationModel Checking for Software
Model Checking for Software Charles Pecheur UC Louvain Charles.Pecheur@uclouvain.be Credits Based on: 2000 Model Checking for Software Willem Visser Charles Pecheur RIACS / NASA Ames {wvisser,pecheur}@ptolemy.arc.nasa.gov
More informationtutorial: hardware and software model checking
tutorial: hardware and software model checking gerard holzmann and anuj puri { gerard anuj } @research.belllabs.com Bell Labs, USA outline introduction (15 mins) theory and algorithms system modeling
More informationModel Checking of Software
Model Checking of Software Patrice Godefroid Bell Laboratories, Lucent Technologies SpecNCheck Page 1 August 2001 A Brief History of Model Checking Prehistory: transformational programs and theorem proving
More informationOn the Modeling and Verification of SecurityAware and ProcessAware Information Systems
On the Modeling and Verification of SecurityAware and ProcessAware Information Systems 29 August 2011 What are workflows to us? Plans or schedules that map users or resources to tasks Such mappings may
More informationToday s Agenda. Automata and Logic. Quiz 4 Temporal Logic. Introduction Buchi Automata Linear Time Logic Summary
Today s Agenda Quiz 4 Temporal Logic Formal Methods in Software Engineering 1 Automata and Logic Introduction Buchi Automata Linear Time Logic Summary Formal Methods in Software Engineering 2 1 Buchi Automata
More informationBounded LTL Model Checking with Stable Models
Under consideration for publication in Theory and Practice of Logic Programming 1 Bounded LTL Model Checking with Stable Models KEIJO HELJANKO and ILKKA NIEMELÄ Helsinki University of Technology Department
More informationAn AutomataTheoretic Approach to Linear Temporal Logic
An AutomataTheoretic Approach to Linear Temporal Logic Moshe Y. Vardi? Rice University Department of Computer Science P.O. Box 1892 Houston, TX 772511892, U.S.A. Email: vardi@cs.rice.edu URL: http://www.cs.rice.edu/
More informationUsing Patterns and Composite Propositions to Automate the Generation of Complex LTL
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 812007 Using Patterns and Composite Propositions to Automate the Generation of Complex
More informationFixedPoint Logics and Computation
1 FixedPoint Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of
More informationModel Checking LTL Properties over C Programs with Bounded Traces
Noname manuscript No. (will be inserted by the editor) Model Checking LTL Properties over C Programs with Bounded Traces Jeremy Morse 1, Lucas Cordeiro 2, Denis Nicole 1, Bernd Fischer 1,3 1 Electronics
More informationProgram Synthesis is a Game
Program Synthesis is a Game Barbara Jobstmann CNRS/Verimag, Grenoble, France Outline Synthesis using automata based game theory. MoBvaBon, comparison with MC and LTL. Basics Terminology Reachability/Safety
More informationPath Querying on Graph Databases
Path Querying on Graph Databases Jelle Hellings Hasselt University and transnational University of Limburg 1/38 Overview Graph Databases Motivation Walk Logic Relations with FO and MSO Relations with CTL
More informationFeature Specification and Automated Conflict Detection
Feature Specification and Automated Conflict Detection AMY P. FELTY University of Ottawa and KEDAR S. NAMJOSHI Bell Laboratories Large software systems, especially in the telecommunications field, are
More informationResearch Article Towards Support for Software Model Checking: Improving the Efficiency of Formal Specifications
Advances in Software Engineering Volume 2011, Article ID 869182, 13 pages doi:10.1155/2011/869182 Research Article Towards Support for Software Model Checking: Improving the Efficiency of Formal Specifications
More informationSemantics and Verification of Software
Semantics and Verification of Software Lecture 21: Nondeterminism and Parallelism IV (Equivalence of CCS Processes & WrapUp) Thomas Noll Lehrstuhl für Informatik 2 (Software Modeling and Verification)
More informationDTIC. ADA270 552 / D I. 9 3 1 0 8 1 b 9324002. Model Checking, Abstraction, and Compositional Verification ELECTE M S3 OCT 141993 D A. David E.
ADA270 552 / Model Checking, Abstraction, and Compositional Verification David E. Long July 1993 CMUCS93178 DTIC. D I ELECTE M S3 OCT 141993 D A School of Computer Science Carnegie Mellon University
More informationTemporal property verification as a program analysis task
Temporal property verification as a program analysis task Byron Cook 1, Eric Koskinen 2, and Moshe Vardi 3 1 Microsoft Research and Queen Mary University of London 2 University of Cambridge 3 Rice University
More informationAutomataBased Verification of Temporal Properties on Running Programs Dimitra Giannakopoulou Klaus Havelund
AutomataBased Verification of Temporal Properties on Running Programs Dimitra Giannakopoulou Klaus Havelund RIACS Technical Report 01.21 August 2001 Presented at the 16 th IEEE International Conference
More informationIntroduction to SPIN. Acknowledgments. Parts of the slides are based on an earlier lecture by Radu Iosif, Verimag. Ralf Huuck. Features PROMELA/SPIN
Acknowledgments Introduction to SPIN Parts of the slides are based on an earlier lecture by Radu Iosif, Verimag. Ralf Huuck Ralf Huuck COMP 4152 1 Ralf Huuck COMP 4152 2 PROMELA/SPIN PROMELA (PROcess MEta
More informationDoina Bucur. Temporal Monitors for
Doina Bucur / Temporal Monitors for 1 Application area: wireless sensor/actuator systems running TinyOS, a besteffort, asynchronous embedded OS In summary: 2 Application area: wireless sensor/actuator
More informationQuick Start Guide. June 3, 2012
The ERIGONE Model Checker Quick Start Guide Mordechai (Moti) BenAri Department of Science Teaching Weizmann Institute of Science Rehovot 76100 Israel http://stwww.weizmann.ac.il/gcs/benari/ June 3, 2012
More informationFabio Patrizi DIS Sapienza  University of Rome
Fabio Patrizi DIS Sapienza  University of Rome Overview Introduction to Services The Composition Problem Two frameworks for composition: Non dataaware services Dataaware services Conclusion & Research
More informationThe Common Fragment of ACTL and LTL
The Common Fragment of ACTL and LTL Miko laj Bojańczyk Warsaw University Abstract. The paper explores the relationship between tree languages definable in LTL, CTL, and ACTL, the fragment of CTL where
More informationA CTLBased Logic for Program Abstractions
A CTLBased Logic for Program Abstractions Martin Lange 1 and Markus Latte 2 1 Dept. of Computer Science, University of Kassel, Germany 2 Dept. of Computer Science, LudwigMaximiliansUniversity Munich,
More informationProgram Transformation and Its Applications to Software Synthesis and Verification
Program Transformation and Its Applications to Software Synthesis and Verification Maurizio Proietti Joint work with: Fabio Fioravanti (Univ. D'Annunzio, Pescara, Italy), Alberto Pettorossi (Univ. Tor
More informationTO APPEAR IN: IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 1. Proactive Detection of Computer Worms Using Model Checking
TO APPEAR IN: IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 1 Proactive Detection of Computer Worms Using Model Checking Johannes Kinder, Stefan Katzenbeisser, Member, IEEE, Christian Schallhart,
More informationAUTOMATIC PROTOCOL CREATION FOR INFORMATION SECURITY SYSTEM
AUTOMATIC PROTOCOL CREATION FOR INFORMATION SECURITY SYSTEM Mr. Arjun Kumar arjunsingh@abes.ac.in ABES Engineering College, Ghaziabad Master of Computer Application ABSTRACT Now a days, security is very
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationModular Verification of Dynamically Adaptive Systems
Modular Verification of Dynamically Adaptive Systems Ji Zhang, Heather J. Goldsby, and Betty H.C. Cheng Department of Computer Science and Engineering, Michigan State University East Lansing, Michigan,
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationEnhancing ABC for LTL Stabilization Verification of SystemVerilog/VHDL Models
1 Enhancing ABC for LTL Stabilization Verification of SystemVerilog/VHDL Models Jiang Long, Sayak Ray, Baruch Sterin, Alan Mishchenko, Robert Brayton Berkeley Verification and Synthesis Research Center
More information7. SATBased ModelChecking Fachgebiet Rechnersysteme1
7. SATBased ModelChecking Fachgebiet Rechnersysteme 7. SATBased ModelChecking 7. SATBased ModelChecking 3 Content Temporal property 7. Bounded ModelChecking (BMC) (IPC) Sequential circuit Model
More informationSimulative Model Checking of Steady State and TimeUnbounded Temporal Operators
Simulative Model Checking of Steady State and TimeUnbounded Temporal Operators Christian Rohr Department of Computer Science Brandenburg University of Technology Cottbus June 25, 2012 Outline 1 Introduction
More informationRigorous Software Development CSCIGA 3033009
Rigorous Software Development CSCIGA 3033009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationTest Case Generation for Ultimately Periodic Paths Joint work with Saddek Bensalem Hongyang Qu Stavros Tripakis Lenore Zuck Accepted to HVC 2007 How to find the condition to execute a path? (weakest precondition
More informationModeling and Formal Verification of Production Automation Systems
Modeling and Formal Verification of Production Automation Systems Jürgen Ruf, Roland J. Weiss, Thomas Kropf, and Wolfgang Rosenstiel WilhelmSchickardInstitut für Informatik, Universität Tübingen Sand
More informationFormal Verification Coverage: Computing the Coverage Gap between Temporal Specifications
Formal Verification Coverage: Computing the Coverage Gap between Temporal Specifications Sayantan Das Prasenjit Basu Ansuman Banerjee Pallab Dasgupta P.P. Chakrabarti Department of Computer Science & Engineering
More informationDigital Design Verification
Digital Design Verification Course Instructor: Debdeep Mukhopadhyay Dept of Computer Sc. and Engg. Indian Institute of Technology Madras, Even Semester Course No: CS 676 1 Verification??? What is meant
More informationOn the Formal Specification of Regulatory Compliance: A Comparative Analysis
On the Formal Specification of Regulatory Compliance: A Comparative Analysis Amal Elgammal 1, Oktay Turetken, WillemJan van den Heuvel, Mike Papazoglou European Research Institute in Service Science (ERISS),
More informationSlides based in part on previous lectures by Mahesh Vishwanathan, and by Gul Agha January 21, 2014 1
Contact Information CS477 Formal Software Development Methods Elsa L Gunter 2112 SC, UIUC egunter@illinois.edu http://courses.engr.illinois.edu/cs477 Office: 2112 SC Office Hours: Wednesdays 11:00am 
More informationProperty Relevant Software Testing with ModelCheckers
Property Relevant Software Testing with ModelCheckers Gordon Fraser and Franz Wotawa Institute for Software Technology Graz University of Technology Inffeldgasse 16b/2 A8010 Graz, Austria {fraser,wotawa}@ist.tugraz.at
More informationFormal verification of contracts for synchronous software components using NuSMV
Formal verification of contracts for synchronous software components using NuSMV Tobias Polzer Lehrstuhl für Informatik 8 Bachelorarbeit 13.05.2014 1 / 19 Problem description and goals Problem description
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of firstorder logic will use the following symbols: variables connectives (,,,,
More informationMODEL CHECKING OF SERVICES WORKFLOW RECONFIGURATION: A PERSPECTIVE ON DEPENDABILITY
MODEL CHECKING OF SERVICES WORKFLOW RECONFIGURATION: A PERSPECTIVE ON DEPENDABILITY 1 Juan Carlos Polanco Aguilar 1 Koji Hasebe 1 Manuel Mazzara 2 Kazuhiko Kato 1 1 University of Tsukuba Department of
More informationHECTOR a software model checker with cooperating analysis plugins. Nathaniel Charlton and Michael Huth Imperial College London
HECTOR a software model checker with cooperating analysis plugins Nathaniel Charlton and Michael Huth Imperial College London Introduction HECTOR targets imperative heapmanipulating programs uses abstraction
More informationTechnical Report. Identifying meaningless parameterized lineartemporallogic. Nr. TUDCS20120014 January 17 th, 2012
Technical Report Nr. TUDCS20120014 January 17 th, 2012 Identifying meaningless parameterized lineartemporallogic formulas Authors Eric Bodden (EC SPRIDE, CASED) Identifying meaningless parameterized
More informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15cs510se
More informationSOFTWARE VERIFICATION RESEARCH CENTRE SCHOOL OF INFORMATION TECHNOLOGY THE UNIVERSITY OF QUEENSLAND. Queensland 4072 Australia TECHNICAL REPORT
SOFTWARE VERIFICATION RESEARCH CENTRE SCHOOL OF INFORMATION TECHNOLOGY THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia TECHNICAL REPORT No. 0116 Model Checking with Abstract Types Kirsten Winter
More informationBisimulation and Logical Preservation for ContinuousTime Markov Decision Processes
Bisimulation and Logical Preservation for ContinuousTime Markov Decision Processes Martin R. Neuhäußer 1,2 JoostPieter Katoen 1,2 1 RWTH Aachen University, Germany 2 University of Twente, The Netherlands
More informationAachen. Model Checking of Software for Microcontrollers. Department of Computer Science. Technical Report. Bastian Schlich
Aachen Department of Computer Science Technical Report Model Checking of Software for Microcontrollers Bastian Schlich ISSN 0935 3232 Aachener Informatik Berichte AIB200814 RWTH Aachen Department of
More informationWeek 5: Binary Relations
1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationModel Checking Distributed Software
Model Checking Distributed Software Sagar Chaki September 19, 2014 Software Engineering Institute Carnegie Mellon University Pittsburgh, PA 15213 Model Checking and Me 1997 : Ed visits IIT Kharagpur Just
More informationDevelopment of global specification for dynamically adaptive software
Development of global specification for dynamically adaptive software Yongwang Zhao School of Computer Science & Engineering Beihang University zhaoyw@act.buaa.edu.cn 22/02/2013 1 2 About me Assistant
More informationAutomataBased Verification of Temporal Properties on Running Programs
AutomataBased Verification of Temporal Properties on Running Programs Dimitra Giannakopoulou (RIACS) and Klaus Havelund (Kestrel Technologies) Automated Software Engineering Group NASA Ames Research Center,
More informationVeriTech  A Framework for Translating among Model Description Notations
Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) VeriTech  A Framework for Translating among Model Description Notations Orna Grumberg and Shmuel Katz Computer Science
More informationSoftware Reliability: Runtime Verification
Software Reliability: Runtime Verification Martin Leucker and the whole ISP team Institute for Software Engineering Universität zu Lübeck Riga, 21.07. 04.08.14 Martin Leucker Basoti, 2014 1/117 Runtime
More informationintroduction to program monitoring
introduction to program monitoring CS 119 part II beyond assert and print course website http://www.runtimeverification.org/course09 action standing order: sell when price drops more than 2% within 1
More informationSynchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic 5 Outline! Sequential Circuits! Latches! FlipFlops! Analysis of Clocked Sequential Circuits! State Reduction and Assignment! Design Procedure 52 Sequential Circuits!
More informationA traditional treestyle tableau for LTL: LONG VERSION
A traditional treestyle tableau for LTL: LONG VERSION arxiv:1604.03962v1 [cs.lo] 13 Apr 2016 Mark Reynolds, The University of Western Australia. mark.reynolds@uwa.edu.au April 15, 2016 Abstract Propositional
More informationDecidable Fragments of FirstOrder and FixedPoint Logic
From prefixvocabulary classes to guarded logics graedel@rwthaachen.de. Aachen University The classical decision problem part of Hilbert s formalist programme for the foundations of mathematics in modern
More informationInstitut für Parallele und Verteilte Systeme. Abteilung Anwendersoftware. Universität Stuttgart Universitätsstraße 38 D70569 Stuttgart
Institut für Parallele und Verteilte Systeme Abteilung Anwendersoftware Universität Stuttgart Universitätsstraße 38 D70569 Stuttgart Diplomarbeit Nr. 3243 Development and Evaluation of a Framework for
More informationSafety verification of software using structured Petri nets
Safety verification of software using structured Petri nets Krzysztof Sacha Warsaw University of Technology, Institute of Control and Computation Engineering, ul. Nowowiejska 15/19, 00665 Warszawa, Poland
More information