Robert Colvin

Proceedings of the Formal Methods - 25th International Symposium, 2023

2022

Separation of concerning things: a simpler basis for defining and programming with the C/C++ memory model (extended version).

[BibT_eX]

[DOI]

CoRR, 2022

Separation of Concerning Things: A Simpler Basis for Defining and Programming with the C/C++ Memory Model.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2022

2021

Parallelized sequential composition, pipelines, and hardware weak memory models.

[BibT_eX]

[DOI]

CoRR, 2021

Parallelized Sequential Composition and Hardware Weak Memory Models.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering and Formal Methods - 19th International Conference, 2021

2020

Linearizability on hardware weak memory models.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2020

2019

A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2019

An Abstract Semantics of Speculative Execution for Reasoning About Security Vulnerabilities.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods. FM 2019 International Workshops, 2019

2018

A high-level operational semantics for hardware weak memory models.

[BibT_eX]

[DOI]

CoRR, 2018

Correctness of Concurrent Objects under Weak Memory Models.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 18th Refinement Workshop, 2018

A sound and complete definition of linearizability on weak memory models.

[BibT_eX]

[DOI]

CoRR, 2018

A Wide-Spectrum Language for Verification of Programs on Weak Memory Models.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 22nd International Symposium, 2018

2017

Designing a semantic model for a wide-spectrum language with concurrency.

[BibT_eX]

[DOI]

Larissa A. Meinicke

Formal Aspects Comput., 2017

2016

Modelling and analysing neural networks using a hybrid process algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

An Algebra of Synchronous Atomic Steps.

[BibT_eX]

[DOI]

Proceedings of the FM 2016: Formal Methods, 2016

2015

Balancing expressiveness in formal approaches to concurrency.

[BibT_eX]

[DOI]

Cliff B. Jones

Formal Aspects Comput., 2015

2014

An operational semantics for object-oriented concepts based on the class hierarchy.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2014

2012

Integrated Operational Semantics: Small-Step, Big-Step and Multi-step.

[BibT_eX]

[DOI]

Proceedings of the Abstract State Machines, Alloy, B, VDM, and Z, 2012

2011

A semantics for Behavior Trees using CSP with specification commands.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2011

Structural operational semantics through context-dependent behaviour.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2011

2010

Integrating Requirements: The Behavior Tree Philosophy.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Software Engineering and Formal Methods, 2010

2009

A general technique for proving lock-freedom.

[BibT_eX]

[DOI]

Brijesh Dongol

Sci. Comput. Program., 2009

Trace-based derivation of a scalable lock-free stack algorithm.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2009

CSP with Hierarchical State.

[BibT_eX]

[DOI]

Proceedings of the Integrated Formal Methods, 7th International Conference, 2009

Dynamic Relational Behaviour for Large-Scale Systems.

[BibT_eX]

[DOI]

R. Geoff Dromey

Proceedings of the 20th Australian Software Engineering Conference (ASWEC 2009), 2009

2008

Calculating modules in contextual logic program refinement.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2008

Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems.

[BibT_eX]

[DOI]

J. Syst. Softw., 2008

2007

A Scalable Lock-Free Stack Algorithm and its Verification.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 2007

Probabilistic Model-Checking Support for FMEA.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

Probabilistic Timed Behavior Trees.

[BibT_eX]

[DOI]

Proceedings of the Integrated Formal Methods, 6th International Conference, 2007

Verifying Lock-Freedom Using Well-Founded Orders.

[BibT_eX]

[DOI]

Brijesh Dongol

Proceedings of the Theoretical Aspects of Computing, 2007

"Integrare", a Collaborative Environment for Behavior-Oriented Design.

[BibT_eX]

[DOI]

Proceedings of the Cooperative Design, 2007

Timed Behavior Trees and Their Application to Verifying Real-Time Systems.

[BibT_eX]

[DOI]

Proceedings of the 18th Australian Software Engineering Conference (ASWEC 2007), 2007

Early Validation and Verification of a Distributed Role-Based Access Control Model.

[BibT_eX]

[DOI]

Proceedings of the 14th Asia-Pacific Software Engineering Conference (APSEC 2007), 2007

2006

Derivation of a Scalable Lock-Free Stack Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 11th Refinement Workshop, 2006

Formal Verification of a Lazy Concurrent List-Based Set Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005

Verifying Concurrent Data Structures by Simulation.

[BibT_eX]

[DOI]

Simon Doherty

Proceedings of the REFINE 2005 Workshop, 2005

Formal Verification of an Array-Based Nonblocking Queue.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 2005

2004

Developing Logic Programs from Specifications Using Stepwise Refinement.

[BibT_eX]

[DOI]

Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

2002

Contextual and data refinement for the refinement calculus for logic programs

[BibT_eX]

[DOI]

PhD thesis, 2002

A refinement calculus for logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2002

Don't Care Non-determinism in Logic Program Refinement.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposium, 2002

Refinement of Higher-Order Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Translating Refined Logic Programs to Mercury.

[BibT_eX]

[DOI]

Proceedings of the Computer Science 2002, 2002

2000

A Technique for Modular Logic Program Refinement.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Transformation, 2000

Modular Logic Program Refinement.

[BibT_eX]

Proceedings of the Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, 2000

Refining Logic Programs Using Types.

[BibT_eX]

[DOI]