Liangran Zhao

dblp:439/0849 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification
termination analysis
1.012026
On termination of polynomial programs with equality conditions · Inf. Comput. 2026
Logic in computer science
program semantics
1.012026
On termination of polynomial programs with equality conditions · Inf. Comput. 2026

Methods — techniques the papers use, named apart from their topics

polynomial invariant synthesis · 2.0algebraic geometry · 2.0
YearPublicationVenuePosition
2026 On termination of polynomial programs with equality conditions
Yangjia Li, Mingshuai Chen, Liangran Zhao, Naijun Zhan, Joost-Pieter Katoen
Inf. Comput.3