English
Related papers

Related papers: 3vLTL: A Tool to Generate Automata for Three-value…

200 papers

Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s.…

Logic in Computer Science · Computer Science 2016-04-15 Mark Reynolds

Assurance cases can be used to argue for the safety of products in safety engineering. In safety-critical areas, the construction of assurance cases is indispensable. Trustworthiness Derivation Trees (TDTs) enhance assurance cases by…

Software Engineering · Computer Science 2023-09-25 Zezhong Chen , Yuxin Deng , Wenjie Du

We discuss a technique, based on Angluin's algorithm, for automatically generating finite automata for various kinds of useful first-order logic formulas in B\"uchi arithmetic. Construction in this way can be faster and use much less space…

Formal Languages and Automata Theory · Computer Science 2025-07-29 Mazen Khodier , Luke Schaeffer , Jeffrey Shallit

In this work we present our work in developing a software verification tool for llvm-code - Lodin - that incorporates both explicit-state model checking, statistical model checking and symbolic state model checking algorithms.

Programming Languages · Computer Science 2020-06-05 Axel Legay , Dirk Nowotka , Danny Bøgsted Poulsen

There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau…

Logic in Computer Science · Computer Science 2013-07-18 Mark Reynolds

We discuss the problem of experimentally evaluating linear-time temporal logic (LTL) synthesis tools for reactive systems. We first survey previous such work for the currently publicly available synthesis tools, and then draw conclusions by…

Logic in Computer Science · Computer Science 2011-02-22 Rüdiger Ehlers

Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…

Formal Languages and Automata Theory · Computer Science 2023-08-22 Muhammad Syifa'ul Mufid , Andrea Micheli , Alessandro Abate , Alessandro Cimatti

We introduce 'FactCheck Editor', an advanced text editor designed to automate fact-checking and correct factual inaccuracies. Given the widespread issue of misinformation, often a result of unintentional mistakes by content creators, our…

Computation and Language · Computer Science 2024-05-01 Vinay Setty

Linear temporal logic (LTL) is widely used in industrial verification. LTL formulae can be learned from traces. Scaling LTL formula learning is an open problem. We implement the first GPU-based LTL learner using a novel form of enumerative…

Programming Languages · Computer Science 2024-03-29 Mojtaba Valizadeh , Nathanaël Fijalkow , Martin Berger

One clock alternating timed automata OCATA have been recently introduced as natural extension of (one clock) timed automata to express the semantics of MTL (Ouaknine, Worrell 2005). We consider the application of OCATA to problem of…

Formal Languages and Automata Theory · Computer Science 2013-04-11 Thomas Brihaye , Morgane Estiévenart , Gilles Geeraerts

Effectively translating between natural language (NL) and formal logics like Linear Temporal Logic (LTL) requires expertise that limits formal verification's reach in safety-critical development. Template-based approaches sacrifice…

Artificial Intelligence · Computer Science 2026-05-25 Paapa Kwesi Quansah , Ernest Bonnah

LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by…

Logic in Computer Science · Computer Science 2024-11-25 Rayhana Amjad , Rob van Glabbeek , Liam O'Connor

In this paper, we provide an overview of the NTCIR-18 Automatic Evaluation of LLMs (AEOLLM) task. As large language models (LLMs) grow popular in both academia and industry, how to effectively evaluate the capacity of LLMs becomes an…

Computation and Language · Computer Science 2025-03-18 Junjie Chen , Haitao Li , Zhumin Chu , Yiqun Liu , Qingyao Ai

Optimization modeling serves as the pivotal bridge between natural-language problem descriptions and optimization solvers, and remains a cornerstone for bringing operations research (OR) into real-world decision making. Recent advances in…

Computation and Language · Computer Science 2026-05-26 Ziyang Fang , JinXi Wang , Jinghui Zhong , Yew-Soon Ong

The automatic generation of visualizations is an old task that, through the years, has shown more and more interest from the research and practitioner communities. Recently, large language models (LLM) have become an interesting option for…

Human-Computer Interaction · Computer Science 2024-02-06 Luca Podo , Muhammad Ishmal , Marco Angelini

Large Language Models (LLMs) are increasingly relied upon to evaluate text outputs of other LLMs, thereby influencing leaderboards and development decisions. However, concerns persist over the accuracy of these assessments and the potential…

Computation and Language · Computer Science 2024-11-27 Sumanth Doddapaneni , Mohammed Safi Ur Rahman Khan , Sshubam Verma , Mitesh M. Khapra

Business processes are fundamental to organizational operations, yet their optimization remains challenging due to the timeconsuming nature of manual process analysis. Our paper harnesses Large Language Models (LLMs) to automate value-added…

Computation and Language · Computer Science 2025-04-10 William De Michele , Abel Armas Cervantes , Lea Frermann

Automated Machine Learning (AutoML) offers a promising approach to streamline the training of machine learning models. However, existing AutoML frameworks are often limited to unimodal scenarios and require extensive manual configuration.…

Machine Learning · Computer Science 2024-08-02 Daqin Luo , Chengjian Feng , Yuxuan Nong , Yiqing Shen

In logics for the strategic reasoning the main challenge is represented by their verification in contexts of imperfect information and perfect recall. In this work, we show a technique to approximate the verification of Alternating-time…

Multiagent Systems · Computer Science 2023-06-19 Angelo Ferrando , Vadim Malvone

Context: Linear Temporal Logic (LTL) has been used widely in verification. Its importance and popularity have only grown with the revival of temporal logic synthesis, and with new uses of LTL in robotics and planning activities. All these…

Programming Languages · Computer Science 2022-11-04 Ben Greenman , Sam Saarinen , Tim Nelson , Shriram Krishnamurthi