Tan Khang Le

dblp:312/4873 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0002-1703-4066ORCID · reported

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

Computer networks · 1 · 1 first-author · 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%
Network and information security
1 paper
Network security · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › refinement
refinement proof
0.912025
Formalization, Implementation, and Verification of the Bluetooth L2CAP State Machine · MobiCom 2025
Program verification › model-based verification
state machine verification
0.912025
Formalization, Implementation, and Verification of the Bluetooth L2CAP State Machine · MobiCom 2025
Network security › wireless network security
bluetooth security
0.312025
Formalization, Implementation, and Verification of the Bluetooth L2CAP State Machine · MobiCom 2025
Automata and formal languages
finite automata
0.312025
Formalization, Implementation, and Verification of the Bluetooth L2CAP State Machine · MobiCom 2025

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

refinement · 2.6formal specification · 2.6dafny · 2.6
YearPublicationVenuePosition
2025 Formalization, Implementation, and Verification of the Bluetooth L2CAP State Machine
abstract
The Logical Link Control and Adaptation Protocol (L2CAP) is a core Bluetooth component, and verifying its correctness is crucial for reliable and secure connectivity. However, verification can be challenging due to the complexity and ambiguities in its natural language (English) specification. In this paper, we present a formally verified implementation of the L2CAP state machine. Our approach introduces the Specification State Machine (SSM) to formalize the L2CAP state machine in the specification and the Operational State Machine (OSM) as an abstraction of the implementation. We then formally prove that (i) OSM refines SSM, and (ii) our implementation semantically conforms to OSM. By combining these two proofs, we verify that our implementation complies with our formalization of the specification. Furthermore, we define critical safety and liveness properties and formally prove that our implementation satisfies these guarantees. To ensure practicality, we implement the L2CAP state machine in Dafny and integrate it into Android's Fluoride Bluetooth stack. Our evaluation demonstrates that our formally verified implementation maintains competitive performance while ensuring formal correctness.
Tan Khang Le, Mohammad Omidvar Tehrani, Yuepeng Wang 0001, Jianliang Wu 0002, Steven Y. Ko
MobiCom1