Proof Search for Propositional Abstract Separation Logics via Labelled Sequents
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are "abstract" because they are independent of any particular concrete memory model. Their assertion languages, called propo
|Collections||ANU Research Publications|
|Source:||Proof Search for Propositional Abstract Separation Logics via Labelled Sequents|
|01_Hou_Proof_Search_for_Propositional_2014.pdf||631.07 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.