Scholar
Linhai Song
Google Scholar ID: RVQMz2sAAAAJ
Professor, Institute of Computing Technology, Chinese Academy of Sciences
Citations & Impact
Citations
1,659
H-index
17
i10-index
23
Publications
20
Co-authors
27
list available
Contact
Publications
Resume (English only)
Academic Achievements
- [{'Paper': 'How to Save My Gas Fees: Understanding and Detecting Real-World Gas Issues in Solidity Programs', 'Conference': "TSE'2025"}, {'Paper': 'SC-Bench: A Large-Scale Dataset for Smart Contract Auditing', 'Conference': "LLM4Code workshop@ICSE'2025"}, {'Paper': 'Understanding and Detecting Real-World Safety Issues in Rust', 'Conference': "TSE'2024"}, {'Paper': 'Rust-lancet: Automated Ownership-Rule-Violation Fixing with Behavior Preservation', 'Conference': "ICSE'2024"}, {'Paper': 'Generic Go to Go: Dictionary-Passing, Monomorphisation, and Hybrid', 'Conference': "OOPSLA'2022"}, {'Paper': 'Beyond Bot Detection: Combating Fraudulent Online Survey Takers', 'Conference': "WWW'2022"}, {'Paper': 'Learning and Programming Challenges of Rust: A Mixed-Methods Study', 'Conference': "ICSE'2022"}, {'Paper': 'Who Goes First? Detecting Go Concurrency Bugs via Message Reordering', 'Conference': "ASPLOS'2022"}, {'Paper': 'Algorithmic Profiling for Real-World Complexity Problems', 'Conference': "TSE'2021 (accepted as a journal-first paper by ICSE'2022)"}, {'Paper': 'Automatically Detecting and Fixing Concurrency Bugs in Go Software Systems', 'Conference': "ASPLOS'2021"}, {'Paper': 'VRLifeTime: An IDE Tool to Avoid Concurrency and Memory Bugs in Rust', 'Conference': "Demo@CCS'2020"}, {'Paper': 'Benchmarking Label Dynamics of VirusTotal Engines', 'Conference': "Demo@CCS'2020"}]
Background
- Professor at the Institute of Computing Technology, Chinese Academy of Sciences. Research spans systems, security, and software engineering, with the goal of enabling developers to build more efficient, reliable, and secure software systems.
Miscellany
- Looking for PhDs, masters, visiting scholars, visiting students, postdocs, and undergraduates at any time.
