Brijesh Dongol

Orcid: 0000-0003-0446-3507

According to our database1, Brijesh Dongol authored at least 100 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Fully Verified Persistency Library.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Artifact Report: Intel PMDK Transactions: Specification, Validation and Concurrency.
Proceedings of the Programming Languages and Systems, 2024

Intel PMDK Transactions: Specification, Validation and Concurrency.
Proceedings of the Programming Languages and Systems, 2024

2023
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies.
Formal Aspects Comput., June, 2023

Intel PMDK Transactions: Specification, Validation and Concurrency (Extended Version).
CoRR, 2023

Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version).
CoRR, 2023

Verifying List Swarm Attestation Protocols.
Proceedings of the 16th ACM Conference on Security and Privacy in Wireless and Mobile Networks, 2023

Verifying Read-Copy Update Under RC11.
Proceedings of the Software Engineering and Formal Methods - 21st International Conference, 2023

Ownership-Based Owicki-Gries Reasoning.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

Reasoning About Promises in Weak Memory Models with Event Structures.
Proceedings of the Formal Methods - 25th International Symposium, 2023

Rely-Guarantee Reasoning for Causally Consistent Shared Memory.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Unifying Operational Weak Memory Verification: An Axiomatic Approach.
ACM Trans. Comput. Log., 2022

Implementing and verifying release-acquire transactional memory in C11.
Proc. ACM Program. Lang., 2022

Modularising Verification Of Durable Opacity.
Log. Methods Comput. Sci., 2022

Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL.
J. Autom. Reason., 2022

A blockchain-enabled e-learning platform.
Interact. Learn. Environ., 2022

A Survey of Practical Formal Methods for Security.
Formal Aspects Comput., 2022

Introduction to the Special Section on iFM 2020.
Formal Aspects Comput., 2022

Reasoning about Promises in Weak Memory Models with Event Structures (Extended Version).
CoRR, 2022

Implementing and Verifying Release-Acquire Transactional Memory (Extended Version).
CoRR, 2022

View-Based Owicki-Gries Reasoning for Persistent x86-TSO (Extended Version).
CoRR, 2022

Proving Memory Access Violations in Isabelle/HOL.
Proceedings of the 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems, 2022

View-Based Owicki-Gries Reasoning for Persistent x86-TSO.
Proceedings of the Programming Languages and Systems, 2022

Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
Convolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras.
Log. Methods Comput. Sci., 2021

Verifying correctness of persistent concurrent data structures: a sound and complete method.
Formal Aspects Comput., 2021

Verifying C11-Style Weak Memory Libraries via Refinement.
CoRR, 2021

Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies (Extended Version).
CoRR, 2021

On Strong Observational Refinement and Forward Simulation.
CoRR, 2021

Brief Announcement: On Strong Observational Refinement and Forward Simulation.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Checking Opacity and Durable Opacity with FDR.
Proceedings of the Software Engineering and Formal Methods - 19th International Conference, 2021

Verifying C11-style weak memory libraries.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies.
Proceedings of the Formal Methods - 24th International Symposium, 2021

Verifying Secure Speculation in Isabelle/HOL.
Proceedings of the Formal Methods - 24th International Symposium, 2021

2020
Owicki-Gries Reasoning for C11 RAR (Artifact).
Dagstuhl Artifacts Ser., 2020

Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL.
CoRR, 2020

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2020

Owicki-Gries Reasoning for C11 RAR.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

2019
Modular transactions: bounding mixed races in space and time.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Verifying C11 programs operationally.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Cylindric Kleene Lattices for Program Construction.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Verifying Correctness of Persistent Concurrent Data Structures.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

Temporal Logic Semantics for Teleo-Reactive Robotic Agent Programs.
Proceedings of the Formal Methods. FM 2019 International Workshops, 2019

Towards deductive verification of C11 programs with Event-B and ProB.
Proceedings of the 21st Workshop on Formal Techniques for Java-like Programs, 2019

2018
Transactions in relaxed memory architectures.
Proc. ACM Program. Lang., 2018

Mechanized proofs of opacity: a comparison of two techniques.
Formal Aspects Comput., 2018

Causal Linearizability: Compositionality for Partially Ordered Executions.
CoRR, 2018

Brief Announcement: Generalising Concurrent Correctness to Weak Memory.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

On abstraction and compositionality for weak-memory linearisability.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Making Linearizability Compositional for Partially Ordered Executions.
Proceedings of the Integrated Formal Methods - 14th International Conference, 2018

2017
Decidability and complexity for quiescent consistency and its variations.
Inf. Comput., 2017

Relational Convolution, Generalised Modalities and Incidence Algebras.
CoRR, 2017

Partial Semigroups and Convolution Algebras.
Arch. Formal Proofs, 2017

Proving Opacity via Linearizability: A Sound and Complete Method.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

Modularising Opacity Verification for Hybrid Transactional Memory.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

A Proof Method for Linearizability on TSO Architectures.
Proceedings of the Provably Correct Systems, 2017

2016
Convolution as a Unifying Concept: Applications in Separation Logic, Interval Calculi, and Concurrency.
ACM Trans. Comput. Log., 2016

Reducing Opacity to Linearizability: A Sound and Complete Method.
CoRR, 2016

Proving Opacity of a Pessimistic STM.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Decidability and Complexity for Quiescent Consistency.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Contextual Trace Refinement for Concurrent Objects: Safety and Progress.
Proceedings of the Formal Methods and Software Engineering, 2016

An Interval Logic for Stream-Processing Functions: A Convolution-Based Construction.
Proceedings of the Formal Techniques for Safety-Critical Systems, 2016

2015
Interval-based data refinement: A uniform approach to true concurrency in discrete and real-time systems.
Sci. Comput. Program., 2015

Verifying Linearisability: A Comparative Survey.
ACM Comput. Surv., 2015

Towards linking correctness conditions for concurrent objects and contextual trace refinement.
Proceedings of the Proceedings 17th International Workshop on Refinement, 2015

A Program Construction and Verification Tool for Separation Logic.
Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

Verifying Opacity of a Transactional Mutex Lock.
Proceedings of the FM 2015: Formal Methods, 2015

Defining Correctness Conditions for Concurrent Objects in Multicore Architectures.
Proceedings of the 29th European Conference on Object-Oriented Programming, 2015

2014
Deriving real-time action systems with multiple time bands using algebraic reasoning.
Sci. Comput. Program., 2014

Reasoning about goal-directed real-time teleo-reactive programs.
Formal Aspects Comput., 2014

Convolution, Separation and Concurrency.
CoRR, 2014

Principles for Verification Tools: Separation Logic.
CoRR, 2014

Verifying linearizability: A comparative survey.
CoRR, 2014

Verifying Linearizability on TSO Architectures.
Proceedings of the Integrated Formal Methods - 11th International Conference, 2014

Reasoning Algebraically About Refinement on TSO Architectures.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures.
Proceedings of the Hardware and Software: Verification and Testing, 2014

Quiescent Consistency: Defining and Verifying Relaxed Linearizability.
Proceedings of the FM 2014: Formal Methods, 2014

Admit Your Weakness: Verifying Correctness on TSO Architectures.
Proceedings of the Formal Aspects of Component Software - 11th International Symposium, 2014

2013
Deriving real-time action systems in a sampling logic.
Sci. Comput. Program., 2013

Simplifying proofs of linearisability using layers of abstraction.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013

Data refinement for true concurrency
Proceedings of the Proceedings 16th International Refinement Workshop, 2013

Comparing Degrees of Non-Determinism in Expression Evaluation.
Comput. J., 2013

A High-Level Semantics for Program Execution under Total Store Order Memory.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2013, 2013

2012
Fractional Permissions and Non-Deterministic Evaluators in Interval Temporal Logic.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012

Proving linearisability via coarse-grained abstraction
CoRR, 2012

Deriving Real-Time Action Systems Controllers from Multiscale System Specifications.
Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012

Rely/Guarantee Reasoning for Teleo-reactive Programs over Multiple Time Bands.
Proceedings of the Integrated Formal Methods - 9th International Conference, 2012

Towards an Algebra for Real-Time Programs.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

2011
Approximating Idealised Real-Time Specifications Using Time Bands.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

2010
Compositional Action System Derivation Using Enforced Properties.
Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

2009
Progress-based verification and derivation of concurrent programs
PhD thesis, 2009

A general technique for proving lock-freedom.
Sci. Comput. Program., 2009

Enforcing Safety and Progress Properties: An Approach to Concurrent Program Derivation.
Proceedings of the 20th Australian Software Engineering Conference (ASWEC 2009), 2009

2008
Streamlining progress-based derivations of concurrent programs.
Formal Aspects Comput., 2008

2007
Verifying Lock-Freedom Using Well-Founded Orders.
Proceedings of the Theoretical Aspects of Computing, 2007

2006
Extending the theory of Owicki and Gries with a logic of progress.
Log. Methods Comput. Sci., 2006

Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

Formalising Progress Properties of Non-blocking Programs.
Proceedings of the Formal Methods and Software Engineering, 2006

Derivation of Java Monitors.
Proceedings of the 17th Australian Software Engineering Conference (ASWEC 2006), 2006

2005
Concurrent Program Design in the Extended Theory of Owicki and Gries.
Proceedings of the Theory of Computing 2005, 2005


  Loading...