default search action
Nikos Gorogiannis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c18]James Brotherston, Paul Brunet
, Nikos Gorogiannis, Max I. Kanovich:
A Compositional Deadlock Detector for Android Java. ASE 2021: 955-966
2010 – 2019
- 2019
- [j12]Nikos Gorogiannis, Peter W. O'Hearn, Ilya Sergey
A true positives theorem for a static race detector. Proc. ACM Program. Lang. 3(POPL): 57:1-57:29 (2019) - [c17]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - 2018
- [j11]Diletta Romana Cacciagrano
Analysis and verification of ECA rules in intelligent environments. J. Ambient Intell. Smart Environ. 10(3): 261-273 (2018) - [j10]Sam Blackshear, Nikos Gorogiannis, Peter W. O'Hearn, Ilya Sergey
RacerD: compositional static race detection. Proc. ACM Program. Lang. 2(OOPSLA): 144:1-144:28 (2018) - [c16]Kelly Androutsopoulos, L. Aristodemou, Jaap Boender, Michele Bottone
MIRTO: an Open-Source Robotic Platform for Education. ECSEE 2018: 55-62 - [i2]Nikos Gorogiannis, Peter W. O'Hearn, Ilya Sergey:
A True Positives Theorem for a Static Race Detector - Extended Version. CoRR abs/1811.03503 (2018) - 2017
- [j9]Claudia Vannucchi, Michelangelo Diamanti, Gianmarco Mazzante, Diletta Cacciagrano
Symbolic verification of event-condition-action rules in intelligent environments. J. Reliab. Intell. Environ. 3(2): 117-130 (2017) - [c15]James Brotherston, Nikos Gorogiannis, Max I. Kanovich:
Biabduction (and Related Problems) in Array Separation Logic. CADE 2017: 472-490 - [c14]Nikos Gorogiannis, Franco Raimondi
A Novel Symbolic Approach to Verifying Epistemic Properties of Programs. IJCAI 2017: 206-212 - [c13]Claudia Vannucchi, Michelangelo Diamanti, Gianmarco Mazzante, Diletta Romana Cacciagrano
vIRONy: A Tool for Analysis and Verification of ECA Rules in Intelligent Environments. Intelligent Environments 2017: 92-99 - 2016
- [c12]James Brotherston, Nikos Gorogiannis, Max I. Kanovich, Reuben Rowe
Model checking for symbolic-heap separation logic with inductive predicates. POPL 2016: 84-96 - [i1]James Brotherston, Nikos Gorogiannis, Max I. Kanovich:
Biabduction (and Related Problems) in Array Separation Logic. CoRR abs/1607.01993 (2016) - 2015
- [c11]Mirco Bordoni, Michele Bottone
Towards Cyber-physical Systems as Services: The ASIP Protocol. SEsCPS@ICSE 2015: 52-55 - [c10]James Brotherston, Nikos Gorogiannis:
Disproving Inductive Entailments in Separation Logic via Base Pair Approximation. TABLEAUX 2015: 287-303 - 2014
- [c9]James Brotherston, Carsten Fuhs, Juan Antonio Navarro Pérez, Nikos Gorogiannis:
A decision procedure for satisfiability in separation logic with inductive predicates. CSL-LICS 2014: 25:1-25:10 - [c8]Franco Raimondi, Giuseppe Primiero, Kelly Androutsopoulos, Nikos Gorogiannis, Martin J. Loomes, Michael Margolis, Puja Varsani, Nick Weldin, Alex Zivanovic:
A Racket-Based Robot to Teach First-Year Computer Science. ELS 2014: 54-62 - [c7]Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase
Foundations for Decision Problems in Separation Logic with General Inductive Predicates. FoSSaCS 2014: 411-425 - [c6]James Brotherston, Nikos Gorogiannis:
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions. SAS 2014: 68-84 - 2012
- [c5]James Brotherston, Nikos Gorogiannis, Rasmus Lerchedahl Petersen:
A Generic Cyclic Theorem Prover. APLAS 2012: 350-367 - 2011
- [j8]Nikos Gorogiannis, Anthony Hunter
Instantiating abstract argumentation with classical logic arguments: Postulates and properties. Artif. Intell. 175(9-10): 1479-1497 (2011) - [c4]Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn:
The Complexity of Abduction for Separated Heap Abstractions. SAS 2011: 25-42 - 2010
- [j7]Robin Hirsch
The Complexity of the Warranted Formula Problem in Propositional Argumentation. J. Log. Comput. 20(2): 481-499 (2010)
2000 – 2009
- 2009
- [j6]Nikos Gorogiannis, Anthony Hunter
An argument-based approach to reasoning with clinical knowledge. Int. J. Approx. Reason. 51(1): 1-22 (2009) - [c3]Nikos Gorogiannis, Anthony Hunter
Argumentation about Treatment Efficacy. KR4HC 2009: 169-179 - 2008
- [j5]Nikos Gorogiannis, Anthony Hunter
Implementing semantic merging operators using binary decision diagrams. Int. J. Approx. Reason. 49(1): 234-251 (2008) - [c2]Nikos Gorogiannis, Anthony Hunter
Merging First-Order Knowledge Using Dilation Operators. FoIKS 2008: 132-150 - 2007
- [j4]Nikos Gorogiannis, Mark Ryan
Minimal refinements of specifications in model and termporal logics. Formal Aspects Comput. 19(1): 35-62 (2007) - [j3]Nikos Gorogiannis, Mark Ryan
Minimal refinements of specifications in modal and temporal logics. Formal Aspects Comput. 19(2): 273 (2007) - [j2]Nikos Gorogiannis, Mark Ryan
Minimal refinements of specifications in modal and temporal logics. Formal Aspects Comput. 19(4): 417-444 (2007) - 2003
- [b1]Nikos Gorogiannis:
Computing minimal changes of models of systems. University of Birmingham, UK, 2003 - 2002
- [j1]Nikos Gorogiannis, Mark Ryan
Implementation of Belief Change Operators Using BDDs. Stud Logica 70(1): 131-156 (2002) - [c1]Nikos Gorogiannis, Mark Ryan
Requirements, specifications, and minimal refinement. WoLLIC 2002: 218-232
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: