PPT-From Hoare Logic to Matching Logic Reachability

Author : sherrill-nordquist | Published Date : 2016-08-03

Grigore Rosu and Andrei Stefanescu University of Illinois USA Matching Logic Reachability Goal Language independent program verification framework Derives program

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "From Hoare Logic to Matching Logic Reach..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

From Hoare Logic to Matching Logic Reachability: Transcript

Grigore Rosu and Andrei Stefanescu University of Illinois USA Matching Logic Reachability Goal Language independent program verification framework Derives program properties based on the operational semantics of a language. Please do not alter or modify contents All rights reserved 1FQMFXIFFMMZVDDFGVMJNQMFNFUJHUIJLJMM hy does my child always have an attitude Shes often disruptive disrespectful or picking on other children Shes always the one with a chip on her shoulder Please do not alter or modify contents All rights reserved For more information call 8003384065 or visit wwwloveandlogiccom Love and Logic Institute Inc is located at 2207 Jackson Street Golden CO 80401 57513 1998 Jim Fay 57375e Delayed or Anticipat Please do not alter or modify contents All rights reserved QVSIBTFE 1BJOMTT1BSOUJOHSUI1STDIMBST BDLTPU PMEF XXXMPWF E MPHDDPN 57513 2001 Jim Fay End the Bedtime Blues Parents Dont Need to Force Kids to Go to Sleep edtime is a time of frustration The Verification Corner. , . Rustan Leino . talks about Loop Invariants. He gives a brief summary of the theoretical foundations and shows how a program can sometimes be systematically constructed from its specifications.. Grigore. . Rosu. and Andrei . Stefanescu. University of Illinois, USA. Operational Semantics. Operational Semantics. Easy to define and understand. Can be regarded as formal “implementations”. Require little mathematical knowledge. Tony Hoare. Feb 2012. With Ideas from. Ian Wehrman. John Wickerson. Stephan van . Staden. Peter O’Hearn. Bernhard Moeller. Georg Struth. Rasmus Petersen. …and others. and Calculi from. Robin Milner. The Verification Corner. , . Rustan Leino . talks about Loop Invariants. He gives a brief summary of the theoretical foundations and shows how a program can sometimes be systematically constructed from its specifications.. . S. . Creese. , M. Goldsmith, J. Nurse, E. Phillips. 11. th. IEEE International Conference on Trust, Security and Privacy in Computing and Communications (. TrustCom. ), 2012,pp. 1124-1131. DOI: 10.1109/. Grigore Rosu. University of Illinois at Urbana-Champaign, USA. Runtime Verification, Inc.. 1. 12 October 2017, LOPSTR’17. Ideal Language Framework Vision. Deductive program verifier. Parser. Interpreter. Grigore. . Rosu. University of Illinois at . Urbana-Champaign (UIUC). Joint work with. Chucky Ellison . (UIUC). Wolfram Schulte . (Microsoft Research). How It Started. NASA project runtime . verification effort. Statement of the problem. Two sides of the market to be . matched.. Participants . on . both sides care about to whom they are matched.. M. oney can’t . be used to . determine . the assignment. .. Examples . Tomas D. . Latoza. Brad . A.Myers. Summery By. Maryam Arab, Feb2017. Reachability Questions. As developers build their mental model of the code. Ask questions, read code, use design knowledge, talk to teammates. Qirun Zhang, Georgia Institute of Technology. Thomas Reps, University of Wisconsin. Outline of Tutorial. CFL-reachability. Origin & background. Algorithm & complexity. Applications. Beyond CFL-reachability. Origin & background. Algorithm & complexity. Applications. Beyond CFL-reachability. Datalog. WPDS, NWA. Graph reachability. Dyck. -reach. LCL-reach. InterDyck. -reach. Future Directions. Theoretical developments.

Download Document

Here is the link to download the presentation.
"From Hoare Logic to Matching Logic Reachability"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.