Lingjia Tang

Lingjia Tang

Auto-generated profile, based on publicly available information

Lingjia Tang

University of Michigan, Ann Arbor, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
3 December 2011
Verified
Conference Paper
Open access
PDF file
JMJason Mars
Jason Mars
LTLingjia Tang
Lingjia Tang
RHRobert Hundt
Robert Hundt
KSKevin Skadron
Kevin Skadron
MSMary Lou Soffa
Mary Lou Soffa

4 April 2017 in ACM SIGOPS Operating Systems Review
Verified
Journal Article
Open access
PDF file
QCQuan Chen
Quan Chen
HYHailong Yang
Hailong Yang
MGMinyi Guo
Minyi Guo
RKRam Srivatsa Kannan
Ram Srivatsa Kannan
JMJason Mars
Jason Mars
LTLingjia Tang
Lingjia Tang

18 May 2023 in IEEE Computer Architecture Letters
Verified
Journal Article
Open access
JMJason Mars
Jason Mars
YKYiping Kang
Yiping Kang
RDRoland Daynauth
Roland Daynauth
BLBaichuan Li
Baichuan Li
AMAshish Mahendra
Ashish Mahendra
LTLingjia Tang
Lingjia Tang
Today's production scale-out applications include many sub-application components, such as storage backends, logging infrastructure and AI models. These components have drastically different characteristics, are required to work in collaboration, and interface with each other as microservices. This leads to increasingly high complexity in developing, optimizing, configuring, and deploying scale-out applications, raising the barrier to entry for most individuals and small teams. We developed a novel co-designed runtime system, Jaseci , and programming language, Jac , which aims to reduce this complexity. The key design principle throughout Jaseci's design is to raise the level of abstraction by moving as much of the scale-out data management, microservice componentization, and live update complexity into the runtime stack to be automated and optimized automatically. We use real-world AI applications to demonstrate Jaseci's benefit for application performance and developer productivity.

9 October 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
JDJayanaka L. Dantanarayana
Jayanaka L. Dantanarayana
YKYiping Kang
Yiping Kang
KSKugesan Sivasothynathan
Kugesan Sivasothynathan
CCChristopher Clarke
Christopher Clarke
BLBaichuan Li
Baichuan Li
JMJason Mars
Jason Mars
Software development is shifting from traditional programming to AI-integrated applications that leverage generative AI and large language models (LLMs) during runtime. However, integrating LLMs remains complex, requiring developers to manually craft prompts and process outputs. Existing tools attempt to assist with prompt engineering, but often introduce additional complexity. This paper presents Meaning-Typed Programming (MTP) , a novel paradigm that abstracts LLM integration through intuitive language-level constructs. By leveraging the inherent semantic richness of code, MTP automates prompt generation and response handling without additional developer effort. We introduce the (1) by operator for seamless LLM invocation, (2) MT-IR , a meaning-based intermediate representation for semantic extraction, and (3) MT-Runtime , an automated system for managing LLM interactions. We implement MTP in Jac , a programming language that supersets Python, and find that MTP significantly reduces coding complexity while maintaining accuracy and efficiency. MTP significantly reduces development complexity, lines of code modifications needed, and costs while improving run-time performance and maintaining or exceeding the accuracy of existing approaches. Our user study shows that developers using MTP completed tasks 3.2× faster with 45% fewer lines of code compared to existing frameworks. Moreover, demonstrates resilience even when up to 50% of naming conventions are degraded, demonstrating robustness to suboptimal code. is developed as part of the Jaseci open-source project, and is available under the module byLLM .

15 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
CCChristopher Clarke
Christopher Clarke
JPJoseph Joshua Peper
Joseph Joshua Peper
KKK. Krishnamurthy
K. Krishnamurthy
WTWalter Talamonti
Walter Talamonti
KLKevin Leach
Kevin Leach
JMJason Mars
Jason Mars
The increasing volume of commercially available conversational agents (CAs) on the market has resulted in users being burdened with learning and adopting multiple agents to accomplish their tasks. Though prior work has explored supporting a multitude of domains within the design of a single agent, the interaction experience suffers due to the large action space of desired capabilities. To address these problems, we introduce a new task BBAI: Black-Box Agent Integration, focusing on combining the capabilities of multiple black-box CAs at scale. We explore two techniques: question agent pairing and question response pairing aimed at resolving this task. Leveraging these techniques, we design One For All (OFA), a scalable system that provides a unified interface to interact with multiple CAs. Additionally, we introduce MARS: Multi-Agent Response Selection, a new encoder model for question response pairing that jointly encodes user question and agent response pairs. We demonstrate that OFA is able to automatically and accurately integrate an ensemble of commercially available CAs spanning disparate domains. Specifically, using the MARS encoder we achieve the highest accuracy on our BBAI task, outperforming strong baselines.