Chao Wang

Orcid: 0000-0003-3524-7583

Affiliations:
  • Southwest University, Chongqing, China
  • Chinese Academy of Sciences, Institute of Software, State Key Laboratory of Computer Science, Beijing, China
  • University of Chinese Academy of Sciences, Beijing, China


According to our database1, Chao Wang authored at least 18 papers between 2015 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Decidability of Liveness on the TSO Memory Model.
Formal Aspects Comput., March, 2026

A Forward Simulation-Based Hierarchy of Linearizable Concurrent Objects.
CoRR, January, 2026

2025
Checking Linearizability of Multi-core Task Management and Scheduling System.
Proceedings of the Engineering of Complex Computer Systems - 29th International Conference, 2025

2024
Polling Sanitization to Balance I/O Latency and Data Security of High-density SSDs.
ACM Trans. Storage, May, 2024

Universal Construction for Linearizable but Not Strongly Linearizable Concurrent Objects.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2024

2023
A contract-based semantics and refinement for hybrid Simulink block diagrams.
J. Syst. Archit., October, 2023

Towards correctness proof for hybrid Simulink block diagrams.
J. Syst. Archit., 2023

VeriLin: A Linearizability Checker for Large-Scale Concurrent Objects.
Proceedings of the Theoretical Aspects of Software Engineering, 2023

2022
Decidability of Liveness for Concurrent Objects on the TSO Memory Model.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2022

A Contract-Based Semantics and Refinement for Simulink.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2022

2021
Decidability of Liveness on the TSO Memory Model.
CoRR, 2021

2019
Replication-aware linearizability.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Decidability of linearizabilities for relaxed data structures.
Sci. China Inf. Sci., 2018

2017
Decomposable Relaxation for Concurrent Data Structures.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Checking Linearizability of Concurrent Priority Queues.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Bounded TSO-to-SC Linearizability Is Decidable.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
TSO-to-TSO Linearizability Is Undecidable.
Proceedings of the Automated Technology for Verification and Analysis, 2015

Quasi-Linearizability is Undecidable.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015


  Loading...