English
Related papers

Related papers: A Tool for Automated Reasoning About Traces Based …

200 papers

This work introduces a tool for generating runtime configurations automatically from textual requirements stored as artifacts in git repositories (a.k.a. T-Reqs) alongside the software code. The tool leverages T-Reqs-modelled architectural…

Software Engineering · Computer Science 2024-04-29 Abdullatif AlShriaf , Hans-Martin Heyn , Eric Knauss

In this position paper, we propose a reasoning framework that can model the reasoning process underlying natural language inferences. The framework is based on the semantic tableau method, a well-studied proof system in formal logic. Like…

Computation and Language · Computer Science 2025-02-10 Lasha Abzianidze

Background: Establishing traceability from requirements documents to downstream artifacts early can be beneficial as it allows engineers to reason about requirements quality (e.g. completeness, consistency, redundancy). However, creating…

Software Engineering · Computer Science 2023-11-22 Michael Unterkalmsteiner

Conversational recommender systems (CRS) aim to timely trace the dynamic interests of users through dialogues and generate relevant responses for item recommendations. Recently, various external knowledge bases (especially knowledge graphs)…

Artificial Intelligence · Computer Science 2023-07-21 Wendi Li , Wei Wei , Xiaoye Qu , Xian-Ling Mao , Ye Yuan , Wenfeng Xie , Dangyang Chen

Recent advances in reasoning-focused Large Language Models (LLMs) have introduced Chain-of-Thought (CoT) traces - intermediate reasoning steps generated before a final answer. These traces, as in DeepSeek R1, guide inference and train…

Computation and Language · Computer Science 2026-04-20 Siddhant Bhambri , Upasana Biswas , Subbarao Kambhampati

The central challenge in robotic manipulation of deformable objects lies in aligning high-level semantic instructions with physical interaction points under complex appearance and texture variations. Due to near-infinite degrees of freedom,…

Robotics · Computer Science 2026-01-29 Wanjun Jia , Kang Li , Fan Yang , Mengfei Duan , Wenrui Chen , Yiming Jiang , Hui Zhang , Kailun Yang , Zhiyong Li , Yaonan Wang

The work relates to the automatic generation of logical specifications, considered as sets of temporal logic formulas, extracted directly from developed software models. The extraction process is based on the assumption that the whole…

Software Engineering · Computer Science 2014-06-27 Radoslaw Klimek

Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…

Logic in Computer Science · Computer Science 2022-02-02 Alessandro Artale , Andrea Mazzullo , Ana Ozaki

This paper is a brief introduction to our recently initiated project named VERIFAI: Traceability and verification of natural language requirements. The project addresses the challenges in the traceability and verification of formal…

Software Engineering · Computer Science 2025-06-13 Arshad Beg , Diarmuid O'Donoghue , Rosemary Monahan

In this paper, we focus on the design and verification of timed automata (TA). We introduce a new method for assisting construction and verification of TA models along with a tool implementing the proposed method, i.e., ATAC: Automated…

Formal Languages and Automata Theory · Computer Science 2020-07-03 Beyazit Yalcinkaya , Ebru Aydin Gol

Alignments provide sophisticated diagnostics that pinpoint deviations in a trace with respect to a process model and their severity. However, approaches based on trace alignments use crisp process models as reference and recent…

Databases · Computer Science 2021-07-09 Giacomo Bergami , Fabrizio Maria Maggi , Marco Montali , Rafael Peñaloza

Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting…

Logic in Computer Science · Computer Science 2019-03-19 Valentin Bura , Tim French , Mark Reynolds

There are various kinds of type analysis of logic programs. These include for example inference of types that describe an over-approximation of the success set of a program, inference of well-typings, and abstractions based on given types.…

Programming Languages · Computer Science 2007-05-23 Kim Henriksen , John Gallagher

Building machines that can understand text like humans is an AI-complete problem. A great deal of research has already gone into this, with astounding results, allowing everyday people to discuss with their telephones, or have their reading…

Information Retrieval · Computer Science 2017-09-13 Christina Lioma

The problem of checking whether two programs are semantically equivalent or not has a diverse range of applications, and is consequently of substantial importance. There are several techniques that address this problem, chiefly by…

Software Engineering · Computer Science 2021-09-07 Manish Goyal , Muqsit Azeem , Kumar Madhukar , R. Venkatesh

Language model (LM) "reasoning", commonly described as Chain-of-Thought or test-time scaling, often improves benchmark performance, but the dynamics underlying this process remain poorly understood. We study these dynamics through the lens…

Formal languages let us define the textual representation of data with precision. Formal grammars, typically in the form of BNF-like productions, describe the language syntax, which is then annotated for syntax-directed translation and…

Software Engineering · Computer Science 2015-03-19 Luis Quesada , Fernando Berzal , Juan-Carlos Cubero

In robotics, ensuring that autonomous systems are comprehensible and accountable to users is essential for effective human-robot interaction. This paper introduces a novel approach that integrates user-centered design principles directly…

Artificial Intelligence · Computer Science 2024-11-11 Amar Halilovic , Senka Krivic

Specialized reasoning language models (RLMs) have demonstrated that scaling test-time computation through detailed reasoning traces significantly enhances performance. Although these traces effectively facilitate knowledge distillation into…

Computation and Language · Computer Science 2025-07-16 Philip Lippmann , Jie Yang

We present a novel approach to construction of a formal semantics for a programming language. Our approach, using a parametric denotational semantics, allows the semantics to be easily extended to support new language features, and…

Programming Languages · Computer Science 2018-12-04 In-Ho Yi