default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Colvin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Robert J. Colvin, Ian J. Hayes, Scott Heiner, Peter Höfner, Larissa Meinicke, Roger C. Su:
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures. CoRR abs/2407.20559 (2024)- 2023
- [c28]Robert J. Colvin:
A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models. FM 2023: 301-320 - 2022
- [c27]Robert J. Colvin:
Separation of Concerning Things: A Simpler Basis for Defining and Programming with the C/C++ Memory Model. ICFEM 2022: 71-89 - [i11]Robert J. Colvin:
Separation of concerning things: a simpler basis for defining and programming with the C/C++ memory model (extended version). CoRR abs/2204.03189 (2022) - 2021
- [c26]Robert J. Colvin:
Parallelized Sequential Composition and Hardware Weak Memory Models. SEFM 2021: 201-221 - [i10]Robert J. Colvin:
Parallelized sequential composition, pipelines, and hardware weak memory models. CoRR abs/2105.02444 (2021) - 2020
- [j13]Graeme Smith
, Kirsten Winter, Robert J. Colvin:
Linearizability on hardware weak memory models. Formal Aspects Comput. 32(1): 1-32 (2020) - [i9]Robert J. Colvin, Kirsten Winter:
An abstract semantics of speculative execution for reasoning about security vulnerabilities. CoRR abs/2004.00577 (2020)
2010 – 2019
- 2019
- [j12]Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter, Robert J. Colvin:
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Formal Aspects Comput. 31(2): 133-163 (2019) - [c25]Robert J. Colvin, Kirsten Winter:
An Abstract Semantics of Speculative Execution for Reasoning About Security Vulnerabilities. FM Workshops (2) 2019: 323-341 - 2018
- [c24]Robert J. Colvin, Graeme Smith:
A Wide-Spectrum Language for Verification of Programs on Weak Memory Models. FM 2018: 240-257 - [c23]Graeme Smith, Kirsten Winter, Robert J. Colvin:
Correctness of Concurrent Objects under Weak Memory Models. Refine@FM 2018: 53-67 - [i8]Robert J. Colvin, Graeme Smith:
A wide-spectrum language for verification of programs on weak memory models. CoRR abs/1802.04406 (2018) - [i7]Graeme Smith, Kirsten Winter, Robert J. Colvin:
A sound and complete definition of linearizability on weak memory models. CoRR abs/1802.04954 (2018) - [i6]Robert J. Colvin, Graeme Smith:
A high-level operational semantics for hardware weak memory models. CoRR abs/1812.00996 (2018) - 2017
- [j11]Robert J. Colvin, Ian J. Hayes, Larissa A. Meinicke:
Designing a semantic model for a wide-spectrum language with concurrency. Formal Aspects Comput. 29(5): 853-875 (2017) - [i5]Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter, Robert J. Colvin:
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. CoRR abs/1710.03352 (2017) - 2016
- [j10]Robert J. Colvin:
Modelling and analysing neural networks using a hybrid process algebra. Theor. Comput. Sci. 623: 15-64 (2016) - [c22]Ian J. Hayes, Robert J. Colvin, Larissa A. Meinicke, Kirsten Winter, Andrius Velykis:
An Algebra of Synchronous Atomic Steps. FM 2016: 352-369 - [i4]Ian J. Hayes, Robert Colvin, Larissa Meinicke, Kirsten Winter, Andrius Velykis:
An algebra of synchronous atomic steps. CoRR abs/1609.00118 (2016) - [i3]Robert J. Colvin, Ian J. Hayes, Larissa A. Meinicke:
Designing a semantic model for a wide-spectrum language with concurrency. CoRR abs/1609.00195 (2016) - 2015
- [j9]Cliff B. Jones, Ian J. Hayes, Robert J. Colvin:
Balancing expressiveness in formal approaches to concurrency. Formal Aspects Comput. 27(3): 475-497 (2015) - 2014
- [j8]Robert Colvin:
An operational semantics for object-oriented concepts based on the class hierarchy. Formal Aspects Comput. 26(3): 491-535 (2014) - 2012
- [c21]Ian J. Hayes, Robert Colvin:
Integrated Operational Semantics: Small-Step, Big-Step and Multi-step. ABZ 2012: 21-35 - 2011
- [j7]Robert Colvin, Ian J. Hayes:
Structural operational semantics through context-dependent behaviour. J. Log. Algebraic Methods Program. 80(7): 392-426 (2011) - [j6]Robert Colvin, Ian J. Hayes:
A semantics for Behavior Trees using CSP with specification commands. Sci. Comput. Program. 76(10): 891-914 (2011) - 2010
- [c20]Kirsten Winter, Ian J. Hayes, Robert Colvin:
Integrating Requirements: The Behavior Tree Philosophy. SEFM 2010: 41-50
2000 – 2009
- 2009
- [j5]Lindsay Groves, Robert Colvin:
Trace-based derivation of a scalable lock-free stack algorithm. Formal Aspects Comput. 21(1-2): 187-223 (2009) - [j4]Robert Colvin, Brijesh Dongol:
A general technique for proving lock-freedom. Sci. Comput. Program. 74(3): 143-165 (2009) - [c19]Kirsten Winter, Robert Colvin, R. Geoff Dromey:
Dynamic Relational Behaviour for Large-Scale Systems. Australian Software Engineering Conference 2009: 173-182 - [c18]Robert Colvin, Ian J. Hayes:
CSP with Hierarchical State. IFM 2009: 118-135 - 2008
- [j3]Robert Colvin, Lars Grunske, Kirsten Winter:
Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems. J. Syst. Softw. 81(12): 2163-2182 (2008) - [j2]Robert Colvin, Ian J. Hayes, Paul A. Strooper:
Calculating modules in contextual logic program refinement. Theory Pract. Log. Program. 8(1): 1-31 (2008) - 2007
- [c17]Saad Zafar, Robert Colvin, Kirsten Winter, Nisansala Yatapanage, R. Geoff Dromey:
Early Validation and Verification of a Distributed Role-Based Access Control Model. APSEC 2007: 430-437 - [c16]Lars Grunske, Kirsten Winter, Robert Colvin:
Timed Behavior Trees and Their Application to Verifying Real-Time Systems. ASWEC 2007: 211-222 - [c15]Lian Wen, Robert Colvin, Kai Lin, John Seagrott, Nisansala Yatapanage, R. Geoff Dromey:
"Integrare", a Collaborative Environment for Behavior-Oriented Design. CDVE 2007: 122-131 - [c14]Robert Colvin, Brijesh Dongol:
Verifying Lock-Freedom Using Well-Founded Orders. ICTAC 2007: 124-138 - [c13]Robert Colvin, Lars Grunske, Kirsten Winter:
Probabilistic Timed Behavior Trees. IFM 2007: 156-175 - [c12]Lars Grunske, Robert Colvin, Kirsten Winter:
Probabilistic Model-Checking Support for FMEA. QEST 2007: 119-128 - [c11]Robert Colvin, Lindsay Groves:
A Scalable Lock-Free Stack Algorithm and its Verification. SEFM 2007: 339-348 - 2006
- [c10]Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir:
Formal Verification of a Lazy Concurrent List-Based Set Algorithm. CAV 2006: 475-488 - [c9]Lindsay Groves, Robert Colvin:
Derivation of a Scalable Lock-Free Stack Algorithm. Refine@ICFEM 2006: 55-74 - [i2]Robert Colvin, Ian J. Hayes, Paul A. Strooper:
Calculating modules in contextual logic program refinement. CoRR abs/cs/0608110 (2006) - 2005
- [c8]Robert Colvin, Lindsay Groves:
Formal Verification of an Array-Based Nonblocking Queue. ICECCS 2005: 507-516 - [c7]Robert Colvin, Simon Doherty, Lindsay Groves:
Verifying Concurrent Data Structures by Simulation. REFINE 2005: 93-110 - 2004
- [p1]Robert Colvin, Lindsay Groves, Ian J. Hayes, David Hemer, Ray Nickson, Paul A. Strooper:
Developing Logic Programs from Specifications Using Stepwise Refinement. Program Development in Computational Logic 2004: 66-89 - 2002
- [b1]Robert Colvin:
Contextual and data refinement for the refinement calculus for logic programs. University of Queensland, Australia, 2002 - [j1]Ian J. Hayes, Robert Colvin, David Hemer, Paul A. Strooper, Ray Nickson:
A refinement calculus for logic programs. Theory Pract. Log. Program. 2(4-5): 425-460 (2002) - [c6]Robert Colvin, Ian J. Hayes, David Hemer, Paul A. Strooper:
Translating Refined Logic Programs to Mercury. ACSC 2002: 33-40 - [c5]Robert Colvin, Ian J. Hayes, David Hemer, Paul A. Strooper:
Refinement of Higher-Order Logic Programs. LOPSTR 2002: 126-143 - [c4]David Hemer, Ian J. Hayes, Paul A. Strooper, Robert Colvin:
Don't Care Non-determinism in Logic Program Refinement. CATS 2002: 101-121 - [i1]Ian J. Hayes, Robert Colvin, David Hemer, Paul A. Strooper, Ray Nickson:
A Refinement Calculus for Logic Programs. CoRR cs.SE/0202002 (2002) - 2000
- [c3]Robert Colvin, Ian J. Hayes, Paul A. Strooper:
Refining Logic Programs Using Types. ACSC 2000: 43-50 - [c2]Robert Colvin, Ian J. Hayes, Paul A. Strooper:
Modular Logic Program Refinement. LOPSTR 2000 - [c1]Robert Colvin, Ian J. Hayes, Paul A. Strooper:
A Technique for Modular Logic Program Refinement. LOPSTR (LNCS 2042: Selected Papers) 2000: 38-56
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-08-22 20:52 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:
