Verify Attestor Formula with airSlate SignNow

Verify attestant formula

each year Microsoft Research hosts hundreds of influential speakers from around the world including leading scientists renowned experts in technology book authors and leading academics and makes videos of these lectures freely available hello everyone and good morning in to our research talks and the new building and 99 let me just moved in a week ago so this is actually the first that I had talked that I'm hosting here and I'm very grateful to be able to host the gun chin who is coming from Singapore University and we have actually a little bit history together because I looked into his earlier work on on size types and then we both moved on into a verification and you will talk a little bit about verification of heat properties using his work on separation logic and welcome an event is so this piece of work is joint work with my two students who high and Kristina and also my collaborator at Durham's and chow so is a work that we started about two years ago doing automated verification using separation logic so the basically the goal of this world is to try to handle mutable data structures with sophisticated invariance in as precise away as possible and then we also want to capture various properties about this kind of data structures like lang hi maybe back properties and then here the challenge we face here looking into it is first we want to be able to perform strong updates in tracking the properties of these data structures in the presence of aliasing and also we won the facility to be as flexible as possible allowing user to define predicates about their data structure and our emphasis is as much as possible on a practical tool for verification and here as I was mentioning we rely on what has been done before in the area of separation logic let me just give a very brief background first about separation logic I guess most of you in the audience may have some knowledge that I'll be very quick we just to slice firstly separation logic is extension of whole logic that will allow us to reason about mutable data structures and foundations for this work has been done by people heard Reynolds and they are collaborators around the above seven years ago so those are the foundation papers and essentially the extension of the separation logic allow you to have two main connective one is called spatial conjunction which allows you to describe are two formulas about disjoint heap and then the other thing is spatial implication that allows you to if you up man you're currently with some additional heap structure you should be able to assert things from there and this spatial implication is quite used to especially if you are wanting to reason backwards in your programs so as we are mainly focusing on the forward analysis here will be mainly using in this work spatial conjunction operator...