University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Pointer Safety and Graph Grammars

Pointer Safety and Graph Grammars

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Parkinson .

Graph reduction systems (GRSs), based on context-sensitive graph grammars, are used by the project Safe Pointers by Graph Transformation (SPGT) in their approach to verifying the properties of pointer structures. In this talk I will discuss three recent developments related to GRSs and the SPGT approach. I will first describe the application of SPGT to a C-like language. I will also discuss restrictions on graph rewrite rules which allow linear-time recognition of GRS languages. Thirdly, I will discuss the relationship of graph grammars to separation logic, a logic which forms the basis of much recent work on pointer safety.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity