1 / 1

Matching Logic Grigore Rosu and Andrei Stefanescu (UIUC)

Matching Logic Grigore Rosu and Andrei Stefanescu (UIUC). Examples of Patterns. x points to sequence A, and the reversed sequence A has been output untrusted( ) can only be called from trusted() Read/Write datarace (simplified). Program Verification with M atchC. Formal Semantics.

melodie-owens
Télécharger la présentation

Matching Logic Grigore Rosu and Andrei Stefanescu (UIUC)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Matching Logic GrigoreRosu and Andrei Stefanescu (UIUC) Examples of Patterns • x points to sequence A, and the reversed sequence A has been output • untrusted()can only be called from trusted() • Read/Write datarace (simplified) Program Verification with MatchC Formal Semantics Highlights Flattening a tree into a list Using standard I/O Matching Logic = Operational Semantics + FOL • A logic for reasoning about configurations • Formulae • FOL over configurations, called patterns • Configurations are allowed to contain variables • Models • Ground configurations • Satisfaction • Matching for configurations, plus FOL for the rest List manipulating functions Stack inspection Partial Correctness • We have two rewrite relations on configurations  given by the language operational semantics; safe  given by specifications; unsafe, has to be proved • Idea (simplified for deterministic languages): • Pick left  right. Show that always left  (  )* right modulo matching logic reasoning (between rewrite steps) • Theorem (soundness): • If left  right and “configmatchesleft” such that config has a normal form for , then “nf(config)matchesright”

More Related