Pointer Safety and Graph Grammars

Add to your list(s) Download to your calendar using vCal

• Mike Dodds (York)
• Tuesday 06 November 2007, 14:30-15:30
• Room FW26, Computer Laboratory, William Gates Building.

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:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• Room FW26, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.