automating formal proofs for reactive systems
play

Automating Formal Proofs for Reactive Systems Daniel Ricketts , - PowerPoint PPT Presentation

Feb 15, 2024 •279 likes •1.93k views

Automating Formal Proofs for Reactive Systems Daniel Ricketts , Valentin Robert, Zachary Danger Tatlock Dongseok Jang, Sorin Lerner University of California, San Diego University of Washington Proof Assistant Based Verification Proof

  1. Properties Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  2. Properties Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ... Specify allowed behaviors

  3. Properties Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ... Specify allowed behaviors wrt sequence of system calls

  4. Properties Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ... Specify allowed behaviors wrt sequence of system calls

  5. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls

  6. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time

  7. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time …

  8. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time The system calls so far …

  9. Properties When [Tab t] sends CookieSet(c): [Tab t] sends CookieSet(c) cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time The system calls so far …

  10. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time The system calls so far …

  11. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time The system Recv(Tab, CookieSet(c)) calls so far …

  12. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time The system Recv(Tab, CookieSet(c)) calls so far …

  13. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Time The system Recv(Tab, CookieSet(c)) calls so far …

  14. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Spawn CookieMgr(t.domain) Time The system Recv(Tab, CookieSet(c)) calls so far …

  15. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Spawn CookieMgr(t.domain) Time The system Recv(Tab, CookieSet(c)) calls so far …

  16. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Spawn CookieMgr(t.domain) Time The system Recv(Tab, CookieSet(c)) calls so far …

  17. Properties When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) Specify allowed behaviors wrt sequence of system calls Send(cp, CookieSet(c)) Spawn CookieMgr(t.domain) Time The system Recv(Tab, CookieSet(c)) calls so far …

  18. Example: Web browser kernel Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  19. Example: Web browser kernel Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  20. Example: Web browser kernel Specify cookie integrity Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  21. Example: Web browser kernel Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  22. Example: Web browser kernel forall d c, For any domain d and cookie c Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  23. Example: Web browser kernel The kernel sends the cookie forall d c, manager for domain d a cookie c [Send(CookieMgr(d), CookieSet(c))] Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  24. Example: Web browser kernel forall d c, Only if Enables [Send(CookieMgr(d), CookieSet(c))] Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  25. Example: Web browser kernel forall d c, [Recv(Tab(d), CookieSet(c))] Enables [Send(CookieMgr(d), CookieSet(c))] Components = Tab | CookieMgr | ... The kernel already received a Messages = CookieSet | CookieGet | ... cookie c from a tab of domain d Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  26. Example: Web browser kernel forall d c, [Recv(Tab(d), CookieSet(c))] Enables [Send(CookieMgr(d), CookieSet(c))] Components = Tab | CookieMgr | ... A Enables B Messages = CookieSet | CookieGet | ... iff every sys call B is preceded by sys call A Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  27. Example: Web browser kernel forall d c, [Recv(Tab(d), CookieSet(c))] Enables [Send(CookieMgr(d), CookieSet(c))] Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

  28. Example: Web browser kernel forall d c, [Recv(Tab(d), CookieSet(c))] Enables [Send(CookieMgr(d), CookieSet(c))] Components = Tab | CookieMgr | ... Messages = CookieSet | CookieGet | ... Handlers: When [Tab t] sends CookieSet(c): cp <- find CookieMgr(t.domain) send(cp, CookieSet(c)) When [Tab t] sends CookieGet(c): ...

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

On the Horizontal Dimension of Software Architecture in Formal Specifications of Reactive

On the Horizontal Dimension of Software Architecture in Formal Specifications of Reactive

On the Horizontal Dimension of Software Architecture in Formal Specifications of Reactive Systems Mika Katara, Reino Kurki-Suonio and Tommi Mikkonen Institute of Software Systems Tampere University of Technology Finland Outline 1.

1.03k views • 21 slides
Formal proofs, variable binding, and program extraction from proofs Colloquium Logicum 2016 (10

Formal proofs, variable binding, and program extraction from proofs Colloquium Logicum 2016 (10

Formal proofs, variable binding, and program extraction from proofs Colloquium Logicum 2016 (10 - 12 September 2016, Hamburg) Gyesik Lee Hankyong National University 1 Overview 1. Verification of proofs 2. Hales proof of the Kepler

651 views • 43 slides
Flexiformality in Proofs: Bridging between Formal and Informal Proofs Michael Kohlhase Professur

Flexiformality in Proofs: Bridging between Formal and Informal Proofs Michael Kohlhase Professur

Flexiformality in Proofs: Bridging between Formal and Informal Proofs Michael Kohlhase Professur fr Wissensreprsentation und -verarbeitung Informatik, FAU Erlangen-Nrnberg http://kwarc.info 20. October 2016, Dagstuhl Seminar on

568 views • 39 slides
03aInductive Definitions CS 3234: Logic and Formal Systems Martin Henz and Aquinas Hobor

03aInductive Definitions CS 3234: Logic and Formal Systems Martin Henz and Aquinas Hobor

What are inductive definitions? Formal definitions Taking cases and proofs by induction Inductive definitions and proofs by induction in Coq Extensions to other structures &amp; summary 03aInductive Definitions CS 3234: Logic and Formal

678 views • 64 slides
Modelling, Specification and Verification of Reactive Systems Introduction to the Course

Modelling, Specification and Verification of Reactive Systems Introduction to the Course

Organization of the Course Introduction Formal Models for Reactive Systems Modelling, Specification and Verification of Reactive Systems Introduction to the Course Lecturer: Luca Aceto Email: luca@ru.is or luca.aceto@gmail.com Course web

449 views • 25 slides
Diamond: Automating Data Management and Storage for Wide-area, Reactive Applications Irene

Diamond: Automating Data Management and Storage for Wide-area, Reactive Applications Irene

Diamond: Automating Data Management and Storage for Wide-area, Reactive Applications Irene Zhang Niel Lebeck Pedro Fonseca Brandon Holt Raymond Cheng Ariadna Norberg Arvind Krishnamurthy Henry M. Levy 1 Diamond:

1.21k views • 82 slides
Types of Formal Specifications for Assertions Concurrent and Reactive Systems Assertions

Types of Formal Specifications for Assertions Concurrent and Reactive Systems Assertions

Outline Formal specifications CISC422/853: Formal Methods Types of formal specifications: in Software Engineering: assertions invariants Computer-Aided Verification safety and liveness properties How to express safety

226 views • 22 slides
Correctness of Program Transformations: Automating Diagram-Based Proofs David Sabel

Correctness of Program Transformations: Automating Diagram-Based Proofs David Sabel

Correctness of Program Transformations: Automating Diagram-Based Proofs David Sabel Goethe-University Frankfurt am Main, Germany Research supported by the Deutsche Forschungsgemeinschaft (DFG) under grant SA 2908/3-1. Motivation reasoning

736 views • 72 slides
Welcome to PROOFS! PROOFS: Security Proofs for Embedded Systems Introduction to the fifth

Welcome to PROOFS! PROOFS: Security Proofs for Embedded Systems Introduction to the fifth

Welcome to PROOFS! PROOFS: Security Proofs for Embedded Systems Introduction to the fifth workshop Introduction to the workshop PROOFS: Security Proofs for Embedded Systems UCSB August 20, 2016 5th edition of PROOFS PROOFS 2012:

311 views • 7 slides
Automating elementary number-theoretic proofs using Gr obner bases John Harrison Intel

Automating elementary number-theoretic proofs using Gr obner bases John Harrison Intel

Automating elementary number-theoretic proofs using Gr obner bases John Harrison Intel Corporation CADE, Bremen Tue 17th July 2007 (12:0012:30) 0 Divisibility properties over the integers Often want to prove tedious lemmas like a n

750 views • 19 slides
Formal Verification and Testing for Formal Verification and Testing for Reactive Systems

Formal Verification and Testing for Formal Verification and Testing for Reactive Systems

ARTIST2 - ARTIST2 - MOTIVES MOTIVES Trento - - Italy, February 19 Italy, February 19- -23, 2007 23, 2007 Trento Session: Testing and Runtime Verification Formal Verification and Testing for Formal Verification and Testing for Reactive

881 views • 31 slides
Decision Procedures for Automating Termination Proofs Ruzica Piskac, EPFL Thomas Wies, IST

Decision Procedures for Automating Termination Proofs Ruzica Piskac, EPFL Thomas Wies, IST

Decision Procedures for Automating Termination Proofs Ruzica Piskac, EPFL Thomas Wies, IST Austria Proving Program Termination assum sume x &gt; 0 le x 0 do while do y := 1 while y &lt; x do do y := 2 y end x := x 1 end Ranking

489 views • 28 slides
Automating Asymptotics in a Theorem Prover Manuel Eberl Technical University of Munich Formal

Automating Asymptotics in a Theorem Prover Manuel Eberl Technical University of Munich Formal

Automating Asymptotics in a Theorem Prover Manuel Eberl Technical University of Munich Formal Methods in Mathematics 6 January 2020 1 / 31 My Christmas Project I found some lovely 5-pages of lecture notes on Transcendental Number Theory by

1.36k views • 122 slides
Formal Proofs for Global Optimization Templates and Sums of Squares Victor MAGRON

Formal Proofs for Global Optimization Templates and Sums of Squares Victor MAGRON

Introduction SOS Certificates Maxplus Approximation Nonlinear Templates Formal SOS Conclusion Formal Proofs for Global Optimization Templates and Sums of Squares Victor MAGRON INRIA-LIX/CMAP, cole Polytechnique 2013 December 9 th Victor

1.38k views • 113 slides
Programming Reactive Systems in Scala: Principles and Abstractions Philipp Haller KTH Royal

Programming Reactive Systems in Scala: Principles and Abstractions Philipp Haller KTH Royal

Programming Reactive Systems in Scala: Principles and Abstractions Philipp Haller KTH Royal Institute of Technology Stockholm, Sweden Entwicklertag Frankfurt, Germany, 21 February, 2018 What are reactive systems? Multiple definitions proposed

893 views • 54 slides
Biological Systems Hillel Kugler Faculty of Engineering, Bar-Ilan University, Israel FMCAD20

Biological Systems Hillel Kugler Faculty of Engineering, Bar-Ilan University, Israel FMCAD20

Formal Verification for Natural and Engineered Biological Systems Hillel Kugler Faculty of Engineering, Bar-Ilan University, Israel FMCAD20 21 September 2020 Formal Verification has proven useful in Reactive Systems Development

1.07k views • 96 slides
ReFlex: Remote Flash Local Flash Ana Klimovic Heiner Litz Christos Kozyrakis NVMW18

ReFlex: Remote Flash Local Flash Ana Klimovic Heiner Litz Christos Kozyrakis NVMW18

ReFlex: Remote Flash Local Flash Ana Klimovic Heiner Litz Christos Kozyrakis NVMW18 Memorable Paper Award Finalist 1 Flash in Datacenters Flash provides 1000 higher throughput and 100 lower latency than disk PCIe Flash:

444 views • 28 slides
Tree-based Methods Here we describe tree-based methods for regression and classification.

Tree-based Methods Here we describe tree-based methods for regression and classification.

Tree-based Methods Here we describe tree-based methods for regression and classification. These involve stratifying or segmenting the predictor space into a number of simple regions. Since the set of splitting rules used to segment the

785 views • 51 slides
What Kind of Benefits Are We Talking About? 2 Employee benefits under a benefit plan or statute,

What Kind of Benefits Are We Talking About? 2 Employee benefits under a benefit plan or statute,

E MPLOYEE B ENEFITS C LAIMS &amp; A PPEALS AIDS Legal Referral Panel March 14, 2019 MCLE Training Kirsten Scott Renaker Hasselman Scott LLP 235 Montgomery Street, Suite 944 San Francisco, CA 94104 415-653-1733 www.renakerhasselman.com

591 views • 12 slides
Bringing Resources Together Using a Person Centered Approach } An IRT is initiated on behalf of an

Bringing Resources Together Using a Person Centered Approach } An IRT is initiated on behalf of an

Bringing Resources Together Using a Person Centered Approach } An IRT is initiated on behalf of an individual with a disability who is experiencing multiple challenges to employment in order to address that one individuals specific needs. }

295 views • 14 slides
2014 Tift County Melon Update Intercropping Herbicide update Cantaloupe-Cotton Intercropping

2014 Tift County Melon Update Intercropping Herbicide update Cantaloupe-Cotton Intercropping

2014 Tift County Melon Update Intercropping Herbicide update Cantaloupe-Cotton Intercropping Cantaloupe Cotton Yield No reduction 0-12% reduction Crop value 17% increase &gt;1,000 increase Watermelon-Cotton Intercropping Watermelon

652 views • 37 slides
Using X-ray Clusters as Cosmological Probes Hans Bhringer Max-Planck-Institut fr

Using X-ray Clusters as Cosmological Probes Hans Bhringer Max-Planck-Institut fr

Using X-ray Clusters as Cosmological Probes Hans Bhringer Max-Planck-Institut fr extraterrestrische Physik (MPE) in collaboration with Gayoung Chon (MPE) Hans Bhringer ICM Conference, MPA

453 views • 23 slides
Clings Context, Status and Plans Prototype of ROOTs new Interpreter and Reflection

Clings Context, Status and Plans Prototype of ROOTs new Interpreter and Reflection

Clings Context, Status and Plans Prototype of ROOTs new Interpreter and Reflection Database Axel Naumann, 2011-03-14 Timetable 9:05 Motivation for cling 9:10 Context for a new interpreter 9:20 Status 9:25 Plans 2 Motivation 3

420 views • 27 slides
Rational Agents (Ch. 2) Rational agent Remember vacuum problem? Agent program: if [Dirty],

Rational Agents (Ch. 2) Rational agent Remember vacuum problem? Agent program: if [Dirty],

Rational Agents (Ch. 2) Rational agent Remember vacuum problem? Agent program: if [Dirty], return [Suck] if at [room A], return [move right] if at [room B], return [move left] Agent models Can also classify agents into four categories: 1.

505 views • 22 slides

More recommend