Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yu Liang 0002

dblp:65/1700-2 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0001-5194-1271ORCID · verified

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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
2 papers
Concurrent programming · 46% Software testing · 46% Programming languages and type systems · 7%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 77% Trustworthy machine learning · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
DBMS bug detection
0.612022
Detecting Logical Bugs of DBMS with Coverage-based Guidance · USENIX Security Symposium 2022
Concurrent programming
concurrency bugs
0.612022
Who goes first? detecting go concurrency bugs via message reordering · ASPLOS 2022
Concurrent programming
concurrency bug detection
0.612022
Who goes first? detecting go concurrency bugs via message reordering · ASPLOS 2022
Software testing › fuzzing
coverage-guided fuzzing
0.612022
Detecting Logical Bugs of DBMS with Coverage-based Guidance · USENIX Security Symposium 2022
Software testing
fuzzing
0.612022
Detecting Logical Bugs of DBMS with Coverage-based Guidance · USENIX Security Symposium 2022
Programming languages and type systems › concurrent programming languages
go
0.212022
Who goes first? detecting go concurrency bugs via message reordering · ASPLOS 2022
Machine learning › Trustworthy machine learning
fairness
0.112020
Optimal and Non-Discriminative Rehabilitation Program Design for Opioid Addiction Among Homeless Youth · IJCAI 2020

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

mathematical optimization · 0.9counterfactual prediction · 0.9causal inference · 0.9message reordering detection · 0.6
YearPublicationVenuePosition
2022 Who goes first? detecting go concurrency bugs via message reordering
abstract
Go is a young programming language invented to build safe and efficient concurrent programs. It provides goroutines as lightweight threads and channels for inter-goroutine communication. Programmers are encouraged to explicitly pass messages through channels to connect goroutines, with the purpose of reducing the chance of making programming mistakes and introducing concurrency bugs. Go is one of the most beloved programming languages and has already been used to build many critical infrastructure software systems in the data-center environment. However, a recent study shows that channel-related concurrency bugs are still common in Go programs, severely hurting the reliability of the programs.
Shihao Xia, Yu Liang 0002, Linhai Song, Hong Hu 0004
ASPLOS3
2022 Detecting Logical Bugs of DBMS with Coverage-based Guidance
Yu Liang 0002, Hong Hu 0004
USENIX Security Symposium1
2020 Optimal and Non-Discriminative Rehabilitation Program Design for Opioid Addiction Among Homeless Youth
abstract
This paper presents CORTA, a software agent that designs personalized rehabilitation programs for homeless youth suffering from opioid addiction. Many rehabilitation centers treat opioid addiction in homeless youth by prescribing rehabilitation programs that are tailored to the underlying causes of addiction. To date, rehabilitation centers have relied on ad-hoc assessments and unprincipled heuristics to deliver rehabilitation programs to homeless youth suffering from opioid addiction, which greatly undermines the effectiveness of the delivered programs. CORTA addresses these challenges via three novel contributions. First, CORTA utilizes a first-of-its-kind real-world dataset collected from ~1400 homeless youth to build causal inference models which predict the likelihood of opioid addiction among these youth. Second, utilizing counterfactual predictions generated by our causal inference models, CORTA solves novel optimization formulations to assign appropriate rehabilitation programs to the correct set of homeless youth in order to minimize the expected number of homeless youth suffering from opioid addiction. Third, we provide a rigorous experimental analysis of CORTA along different dimensions, e.g., importance of causal modeling, importance of optimization, and impact of incorporating fairness considerations, etc. Our simulation results show that CORTA outperforms baselines by ~110% in minimizing the number of homeless youth suffering from opioid addiction.
Amulya Yadav, Roopali Singh, Nikolas Siapoutis, Anamika Barman-Adhikari, Yu Liang 0002
IJCAI5