This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.
Mahmudul Faisal Al Ameen
A grouping.
The completeness question for separation logic -- whether a proof system can prove everything true of the pointer programs it describes -- asked four times, three of them with Tatsuta, from pointer program verification through recursive procedures to expressiveness. Two of the four are the 2016 Theoretical Computer Science paper and the doctoral thesis of the same year and subject, held as separate records and linked distinct-from.
3 references
Completeness for recursive procedures in separation logic
Mahmudul Faisal Al Ameen and others (2016) · Theoretical Computer Science · Elsevier
Completeness of Verification System with Separation Logic for Recursive Procedures
Mahmudul Faisal Al Ameen (2016) · The Graduate University for Advanced Studies, SOKENDAI
Completeness of Pointer Program Verification by Separation Logic
Makoto Tatsuta and others (2009) · 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods · IEEE