Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRob Arthan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j10]Rob Arthan, Paulo Oliva:
On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem. J. Log. Anal. 13 (2021)- [j9]Rob Arthan, Paulo Oliva:
Double Negation Semantics for Generalisations of Heyting Algebras. Stud Logica 109(2): 341-365 (2021) - 2016
- [j8]Rob Arthan:
On Definitions of Constants and Types in HOL. J. Autom. Reason. 56(3): 205-219 (2016) - [j7]Ramana Kumar, Rob Arthan, Magnus O. Myreen, Scott Owens
:
Self-Formalisation of Higher-Order Logic - Semantics, Soundness, and a Verified Implementation. J. Autom. Reason. 56(3): 221-259 (2016) - [j6]Yuhui Lin, Gudmund Grov, Rob Arthan:
Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC. J. Formaliz. Reason. 9(2): 69-130 (2016) - 2013
- [j5]Rob Arthan, Ursula Martin, Paulo Oliva:
A Hoare logic for linear systems. Formal Aspects Comput. 25(3): 345-363 (2013) - 2012
- [j4]Robert Solovay, R. D. Arthan, John Harrison:
Some new results on decidability for elementary algebra and geometry. Ann. Pure Appl. Log. 163(12): 1765-1802 (2012) - [j3]R. D. Arthan:
Aronszajn's Criterion for Euclidean Space. Am. Math. Mon. 119(5): 419-422 (2012) - 2009
- [j2]Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A general framework for sound and complete Floyd-Hoare logics. ACM Trans. Comput. Log. 11(1): 7:1-7:31 (2009) - 1997
- [j1]Colin O'Halloran, R. D. Arthan, D. King:
Using a Formal Specification Contractually. Formal Aspects Comput. 9(4): 349-358 (1997)
Conference and Workshop Papers
- 2014
- [c16]Ramana Kumar, Rob Arthan, Magnus O. Myreen, Scott Owens:
HOL with Definitions: Semantics, Soundness, and a Verified Implementation. ITP 2014: 308-324 - [c15]Rob Arthan:
HOL Constant Definition Done Right. ITP 2014: 531-536 - 2013
- [c14]Rob Arthan, Paulo Oliva:
(Dual) Hoops Have Unique Halving. Automated Reasoning and Mathematics 2013: 165-180 - 2011
- [c13]Vladimir Klebanov, Peter Müller, Natarajan Shankar, Gary T. Leavens, Valentin Wüstholz, Eyad Alkassar, Rob Arthan, Derek Bronish, Rod Chapman, Ernie Cohen, Mark A. Hillebrand, Bart Jacobs, K. Rustan M. Leino, Rosemary Monahan, Frank Piessens, Nadia Polikarpova, Tom Ridge, Jan Smans, Stephan Tobies, Thomas Tuerk, Mattias Ulbrich, Benjamin Weiß:
The 1st Verified Software Competition: Experience Report. FM 2011: 154-168 - 2010
- [c12]R. D. Arthan:
Building a Library of Mechanized Mathematical Proofs: Why Do It? and What Is It Like to Do? ICMS 2010: 148 - 2009
- [c11]Rob Arthan:
Computational Logic and Continuous Mathematics, Pure and Applied. Calculemus/MKM 2009: 1 - 2008
- [c10]Rob Arthan:
Mechanized Reasoning for Continuous Problem Domains (Invited Talk). PAAR/ESHOL 2008 - 2006
- [c9]R. D. Arthan:
A Verified Formal Model of a VC Generator. SEW 2006: 263-271 - 2001
- [c8]R. D. Arthan:
An Irrational Construction of R from Z. TPHOLs 2001: 43-58 - 2000
- [c7]R. D. Arthan, P. Caseley, Colin O'Halloran, Alf Smith:
ClawZ: Control Laws in Z. ICFEM 2000: 169-176 - [c6]R. D. Arthan:
Analysis of Compiled Code: A Prototype Formal Model. ZB 2000: 433-449 - 1998
- [c5]R. D. Arthan:
Recursive Definitions in Z. ZUM 1998: 154-171 - 1991
- [c4]R. D. Arthan:
On Formal Specification of a Proof Tool. VDM Europe (1) 1991: 356-370 - [c3]R. D. Arthan:
A Report on ICL HOL. TPHOLs 1991: 280-283 - [c2]R. D. Arthan:
On Free Type Definitions in Z. Z User Workshop 1991: 40-58 - 1988
- [c1]R. D. Arthan:
Compiler Prototyping with VDM and Standard ML. VDM Europe 1988: 101-115
Parts in Books or Collections
- 2006
- [p1]John Harrison, Konrad Slind, Rob Arthan:
HOL. The Seventeen Provers of the World 2006: 11-19
Informal and Other Publications
- 2019
- [i8]Rob Arthan, Paulo Oliva:
Studying Algebraic Structures using Prover9 and Mace4. CoRR abs/1908.06479 (2019) - [i7]Rob Arthan, Paulo Oliva:
Negative Translations for Affine and Lukasiewicz Logic. CoRR abs/1912.00012 (2019) - 2018
- [i6]Rob Arthan, Paulo Oliva:
A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic. CoRR abs/1809.04492 (2018) - 2016
- [i5]Yuhui Lin, Gudmund Grov, Rob Arthan:
Understanding and maintaining tactics graphically OR how we learned that a diagram can be worth more than 10K LoC. CoRR abs/1610.05593 (2016) - 2014
- [i4]Rob Arthan, Paulo Oliva:
On Affine Logic and Łukasiewicz Logic. CoRR abs/1404.0570 (2014) - [i3]Rob Arthan, Paulo Oliva:
On Pocrims and Hoops. CoRR abs/1404.0816 (2014) - 2012
- [i2]Rob Arthan, Paulo Oliva:
(Dual) Hoops Have Unique Halving. CoRR abs/1203.0436 (2012) - 2008
- [i1]Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A General Framework for Sound and Complete Floyd-Hoare Logics. CoRR abs/0807.1016 (2008)
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 2023-09-27 22:40 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:
