Nikos Gorogiannis (aka Gkorogiannis)

Photo

Senior Lecturer (Foundations of Computing Group, Department of Computer Science, School of Science and Technology, University of Middlesex).

[ Google scholar ; DBLP ; MS Academic Search ]

Cyclist framework

Cyclist is a generic, cyclic theorem prover framework written in OCaml and C++. It can be used for constructing theorem provers over logics with inductive definitions Existing instantiations include fragments of first-order logic, separation logic, and Hoare-style program logics for termination and/or safety.

Cyclist is now hosted on GitHub and accessible from this repository.

Conference Papers

[1]
James Brotherston, Carsten Fuhs, Juan A. Navarro Pérez, and Nikos Gorogiannis. A decision procedure for satisfiability in separation logic with inductive predicates. In 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), CSL-LICS '14, pages 25:1–25:10, New York, NY, USA, 2014. ACM. [ bib | DOI | .pdf ]
[2]
James Brotherston and Nikos Gorogiannis. Cyclic abduction of inductively defined safety and termination preconditions. In Markus Müller-Olm and Helmut Seidl, editors, Static Analysis, volume 8723 of Lecture Notes in Computer Science, pages 68–84. Springer International Publishing, 2014. [ bib | DOI | .pdf ]
[3]
Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max Kanovich, and Joël Ouaknine. Foundations for decision problems in separation logic with general inductive predicates. In Foundations of Software Science and Computation Structures, FoSSaCS 2014, volume 8412 of Lecture Notes in Computer Science, pages 411–425. Springer Berlin Heidelberg, 2014. [ bib | DOI | .pdf ]
[4]
James Brotherston, Nikos Gorogiannis, and Rasmus L. Petersen. A generic cyclic theorem prover. In Programming Languages and Systems – 10th Asian Symposium, APLAS 2012, volume 7705 of Lecture Notes in Computer Science, pages 350–367. Springer, 2012. [ bib | DOI | .pdf ]
[5]
Nikos Gorogiannis, Max Kanovich, and Peter W. O'Hearn. The complexity of abduction for separated heap abstractions. In The 18th International Static Analysis Symposium, SAS 2011, volume 6887 of Lecture Notes in Computer Science, pages 25–42. Springer, 2011. [ bib | DOI | .pdf ]
[6]
Nikos Gorogiannis, Anthony Hunter, Vivek Patkar, and Matthew Williams. Argumentation about treatment efficacy. In Knowledge Representation for Health-Care. Data, Processes and Guidelines, volume 5943 of Lecture Notes in Computer Science, pages 169–179. Springer, 2010. [ bib | DOI | .pdf ]
[7]
Nikos Gorogiannis and Anthony Hunter. Merging First-Order Knowledge using Dilation Operators. In Proceedings of the Fifth International Symposium on Foundations of Information and Knowledge Systems, FoIKS'08, volume 4932 of Lecture Notes in Computer Science, pages 132–150, January 2008. [ bib | DOI | .pdf ]
[8]
Nikos Gorogiannis and Mark Ryan. Requirements, specifications, and minimal refinement. In 9th Workshop on Logic, Language, Information and Computation, volume 67 of Electronic Notes in Theoretical Computer Science, pages 218–232, October 2002. [ bib | DOI | .pdf ]

This file was generated by bibtex2html 1.98.

Technical Reports

[1]
James Brotherston and Nikos Gorogiannis. Cyclic abduction of inductively defined safety and termination preconditions. Technical Report RN/13/14, University College London, 2013. [ bib | .pdf ]
[2]
James Brotherston, Carsten Fuhs, Nikos Gorogiannis, and Juan Navarro Pérez. A decision procedure for satisfiability in separation logic with inductive predicates. Technical Report RN/13/15, University College London, 2013. [ bib | .pdf ]

This file was generated by bibtex2html 1.98.

Journal Articles

[1]
Nikos Gorogiannis and Anthony Hunter. Instantiating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties. Artificial Intelligence Journal, 175(9–10):1479–1497, June 2011. [ bib | DOI | .pdf ]
[2]
Robin Hirsch and Nikos Gorogiannis. The complexity of the warranted formula problem in propositional argumentation. Journal of Logic and Computation, 20(2):481–499, April 2010. [ bib | DOI | .pdf ]
[3]
Nikos Gorogiannis and Anthony Hunter. An argument-based approach to reasoning with clinical knowledge. International Journal of Approximate Reasoning, 51(1):1–22, December 2009. [ bib | DOI | .pdf ]
[4]
Nikos Gorogiannis and Anthony Hunter. Implementing semantic merging operators using binary decision diagrams. International Journal of Approximate Reasoning, 49(1):234–251, September 2008. [ bib ]
[5]
Nikos Gorogiannis and Mark Ryan. Minimal refinements of specifications in modal and temporal logics. Formal Aspects of Computing, 19(4):417–444, November 2007. [ bib | DOI | .pdf ]
[6]
Nikos Gorogiannis and Mark D. Ryan. Implementation of Belief Change Operators using BDDs. Studia Logica, 70(1):131–156, February 2002. [ bib | DOI | .pdf ]

This file was generated by bibtex2html 1.98.

Thesis

[1]
Nikos Gorogiannis. Computing minimal changes of models of systems. PhD thesis, School of Computer Science, University of Birmingham, 2003. [ bib | .pdf ]

This file was generated by bibtex2html 1.98.

Software

Feel free to contact me if you need help to get any if the above code to work.

Contact me

Email : nikos.gorogiannis+www@gmail.com

Phone : ++44 (0)20 8411 4744

Address

Office TG03, Town Hall Building
Department of Computer Science
School of Science and Technology
The Burroughs, Hendon
London, NW4 4BT
United Kingdon