Boon Thau Loo

Boon Thau Loo

Auto-generated profile, based on publicly available information

Boon Thau Loo

University of Pennsylvania, Philadelphia, PA, USA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 June 2019
Verified
Conference Paper
Open access
QZQizhen Zhang
Qizhen Zhang
AAAkash Acharya
Akash Acharya
HCHongzhi Chen
Hongzhi Chen
SASimran Arora
Simran Arora
ACAng Chen
Ang Chen
BLBoon Thau Loo
Boon Thau Loo

12 April 2024
Verified
Conference Paper
Open access
HCHaoxian Chen
Haoxian Chen
LLLan Lu
Lan Lu
BMBrendan Massey
Brendan Massey
YWYuepeng Wang
Yuepeng Wang
BLBoon Thau Loo
Boon Thau Loo
Smart contracts manage a large number of digital assets nowadays. Bugs in these contracts have led to significant financial loss. Verifying the correctness of smart contracts is, therefore, an important task. This paper presents an automated safety verification tool, DCV, that targets declarative smart contracts written in De-Con, a logic-based domain-specific language for smart contract implementation and specification. DCV proves safety properties by mathematical induction and can automatically infer inductive invariants using heuristic patterns, without annotations from the developer. Our evaluation on 23 benchmark contracts shows that DCV is effective in verifying smart contracts adapted from public repositories, and can verify contracts not supported by other tools. Furthermore, DCV significantly outperforms baseline tools in verification time.

1 January 2024 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
CWChenyuan Wu
Chenyuan Wu
MAMohammad Javad Amiri
Mohammad Javad Amiri
HQHaoyun Qin
Haoyun Qin
BMBhavana Mehta
Bhavana Mehta
RMRyan Marcus
Ryan Marcus
BLBoon Thau Loo
Boon Thau Loo
This paper articulates our vision for a learning-based untrustworthy distributed database. We focus on permissioned blockchain systems as an emerging instance of untrustworthy distributed databases...

5 December 2022
Verified
Conference Paper
Open access
NSNik Sultana
Nik Sultana
HZHenry Zhu
Henry Zhu
KZKe Zhong
Ke Zhong
ZZZhilei Zheng
Zhilei Zheng
RMRuijie Mao
Ruijie Mao
BLBoon Thau Loo
Boon Thau Loo
Privilege separation (privsep) is an effective technique for improving software’s security, but privsep involves decomposing software into components and assigning them different privileges. This is often laborious and error-prone. This paper contributes the following for applying privsep to C software: (1) a portable, lightweight, and distributed runtime library that abstracts externally-enforced compartment isolation; (2) an abstract compartmentalization model of software for reasoning about privsep; and (3) a privsep-aware Clang-based tool for code analysis and semi-automatic software transformation to use the runtime library. The evaluation spans 19 compartmentalizations of third-party software and examines: Security: 4 CVEs in widely-used software were rendered unexploitable; Approximate Effort Saving: on average, the synthesis-to-annotation code ratio was greater than 11.9 (i.e., 10 × lines of code were generated for each annotation); and Overhead: execution-time overhead was less than 2%, and memory overhead was linear in the number of compartments.

20 March 2021
Verified
Book Chapter
Open access
PDF file
LSLei Shi
Lei Shi
YLYahui Li
Yahui Li
BLBoon Thau Loo
Boon Thau Loo
RARajeev Alur
Rajeev Alur
Writing classification rules to identify interesting network traffic is a time-consuming and error-prone task. Learning-based classification systems automatically extract such rules from positive and negative traffic examples. However, due to limitations in the representation of network traffic and the learning strategy, these systems lack both expressiveness to cover a range of applications and interpretability in fully describing the traffic’s structure at the session layer. This paper presents Sharingan system, which uses program synthesis techniques to generate network classification programs at the session layer. Sharingan accepts raw network traces as inputs and reports potential patterns of the target traffic in NetQRE, a domain specific language designed for specifying session-layer quantitative properties. We develop a range of novel optimizations that reduce the synthesis time for large and complex tasks to a matter of minutes. Our experiments show that Sharingan is able to correctly identify patterns from a diverse set of network traces and generates explainable outputs, while achieving accuracy comparable to state-of-the-art learning-based systems.

1 November 2013 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
CLChangbin Liu
Changbin Liu
RCRicardo Correa
Ricardo Correa
HGHarjot Gill
Harjot Gill
TGTanveer Gill
Tanveer Gill
XLXiaozhou Li
Xiaozhou Li
PBPrithwish Basu
Prithwish Basu
This paper presents the design and implementation of PUMA, a declarative constraint-solving platform for policy-based routing and channel selection in multiradio wireless mesh networks. In PUMA, users formulate channel selection policies as optimization goals and constraints that are concisely declared using the Colog declarative language. To efficiently execute Colog programs in a distributed setting, PUMA integrates a high-performance constraint solver with a declarative networking engine. We demonstrate the capabilities of PUMA in defining distributed protocols that cross-optimize across channel selection and routing. We have developed a prototype of the PUMA system that we extensively evaluated in simulations and on the ORBIT testbed. Our experimental results demonstrate that PUMA can flexibly and efficiently implement a variety of centralized and distributed channel selection protocols that result in significantly higher throughput compared to single-channel and identical-channel assignment solutions.