Nikos Gorogiannis
4 references under this name, matched as it is written. Somebody else may write under it too, and the same person may appear here spelled another way.
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.
Nikos Gorogiannis
Decidability in separation logic -- what a solver can settle, and how fast: foundations for decision problems with general inductive predicates, a decision procedure for satisfiability with inductive predicates, and the extension of bi-abduction to array separation logic, which matters because bi-abduction is what made compositional shape analysis work. The fourth record is SL-COMP, the competition all of it is measured in.
SL-COMP: Competition of Solvers for Separation Logic
Mihaela Sighireanu and others (2019) · International Conference on Tools and Algorithms for the Construction and Analysis of Systems · Springer
Biabduction (and Related Problems) in Array Separation Logic
James Brotherston and others (2017) · Automated Deduction – CADE 26 · Springer
Foundations for Decision Problems in Separation Logic with General Inductive Predicates
Timos Antonopoulos and others (2014) · Foundations of Software Science and Computation Structures · Springer
A Decision Procedure for Satisfiability in Separation Logic with Inductive Definitions
James Brotherston and others (2014) · Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) · Association for Computing Machinery