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

Kunyan Liu

dblp:38/3692 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0007-2071-6750ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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.

Network and information security
2 papers
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security
memory safety
1.522025
CHERIoT RTOS: An OS for Fine-Grained Memory-Safe Compartments on Low-Cost Embedded Devices · SOSP 2025
CHERIoT: Complete Memory Safety for Embedded Devices · MICRO 2023
Embedded and real-time systems
embedded system security
0.212023
CHERIoT: Complete Memory Safety for Embedded Devices · MICRO 2023

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

capability-based addressing · 1.3
YearPublicationVenuePosition
2025 CHERIoT RTOS: An OS for Fine-Grained Memory-Safe Compartments on Low-Cost Embedded Devices
abstract
Embedded systems do not benefit from strong memory protection, because they are designed to minimize cost. At the same time, there is increasing pressure to connect embedded devices to the internet, where their vulnerable nature makes them routinely subject to compromise. This fundamental tension leads to the current status-quo where exploitable devices put individuals and critical infrastructure at risk.
Saar Amar, David Chisnall, Nathaniel Wesley Filardo, Ben Laurie, Hugo Lefeuvre, Kunyan Liu, Simon W. Moore, Robert Norton-Wright, Margo I. Seltzer, Yucong Tao, Robert N. M. Watson, Hongyan Xia
SOSP7
2023 CHERIoT: Complete Memory Safety for Embedded Devices
abstract
The ubiquity of embedded devices is apparent. The desire for increased functionality and connectivity drives ever larger software stacks, with components from multiple vendors and entities. These stacks should be replete with isolation and memory safety technologies, but existing solutions impinge upon development, unit cost, power, scalability, and/or real-time constraints, limiting their adoption and production-grade deployments. As memory safety vulnerabilities mount, the situation is clearly not tenable and a new approach is needed.
Saar Amar, David Chisnall, Nathaniel Wesley Filardo, Ben Laurie, Kunyan Liu, Robert M. Norton, Simon W. Moore, Yucong Tao, Robert N. M. Watson, Hongyan Xia
MICRO6
1997 A Measurement-Based CAC Strategy for ATM Networks
abstract
In ATM networks, connection admission control (CAC) has been recognized as one of the most important means to provide satisfactory quality of service (QoS) and protect the network from congestion, especially for supporting real-time services such as voice and video. An efficient CAC strategy, which can both guarantee the QoS of admitted connections and achieve good resource utilization, then becomes a crucial issue for ATM network providers. The concept of a user-network traffic contract has been introduced by the ATM Forum. Starting from this point, we propose a measurement-based CAC strategy. We first discuss how to obtain an accurate description (traffic parameters) of user traffic by using on-line measurement in conjunction with dynamic renegotiation. The results show that the proposed strategy is reliable and simple to implement. We then move on to examine the possibility and methodology for exploiting the effect of statistical multiplexing in resource allocation to achieve higher network resource utilization.
Kunyan Liu, David W. Petr, Cameron Braun
ICC (3)1