PPT-Outline of Tutorial CFL-reachability

Origin amp background Algorithm amp complexity Applications Beyond CFLreachability Datalog WPDS NWA Graph reachability Dyck reach LCLreach InterDyck reach Future Directions Theoretical developments. Audience This tutorial is intended for anyone who will be using the Fedora software in any capacity or who is ge nerally interested in Fe dora and its development brPage 3br Table of Contents Table of Contents 3 Table of Figures 3 Section 1 What http://www.bodowinter.com/tutorial/bw_LME_tutorial1.pdf This tutorial will take you about 1 hour (possibly a bit more). 1 For updates and other tut 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. Logic. Grigore. . Rosu. and Andrei Stefanescu. University of Illinois, USA. Main Goal. Language-independent. program verification framework. D. erive program properties from . operational semantics. 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. Andrei Stefanescu. 1. , . Stefan Ciobaca. 2. ,. . Radu. Mereuta. 1,2. ,. Brandon Moore. 1. , . Traian. Serbanuta. 3. , . Grigore. Rosu. 1. 1 . University . of Illinois, . USA. 2 . University of Iasi, Romania. Social Networks class . Edith Cohen. TAU, December 2014. Today. Diffusion of information/contagion in networks: . Applications:. Influence queries. Influence maximization. Influence similarity. Reachability-based diffusion:. Grigore . Rosu. , Andrei . Stefanescu. , Brandon Moore. University of Illinois at . Urbana-Champaign, USA. Stefan . Ciobaca. University . Alexadru. . Ioa. n. . Cuza. , Romania. Long-Standing Dream. Logic. Grigore. . Rosu. and Andrei Stefanescu. University of Illinois, USA. Main Goal. Language-independent. program verification framework. D. erive program properties from . operational semantics. . 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/. Andrei Stefanescu. 1. , . Stefan Ciobaca. 2. ,. . Radu. Mereuta. 1,2. ,. Brandon Moore. 1. , . Traian. Serbanuta. 3. , . Grigore. Rosu. 1. 1 . University . of Illinois, . USA. 2 . University of Iasi, Romania. 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. a . Succinct Control Plane Representation . Seyed . K. . Fayaz. Creativity. Once again, . analogy. : . after reading Batfish and HSA: header space .  control space?. Asked Vyas . Sekar. at . Seyed.