# 用户:Hengfeng-Wei

## 目录

- 1 Profile
- 2 Research Interests
- 3 Publications
- 3.1 Specification Framework for Weakly Consistent Replicated Data Types
- 3.2 Jupiter Made Abstract, and then Refined
- 3.3 Specification and Implementation of Replicated List: The Jupiter Protocol Revisited
- 3.4 Parameterized and Runtime-tunable Snapshot Isolation in Distributed Transactional Key-value Stores
- 3.5 Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems
- 3.6 Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas
- 3.7 Formal Specification and Runtime Detection of Temporal Properties for Asynchronous Context

- 4 Projects
- 5 Links

## Profile

Hengfeng Wei (魏恒峰) cv (en)

- Research Assistant (助理研究员)：From 2017-01

Institute of Computer Software (软件所) State Key Laboratory for Novel Software Technology (软件新技术国家重点实验室) Department of Computer Science and Technology (计算机科学与技术系) Nanjing University （Xianlin Campus） (南京大学 仙林校区) Addr: 163 Xianlin Road, Qixia District, Nanjing, Jiangsu 210023, China (江苏省南京市栖霞区仙林大道163号南京大学仙林校区 210023)

Office: 302 Mailbox: H016 Email:

## Research Interests

I am interested in Distributed Computing Theory and Formal Methods.

## Publications

- [SpecFramework]: Specification Framework for Weakly Consistent Replicated Data Types (WIP)
- [RefineJupiter]: Jupiter Made Abstract, and then Refined (WIP)
- [Jupiter]: Specification and Implementation of Replicated List: The Jupiter Protocol Revisited
- [RVSI]: Parameterized and Runtime-tunable Snapshot Isolation in Distributed Transactional Key-value Stores
- [PA2AM]: Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems
- [VPC]: Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas
- [CTL3]: Formal Specification and Runtime Detection of Temporal Properties for Asynchronous Context

### Specification Framework for Weakly Consistent Replicated Data Types

Work in Progress.

### Jupiter Made Abstract, and then Refined

Work in Progress.

More details and comments are coming when the work is ready.

### Specification and Implementation of Replicated List: The Jupiter Protocol Revisited

Hengfeng Wei, Yu Huang, and Jian Lu. “Specification and Implementation of Replicated List: The Jupiter Protocol Revisited”. In: 22nd International Conference on Principles of Distributed Systems, OPODIS 2018, December 17-19, 2018, Hong Kong, China. 2018, 12:1–12:16. url: https://doi.org/10.4230/LIPIcs.OPODIS.2018.12

Hengfeng Wei, Yu Huang, and Jian Lu. “Brief Announcement: Specification and Implementation of Replicated List: The Jupiter Protocol Revisited”. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. PODC ’18. Egham, United Kingdom: ACM, 2018, pp. 81–83. url: http://doi.acm.org/10.1145/3212734.3212

Paper: Jupiter@PODC-BA'2018 Paper: Jupiter@OPODIS'2018 [Paper: Jupiter@arXiv (full version)]

This work is inspired by the work on "Specification and Complexity of Collaborative Text Editing" published in PODC'2016 by Hagit Attiya et al.

More details and comments are coming when the work is ready.

### Parameterized and Runtime-tunable Snapshot Isolation in Distributed Transactional Key-value Stores

Hengfeng Wei, Yu Huang, Jian Lu. Parameterized and Runtime-tunable Snapshot Isolation in Distributed Transactional Key-value Stores. InProc. of the 36th International Symposium on Reliable Distributed Systems (SRDS), pp. 21--33, Hong Kong, China, Sep.2017. [Paper:RVSI@SRDS17]

The formal specification of RVSI (Relaxed Version Snapshot Isolation) in this work is partly inspired by the work on "Relaxed Currency Serializability for Middle-Tier Caching and Replication" published in SIGMOD'2006 by Philip A.Bernstein *et al*.

It is the first time we use Aliyun in our experiments. This will be the normal case in the future.

**Important Lessons Learnt:**

- Solve the real problems in realistic ways!

One can always find made up examples of ..., but it is hard to convince that .... This paper does not go beyond .... --- From Reviewers

- System research greatly matters!

The following is all about the experimental section, which is probably the weakest part of the paper. --- From Reviewers

### Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems

Hengfeng Wei, Yu Huang, Jian Lu. Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems. InIEEE Trans. Comput.(IEEE Transactions on Computers), 66(3):502--514, doi:10.1109/TC.2016.2601322, March 2017. [abstract@IEEE] [Paper: PA2AM@TC'2017] [Paper: PA2AM@arXiv (not up-to-date)]

Last night (2016-10-13), I reread the paper "On Interprocess Communication --- Part II: Algorithms" of Leslie Lamport, and found that in Proposition 5, Lamport has proved that in the single-writer model a regular register is atomic if two successive reads that overlap the same write cannot obtain the new then the old value. The phenomenon that "two successive reads that overlap the same write cannot obtain the new then the old value" is exactly the old-new inversion anomaly. Therefore, Lamport has shown that a regular register is atomic if it does not allow old-new inversion anomalies. This is very similar to Theorem 1 in our paper which essentially states that the PA2AM algorithm implements a 2-atomic register *and* the old-new inversion anomaly is the only cause of atomicity violation.

The major difference between Proposition 5 of Lamport and Theorem 1 in our paper is that Proposition 5 is at the specification level while Theorem 1 is at the implementation level.

Combining Proposition 5 and Theorem 1, we obtain

- Conjecture 1
- In the single-writer model, 2-atomicity is equivalent to regularity.

- Conjecture 2
- In the single-write model, PA2AM implements a regular register.

### Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas

Hengfeng Wei, Marzio De Biasi, Yu Huang, Jiannong Cao, and Jian Lu. Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas. InIEEE Trans. Parallel Distrib. Syst., 27(5):1511--1523, May 2016, doi:10.1109/TPDS.2015.2453985 [abstract@IEEE] [Paper: VPC@TPDS'2016] [Paper: VPC@arXiv(not up-to-date)] SCI: DJ5HS

In the Conclusion section, we discussed the VCC (Verifying Causal Consistency) problem and wrote: "Because Pipelined-RAM is a weakening of causal consistency, our NP-complete result also applies to the general problem of verifying causal consistency".

I am sorry to say that it is not right for us to conclude that VCC, in general, (i.e., VCC-SD in our terms) is NP-complete just because Pipelined-RAM is a weakening of causal consistency.

However, I think that VCC-SD is NP-complete and that the basic idea of the polynomial reduction used in the NP-complete proof for VPC-SD will be useful in proving the NP-completeness of VCC-SD.

The NP-completeness proof for VPC-SD (along with VPC-MD) is mainly credited to Marzio De Biasi, the second author of this paper.

### Formal Specification and Runtime Detection of Temporal Properties for Asynchronous Context

Hengfeng Wei, Yu Huang, Jiannong Cao, Xiaoxing Ma, Jian Lu. Formal Specification and Runtime Detection of Temporal Properties for Asynchronous Context. InProceedings of the 10th IEEE International Conference on Pervasive Computing and Communications(IEEE PerCom '12), pages 30--38, 2012.[abstract@IEEE] [Paper: CTL3@PerCom'2012] EI: 20122315082503