Zhijun Ding

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Cheng Chen

> Home > Persons > Zhijun Ding

Publications

2025
[j86]
- view
  authority control:
- export record
  dblp key:
  - journals/jss/DingLCH25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jss/DingLCH25
Zhijun Ding, Shuo Li, Cheng Chen, Cong He:
Program Dependence Net and on-demand slicing for property verification of concurrent system and software. J. Syst. Softw. 219: 112221 (2025)
2024
[j77]
- view
  authority control:
- export record
  dblp key:
  - journals/smr/LiCHD24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/smr/LiCHD24
Shuo Li, Cheng Chen, Zheng Huang, Zhijun Ding:
Change-aware model checking for evolving concurrent programs based on Program Dependence Net. J. Softw. Evol. Process. 36(6) (2024)
2023
[i7]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2301-11723
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2301-11723
Zhijun Ding, Shuo Li, Cheng Chen, Cong He:
Program Dependence Net and Its Slice for Verifying Linear Temporal Properties. CoRR abs/2301.11723 (2023)
2021
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/icsed/ChenLD21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icsed/ChenLD21
Cheng Chen, Shuo Li, Zhijun Ding:
Automatic Modeling Method for PThread Programs Based on Program Dependence Net. ICSED 2021: 9-18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.