English
Related papers

Related papers: Solving the TTC 2011 Reengineering Case with MOLA …

200 papers

Low-Rank Adaptation (LoRA) is a popular technique for parameter-efficient fine-tuning of Large Language Models (LLMs). We study how different LoRA modules can be merged to achieve skill composition -- testing the performance of the merged…

Computation and Language · Computer Science 2024-12-03 Akshara Prabhakar , Yuanzhi Li , Karthik Narasimhan , Sham Kakade , Eran Malach , Samy Jelassi

Fuelled by the popularity of the transformer architecture in deep learning, several works have investigated what formal languages a transformer can learn from data. Nonetheless, existing results remain hard to compare due to methodological…

Machine Learning · Computer Science 2025-09-30 Rik Adriaensen , Jaron Maene

While Foundation Models provide a general tool for rapid content creation, they regularly require task-specific adaptation. Traditionally, this exercise involves careful curation of datasets and repeated fine-tuning of the underlying model.…

Machine Learning · Computer Science 2025-06-10 Rujikorn Charakorn , Edoardo Cetin , Yujin Tang , Robert Tjarko Lange

Large Language Models (LLMs) have showcased impressive capabilities in handling straightforward programming tasks. However, their performance tends to falter when confronted with more challenging programming problems. We observe that…

Machine Learning · Computer Science 2025-04-01 Jingyao Li , Pengguang Chen , Bin Xia , Hong Xu , Jiaya Jia

This case comprises several primitive tasks that can be solved straight away with most transformation tools. The aim is to cover the most important kinds of primitive operations on models, i.e. create, read, update and delete (CRUD). To…

Software Engineering · Computer Science 2011-11-22 Steffen Mazanek

We lift the computability path order and its extensions from plain higher-order rewriting to higher-order rewriting on beta-eta-normal forms where matching modulo beta-eta is employed. The resulting order NCPO is shown to be useful on…

Logic in Computer Science · Computer Science 2025-05-29 Johannes Niederhauser , Aart Middeldorp

In this paper, we explore how to leverage large language models (LLMs) to solve mathematical problems efficiently and accurately. Specifically, we demonstrate the effectiveness of classifying problems into distinct categories and employing…

Computation and Language · Computer Science 2024-12-24 Amogh Akella

Tree Regular Model Checking (TRMC) is the name of a family of techniques for analyzing infinite-state systems in which states are represented by terms, and sets of states by Tree Automata (TA). The central problem in TRMC is to decide…

Formal Languages and Automata Theory · Computer Science 2012-03-09 Thomas Genet , Tristan Le Gall , Axel Legay , Valerie Murat

Code completion aims at speeding up code writing by predicting the next code token(s) the developer is likely to write. Works in this field focused on improving the accuracy of the generated predictions, with substantial leaps forward made…

We report two essential improvements in readability assessment: 1. three novel features in advanced semantics and 2. the timely evidence that traditional ML models (e.g. Random Forest, using handcrafted features) can combine with…

Computation and Language · Computer Science 2024-06-18 Bruce W. Lee , Yoo Sung Jang , Jason Hyung-Jong Lee

Running Large Language Models (LLMs) on edge devices is constrained by high compute and memory demands posing a barrier for real-time applications in sectors like healthcare, education, and embedded systems. Current solutions such as…

The Transformer model has revolutionized Natural Language Processing tasks such as Neural Machine Translation, and many efforts have been made to study the Transformer architecture, which increased its efficiency and accuracy. One potential…

Computation and Language · Computer Science 2023-08-17 Daniela N. Rim , Kimera Richard , Heeyoul Choi

Testing Deep Learning (DL) systems is a complex task as they do not behave like traditional systems would, notably because of their stochastic nature. Nonetheless, being able to adapt existing testing techniques such as Mutation Testing…

Machine Learning · Computer Science 2023-01-16 Florian Tambon , Vahid Majdinasab , Amin Nikanjam , Foutse Khomh , Giuliano Antonio

Building helpful and harmless large language models (LLMs) requires effective model alignment approach based on human instructions and feedback, which necessitates high-quality human-labeled data. Constructing such datasets is often…

Computation and Language · Computer Science 2025-05-07 Junlin Wang , Roy Xie , Shang Zhu , Jue Wang , Ben Athiwaratkun , Bhuwan Dhingra , Shuaiwen Leon Song , Ce Zhang , James Zou

We argue that the implementation and verification of compilers for functional programming languages are greatly simplified by employing a higher-order representation of syntax known as Higher-Order Abstract Syntax or HOAS. The underlying…

Programming Languages · Computer Science 2017-02-14 Yuting Wang

Abstract interpretation offers a powerful toolset for static analysis, tackling precision, complexity and state-explosion issues. In the literature, state partitioning abstractions based on (bi)simulation and property-preserving state…

Logic in Computer Science · Computer Science 2025-06-09 Paolo Baldan , Roberto Bruni , Francesco Ranzato , Diletta Rigo

Recently, Large Language Models (LLMs) have achieved amazing zero-shot learning performance over a variety of Natural Language Processing (NLP) tasks, especially for text generative tasks. Yet, the large size of LLMs often leads to the high…

Computation and Language · Computer Science 2023-09-21 Yukang Xie , Chengyu Wang , Junbing Yan , Jiyong Zhou , Feiqi Deng , Jun Huang

Large Transformer models achieved the state-of-the-art status for Natural Language Understanding tasks and are increasingly becoming the baseline model architecture for modeling source code. Transformers are usually pre-trained on large…

Software Engineering · Computer Science 2022-09-21 Andrei Zlotchevski , Dawn Drain , Alexey Svyatkovskiy , Colin Clement , Neel Sundaresan , Michele Tufano

Learning a set of tasks over time, also known as continual learning (CL), is one of the most challenging problems in artificial intelligence due to catastrophic forgetting. Large language models (LLMs) are often impractical to frequent…

Machine Learning · Computer Science 2025-10-28 Jaya Krishna Mandivarapu

Large Language Models are transforming software development by automatically generating code. Current prompting techniques such as Chain-of-Thought (CoT) suggest tasks step by step and the reasoning process follows a linear structure, which…

Software Engineering · Computer Science 2025-03-18 Ruwei Pan , Hongyu Zhang