'Separation logic' diaporamas de présentation

September 2019

The K Approach a nd Vision. Grigore Rosu Professor of CS, University of Illinois at Urbana President & CEO, Runtime Verification Inc. September 2019. Goals. Make K the best ever design, implementation and formal reasoning framework for programming languages!

1.33k views • 100 slides

An Algebra for Program Designs

1.06k views • 93 slides

Oracle Semantics

894 views • 80 slides

Oracle Semantics

804 views • 80 slides

Separation Logic and Concurrency Verification

887 views • 76 slides

Adjunct Elimination in Context Logic for Trees

Adjunct Elimination in Context Logic for Trees. Cristiano Calcagno Thomas Dinsdale-Young Philippa Gardner Imperial College, London. Context Logic. Ambient Logic (Cardelli, Gordon) is a logic for reasoning about static properties of node-labelled, unranked trees (e.g. Firewalls, XML data)

830 views • 67 slides

Modular Verification via Separation Logic

765 views • 58 slides

Introduction to Separation Logic

Introduction to Separation Logic. presented by Greta Yorsh April 02, 2008 IBM , Hawthorne. This Talk. What is Separation Logic? Strengths and weaknesses Successful applications Main challenges. What is Separation Logic?. Extension of Hoare logic low-level imperative programs

773 views • 51 slides

Certified Concurrent Code with Interrupts

598 views • 48 slides

SAT-based methods for proving properties in Reynolds/O'Hearn Separation Logic

SAT-based methods for proving properties in Reynolds/O'Hearn Separation Logic. Daniel Kröning (currently visiting CBL) Joint work with B. Cook and J. Berdine. Program Verification. Goal: Editor that highlights programming errors Not syntax, but semantics. Like what?. Verification Engines.

524 views • 38 slides

Local Reasoning

470 views • 37 slides

Usable Formal Methods

541 views • 35 slides

A Hybrid SAT-based Decision Procedure for Separation Logic with Uninterpreted Functions

A Hybrid SAT-based Decision Procedure for Separation Logic with Uninterpreted Functions. Sanjit A. Seshia Joint work with Shuvendu K. Lahiri & Randal E. Bryant Carnegie Mellon University, USA June 2003. OK. Verification. Error. Formula.

476 views • 30 slides

Carnegie Mellon University

SAT-Based Decision Procedures for Subsets of First-Order Logic. Part II: Separation Logic. Randal E. Bryant. Carnegie Mellon University. http://www.cs.cmu.edu/~bryant. Outline. Background SAT-based Decision Procedures Equality with Uninterpreted Functions

295 views • 29 slides

Introduction to Our Research on Certifying Compiler

Introduction to Our Research on Certifying Compiler. Zhaopeng Li (In Chinese: ??? ) Email: zpli@mail.ustc.edu.cn Certifying Compiler Group USTC-Yale Joint Research Center September 4, 2009. Outline. Motivation. Previous Work. On-going Work. Demonstration. Goal of Our Center.

232 views • 15 slides

????

219 views • 8 slides