English
Related papers

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

200 papers

Parallel programs in high performance computing (HPC) continue to grow in complexity and scale in the exascale era. The diversity in hardware and parallel programming models make developing, optimizing, and maintaining parallel software…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-15 Daniel Nichols , Aniruddha Marathe , Harshitha Menon , Todd Gamblin , Abhinav Bhatele

We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition…

Formal Languages and Automata Theory · Computer Science 2017-09-08 David Müller , Salomon Sickert

Open-sourced large language models (LLMs) have demonstrated remarkable efficacy in various tasks with instruction tuning. However, these models can sometimes struggle with tasks that require more specialized knowledge such as translation.…

Computation and Language · Computer Science 2024-01-23 Jiali Zeng , Fandong Meng , Yongjing Yin , Jie Zhou

The paper combines research approaches that traditionally have been disjoint: 1) model checking as used in formal verification of programs, and 2) auto-tuning as often used in high-performance computing. Auto-tuning frameworks optimize…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-17 Natalia Garanina , Sergey Staroletov , Sergei Gorlatch

Personalized Large Language Models (PLLMs) aim to align model outputs with individual user preferences, a crucial capability for user-centric applications. However, the prevalent approach of fine-tuning a separate module for each user faces…

Computation and Language · Computer Science 2025-11-27 Xiaopeng Li , Yuanjin Zheng , Wanyu Wang , wenlin zhang , Pengyue Jia , Yiqi Wang , Maolin Wang , Xuetao Wei , Xiangyu Zhao

Despite the promise of Vision-Language-Action (VLA) models as generalist robotic controllers, their robustness against perceptual noise and environmental variations in out-of-distribution (OOD) tasks remains fundamentally limited by the…

Robotics · Computer Science 2026-03-30 Zhuoran Li , Zhiyang Li , Kaijun Zhou , Jinyu Gu

Behavioral models are incredibly useful for understanding and validating software. However, the automatic extraction of such models from actual industrial code remains a largely unsolved problem with current solutions often not scaling well…

Software Engineering · Computer Science 2024-11-20 P. H. M. van Spaendonck

The automated translation of C code to Java code is a notoriously difficult task, fraught with challenges stemming from fundamental paradigm shifts (procedural vs. Object Oriented), memory models (manual pointers vs. Garbage Collection),…

Software Engineering · Computer Science 2025-12-15 Aryan Gupta , Y. Raghu Reddy

LoRA (Low-Rank Adaptation) has emerged as a preferred method for efficiently adapting Large Language Models (LLMs) with remarkable simplicity and efficacy. This note extends the original LoRA paper by offering new perspectives that were not…

Machine Learning · Computer Science 2024-04-09 Vlad Fomenko , Han Yu , Jongho Lee , Stanley Hsieh , Weizhu Chen

Deep learning (DL) techniques are gaining more and more attention in the software engineering community. They have been used to support several code-related tasks, such as automatic bug fixing and code comments generation. Recent studies in…

We propose TANDA, an effective technique for fine-tuning pre-trained Transformer models for natural language tasks. Specifically, we first transfer a pre-trained model into a model for a general task by fine-tuning it with a large and…

Computation and Language · Computer Science 2019-11-21 Siddhant Garg , Thuy Vu , Alessandro Moschitti

Transforming constraint models is an important task in re- cent constraint programming systems. User-understandable models are defined during the modeling phase but rewriting or tuning them is manda- tory to get solving-efficient models. We…

Artificial Intelligence · Computer Science 2010-02-17 Raphael Chenouard , Laurent Granvilliers , Ricardo Soto

With the rapid advancements in Large Language Models (LLMs), an increasing number of studies have leveraged LLMs as the cognitive core of agents to address complex task decision-making challenges. Specially, recent research has demonstrated…

Multiagent Systems · Computer Science 2025-03-13 Di Zhao , Longhui Ma , Siwei Wang , Miao Wang , Zhao Lv

Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…

Logic in Computer Science · Computer Science 2015-07-01 Roland Axelsson , Martin Lange , Rafal Somla

Delta-oriented programming (DOP) is a flexible transformational approach to implement software product lines. In delta-oriented product lines, variants are generated by applying operations contained in delta modules to a (possibly empty)…

Software Engineering · Computer Science 2016-04-04 Ferruccio Damiani , Michael Lienhardt

Computer architectures become more and more complex. It requires more effort to develop techniques that improve the programs of performance and allow to exploit material resources efficiently. As a result, many transformations are applied…

Programming Languages · Computer Science 2019-08-06 Asma Balamane , Zina Taklit

We present a prototype of a tool leveraging the synergy of model driven engineering (MDE) and Large Language Models (LLM) for the purpose of software development process automation in the automotive industry. In this approach, the…

This article addresses the generation of the ETL operators(Extract-Transform-Load) for supplying a Data Warehouse from a relational data source. As a first step, we add new rules to those proposed by the authors of [1], these rules deal…

Databases · Computer Science 2012-12-27 Wided Bakari , Mouez Ali , Hanene Ben-Abdallah

We propose to achieve explainable neural machine translation (NMT) by changing the output representation to explain itself. We present a novel approach to NMT which generates the target sentence by monotonically walking through the source…

Computation and Language · Computer Science 2018-08-30 Felix Stahlberg , Danielle Saunders , Bill Byrne

Type checking algorithms and theorem provers rely on unification algorithms. In presence of type families or higher-order logic, higher-order (pre)unification (HOU) is required. Many HOU algorithms are expressed in terms of…

Logic in Computer Science · Computer Science 2024-02-27 Nikolai Kudasov