Lindsay Groves

J. Autom. Reason., 2022

2021

A survey on network forwarding in Software-Defined Networking.

[BibT_eX]

[DOI]

J. Netw. Comput. Appl., 2021

2020

Decidable subtyping for path dependent types.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2020

A Relaxed Balanced Lock-Free Binary Search Tree.

[BibT_eX]

[DOI]

Manish Singh

Alex Potanin

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Syntactically Restricting Bounded Polymorphism for Decidable Subtyping.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2019

Weakening Correctness and Linearizability for Concurrent Objects on Multicore Processors.

[BibT_eX]

[DOI]

Graeme Smith

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

2018

An Introduction to Software Verification with Whiley.

[BibT_eX]

[DOI]

Proceedings of the Engineering Trustworthy Software Systems - 4th International School, 2018

Capabilities: Effects for Free.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2018

2017

Deterministic Confidence Interval Estimation of Networking Traffic in SDN.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Conference on Local Computer Networks, 2017

Equivalent forwarding set evaluation in software defined networking.

[BibT_eX]

[DOI]

Proceedings of the 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM), 2017

Making Whiley Boogie!

[BibT_eX]

[DOI]

Proceedings of the Integrated Formal Methods - 13th International Conference, 2017

A Proof Method for Linearizability on TSO Architectures.

[BibT_eX]

[DOI]

Proceedings of the Provably Correct Systems, 2017

2016

Contextual Trace Refinement for Concurrent Objects: Safety and Progress.

[BibT_eX]

[DOI]

Brijesh Dongol

Proceedings of the Formal Methods and Software Engineering, 2016

2015

Designing a verifying compiler: Lessons learned from developing Whiley.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2015

Collapsing Threads Safely with Soft Invariants.

[BibT_eX]

[DOI]

David Friggens

CoRR, 2015

Towards linking correctness conditions for concurrent objects and contextual trace refinement.

[BibT_eX]

[DOI]

Brijesh Dongol

Proceedings of the Proceedings 17th International Workshop on Refinement, 2015

Defining Correctness Conditions for Concurrent Objects in Multicore Architectures.

[BibT_eX]

[DOI]

Proceedings of the 29th European Conference on Object-Oriented Programming, 2015

2014

Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures.

[BibT_eX]

[DOI]

Proceedings of the Hardware and Software: Verification and Testing, 2014

Shape Predicates Allow Unbounded Verification of Linearizability Using Canonical Abstraction.

[BibT_eX]

[DOI]

David Friggens

Proceedings of the Thirty-Seventh Australasian Computer Science Conference, 2014

2013

Towards formally specifying and verifying transactional memory.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2013

Whiley: A Platform for Research in Software Verification.

[BibT_eX]

[DOI]

Proceedings of the Software Language Engineering - 6th International Conference, 2013

Reflections on Verifying Software with Whiley.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Safety-Critical Systems, 2013

True small-step reduction for imperative object oriented languages.

[BibT_eX]

[DOI]

Marco Servetto

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs, 2013

2012

Encoding Featherweight Java with assignment and immutability using the Coq proof assistant.

[BibT_eX]

[DOI]

Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, 2012

2011

A Dual Clustering Approach to the Extract Class Refactoring.

[BibT_eX]

Keith Cassell

Peter Andreae

Proceedings of the 23rd International Conference on Software Engineering & Knowledge Engineering (SEKE'2011), 2011

Visualizing the Refactoring of Classes via Clustering.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth Australasian Computer Science Conference, 2011

2010

Theorem prover approach to semistructured data design.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2010

Simpler Backward Simulation Proofs.

[BibT_eX]

[DOI]

Simon Doherty

Proceedings of the Theory of Computing 2010, 2010

Translating Z to Alloy.

[BibT_eX]

[DOI]

Petra Malik

Clare Lenihan

Proceedings of the Abstract State Machines, 2010

2009

Formal Verification of Semistructured Data Models in PVS.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

Reasoning about Nonblocking Concurrency.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

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

[BibT_eX]

[DOI]

Formal Aspects Comput., 2009

Towards Automating Class-Splitting Using Betweenness Clustering.

[BibT_eX]

[DOI]

Proceedings of the ASE 2009, 2009

2008

Verifying Semistructured Data Normalization Using PVS.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Engineering of Complex Computer Systems (ICECCS 2008), March 31 2008, 2008

Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

Correctness Criteria for Normalization of Semistructured Data.

[BibT_eX]

[DOI]

Proceedings of the 19th Australian Software Engineering Conference (ASWEC 2008), 2008

2007

Trace-based Derivation of a Lock-Free Queue Algorithm.

[BibT_eX]

[DOI]

Proceedings of the BCS-FACS Refinement Workshop, 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

Reasoning about Nonblocking Concurrency using Reduction.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Engineering of Complex Computer Systems (ICECCS 2007), 2007

2006

Derivation of a Scalable Lock-Free Stack Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 11th Refinement Workshop, 2006

Preface.

[BibT_eX]

[DOI]

Bernhard K. Aichernig

Eerke A. Boiten

John Derrick

Proceedings of the 11th Refinement Workshop, 2006

A PVS Approach to Verifying ORA-SS Data Models.

[BibT_eX]

Proceedings of the Eighteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2006), 2006

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

[BibT_eX]

[DOI]

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

Validating ORA-SS Data Models using Alloy.

[BibT_eX]

[DOI]

Proceedings of the 17th Australian Software Engineering Conference (ASWEC 2006), 2006

2005

Verifying Concurrent Data Structures by Simulation.

[BibT_eX]

[DOI]

Simon Doherty

Proceedings of the REFINE 2005 Workshop, 2005

Practical Data Refinement for the Z Schema Calculus.

[BibT_eX]

[DOI]

Proceedings of the ZB 2005: Formal Specification and Development in Z and B, 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

DCAS is not a silver bullet for nonblocking algorithm design.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 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

Formal Verification of a Practical Lock-Free Queue Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

2002

Refinement and the Z schema calculus.

[BibT_eX]

[DOI]

Proceedings of the BCS FACS Refinement Workshop 2002, 2002

2000

A Survey of Software Development Practices in the New Zealand Software Industry .

[BibT_eX]

[DOI]

Proceedings of the 12th Australian Software Engineering Conference (ASWEC 2000), 2000

A formal approach to program modification.

[BibT_eX]

[DOI]

Proceedings of the 7th Asia-Pacific Software Engineering Conference (APSEC 2000), 2000

1995

Object Oriented Program Visualisation in Tarraingim.

[BibT_eX]

James Noble

Robert Biddle

Aust. Comput. J., 1995

Deriving Programs by Combining and Adapting Refinement Scripts.

[BibT_eX]

[DOI]

Proceedings of the 2nd Asia-Pacific Software Engineering Conference (APSEC '95), 1995

1994

Viewpoint specification and Z.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 1994

Metavariables and Conditional Refinements in the Refinement Calculus.

[BibT_eX]

[DOI]

Raymond G. Nickson

Lindsay J. Groves

Proceedings of the 6th Refinement Workshop, 1994

Deriving language recognition algorithms: A case study in combining program specialisation and data refinement.

[BibT_eX]

[DOI]

Proceedings of the 6th Refinement Workshop, 1994

1992

An Introduction to the Tarraingím Program Animation Environment.

[BibT_eX]

James Noble

Proceedings of the TOOLS 1992: 6th International Conference on Technology of Object-Oriented Languages and Systems, 1992

A Tactic Driven Refinement Tool.

[BibT_eX]

[DOI]

Raymond G. Nickson

Proceedings of the 5th Refinement Workshop, 1992

1990

Book review: Software prototyping, formal methods and VDM by Sharam Hekmatpour and Darrel Ince (Addison-Wesley, 1988).

[BibT_eX]

[DOI]

ACM SIGCHI Bull., 1990

1988

Sets and Uncertainty in Relational Databases.

[BibT_eX]

[DOI]

Zbigniew Michalewicz

Proceedings of the Uncertainty and Intelligent Systems, 1988

1982

Using Simple English Sentences to Call Procedures.

[BibT_eX]

[DOI]