default search action
Nathaniel Charlton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c13]Danica Vukadinovic Greetham
, Nathaniel Charlton, Anush Poghosyan
Total Positive Influence Domination on Weighted Networks. COMPLEX NETWORKS (1) 2019: 325-336 - 2017
- [c12]Nathaniel Charlton, John Kingston, Miltos Petridis, Ben C. Fletcher:
Using Data Mining to Refine Digital Behaviour Change Interventions. DH 2017: 90-98 - [c11]John Kingston, Nathaniel Charlton:
An Ontology to Support Knowledge Management in Behaviour-Based Healthcare. SGAI Conf. 2017: 207-216 - 2016
- [i3]Ewan Colman, Nathaniel Charlton:
Interpreting network communicability with stochastic models and data. CoRR abs/1601.00571 (2016) - [i2]Nathaniel Charlton, Colin Singleton, Danica Vukadinovic Greetham:
In the mood: the dynamics of collective sentiments on Twitter. CoRR abs/1604.03427 (2016) - [i1]Danica Vukadinovic Greetham, Anush Poghosyan, Nathaniel Charlton:
Algorithms for alpha-rate domination problems on weighted graphs. CoRR abs/1604.07661 (2016) - 2015
- [j4]Bernhard Reus
Symbolic Execution Proofs for Higher Order Store Programs. J. Autom. Reason. 54(3): 199-284 (2015) - 2014
- [c10]Danica Vukadinovic Greetham
Weighted Alpha-Rate Dominating Sets in Social Networks. SITIS 2014: 369-375 - 2013
- [j3]Nathaniel Charlton, Bernhard Reus
Specification patterns for reasoning about recursion through the store. Inf. Comput. 231: 167-203 (2013) - 2012
- [c9]Ben Horsfall, Nathaniel Charlton, Bernhard Reus
Verifying the reflective visitor pattern. FTfJP@ECOOP 2012: 27-34 - [c8]Nathaniel Charlton, Ben Horsfall, Bernhard Reus
Crowfoot: A Verifier for Higher-Order Store Programs. VMCAI 2012: 136-151 - 2011
- [c7]Nathaniel Charlton, Bernhard Reus
Specification Patterns and Proofs for Recursion through the Store. FCT 2011: 310-321 - [c6]Nathaniel Charlton, Ben Horsfall, Bernhard Reus
Formal reasoning about runtime code update. ICDE Workshops 2011: 134-138 - [c5]Nathaniel Charlton:
Hoare Logic for Higher Order Store Using Simple Semantics. WoLLIC 2011: 52-66
2000 – 2009
- 2009
- [j2]Nathaniel Charlton, Bernhard Reus:
A decidable class of verification conditions for programs with higher order store. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009) - 2008
- [b1]Nathaniel Charlton:
Cooperatively combining program verifiers: foundations and tool support. Imperial College London, UK, 2008 - [c4]Nathaniel Charlton, Michael Huth:
Falsifying Safety Properties Through Games on Over-approximating Models. RP 2008: 71-86 - 2007
- [j1]Nathaniel Charlton:
Program verification with interacting analysis plugins. Formal Aspects Comput. 19(3): 375-399 (2007) - [c3]Nathaniel Charlton, Michael Huth:
Hector: Software Model Checking with Cooperating Analysis Plugins. CAV 2007: 168-172 - 2006
- [c2]Adam Antonik, Nathaniel Charlton, Michael Huth:
Polynomial-Time Under-Approximation of Winning Regions in Parity Games. MFCSIT 2006: 115-139 - 2005
- [c1]Nathaniel Charlton:
Verification of Java Programs with Interacting Analysis Plugins. AVoCS 2005: 131-150
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-04-25 05:58 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: