Остановите войну!
for scientists:
default search action
Naijun Zhan
- > Home > Persons > Naijun Zhan
Publications
- 2023
- [j39]Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan:
Lower Bounds for Possibly Divergent Probabilistic Programs. Proc. ACM Program. Lang. 7(OOPSLA1): 696-726 (2023) - [i36]Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan:
Lower Bounds for Possibly Divergent Probabilistic Programs. CoRR abs/2302.06082 (2023) - 2022
- [j36]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming. Inf. Comput. 289(Part): 104965 (2022) - [i26]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming. CoRR abs/2209.09703 (2022) - 2021
- [j32]Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter Nazier Mosaad, Naijun Zhan:
Indecision and delays are the parents of failure - taming them algorithmically by synthesizing delay-resilient control. Acta Informatica 58(5): 497-528 (2021) - [c79]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming. CAV (1) 2021: 443-466 - [i24]Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen:
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming. CoRR abs/2105.14311 (2021) - 2020
- [j25]Jian Wang, Jie An, Mingshuai Chen, Naijun Zhan, Lulin Wang, Miaomiao Zhang, Ting Gan:
From model to implementation: a network algorithm programming language. Sci. China Inf. Sci. 63(7) (2020) - [c73]Shenghua Feng, Mingshuai Chen, Bai Xue, Sriram Sankaranarayanan, Naijun Zhan:
Unbounded-Time Safety Verification of Stochastic Differential Dynamics. CAV (2) 2020: 327-348 - [c68]Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, Miaomiao Zhang:
Learning One-Clock Timed Automata. TACAS (1) 2020: 444-462 - 2019
- [c67]Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan:
NIL: Learning Nonlinear Interpolants. CADE 2019: 178-196 - [c65]Shenghua Feng, Mingshuai Chen, Naijun Zhan, Martin Fränzle, Bai Xue:
Taming Delays in Dynamical Systems - Unbounded Verification of Delay Differential Equations. CAV (1) 2019: 650-669 - [i21]Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan:
NIL: Learning Nonlinear Interpolants. CoRR abs/1905.11625 (2019) - [i20]Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, Miaomiao Zhang:
Learning One-Clock Timed Automata. CoRR abs/1910.10680 (2019) - 2018
- [j19]Ting Gan, Mingshuai Chen, Yangjia Li, Bican Xia, Naijun Zhan:
Reachability Analysis for Solvable Dynamical Systems. IEEE Trans. Autom. Control. 63(7): 2003-2018 (2018) - [c59]Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter Nazier Mosaad, Naijun Zhan:
What's to Come is Still Unsure - Synthesizing Controllers Resilient to Delayed Interaction. ATVA 2018: 56-74 - 2017
- [c52]Bai Xue, Peter Nazier Mosaad, Martin Fränzle, Mingshuai Chen, Yangjia Li, Naijun Zhan:
Safe Over- and Under-Approximation of Reachable Sets for Delay Differential Equations. FORMATS 2017: 281-299 - [p1]Mingshuai Chen, Xiao Han, Tao Tang, Shuling Wang, Mengfei Yang, Naijun Zhan, Hengjun Zhao, Liang Zou:
MARS: A Toolchain for Modelling, Analysis and Verification of Hybrid Systems. Provably Correct Systems 2017: 39-58 - 2016
- [c50]Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen:
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF. IJCAR 2016: 195-212 - [c49]Ting Gan, Mingshuai Chen, Yangjia Li, Bican Xia, Naijun Zhan:
Computing reachable sets of linear vector fields revisited. ECC 2016: 419-426 - [c48]Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter Nazier Mosaad, Naijun Zhan:
Validated Simulation-Based Verification of Delayed Differential Dynamics. FM 2016: 137-154 - [c46]Mingshuai Chen, Anders P. Ravn, Shuling Wang, Mengfei Yang, Naijun Zhan:
A Two-Way Path Between Formal and Informal Design of Embedded Systems. UTP 2016: 65-92 - [i11]Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen:
Interpolation synthesis for quadratic polynomial inequalities and combination with \textit{EUF}. CoRR abs/1601.04802 (2016) - 2015
- [c44]Ting Gan, Mingshuai Chen, Liyun Dai, Bican Xia, Naijun Zhan:
Decidability of the Reachability for a Family of Linear Vector Fields. ATVA 2015: 482-499 - [i8]Yangjia Li, Hui Lu, Naijun Zhan, Mingshuai Chen, Guohua Wu:
Termination Analysis of Polynomial Programs with Equality Conditions. CoRR abs/1510.05201 (2015)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint