English
Related papers

Related papers: Model checking strategy-controlled systems in rewr…

200 papers

Temporal Logic Model Checking is a verification method in which we describe a system, the model, and then we verify whether some properties, expressed in a temporal logic formula, hold in the system. It has many industrial applications. In…

Artificial Intelligence · Computer Science 2021-04-12 Paolo Liberatore , Marco Schaerf

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

Deep Reinforcement Learning (RL) agents are susceptible to adversarial noise in their observations that can mislead their policies and decrease their performance. However, an adversary may be interested not only in decreasing the reward,…

Machine Learning · Computer Science 2022-12-13 Dennis Gross , Thiago D. Simao , Nils Jansen , Guillermo A. Perez

Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of…

Logic in Computer Science · Computer Science 2008-04-25 David Baelde , Andrew Gacek , Dale Miller , Gopalan Nadathur , Alwen Tiu

The remarkable growth in large language model (LLM) capabilities has spurred exploration into multi-agent systems, with debate frameworks emerging as a promising avenue for enhanced problem-solving. These multi-agent debate (MAD)…

Artificial Intelligence · Computer Science 2025-06-23 Yongjin Yang , Euiin Yi , Jongwoo Ko , Kimin Lee , Zhijing Jin , Se-Young Yun

Virtually all verification techniques using formal methods rely on the availability of a formal specification, which describes the design requirements precisely. However, formulating specifications remains a manual task that is notoriously…

Formal Languages and Automata Theory · Computer Science 2025-01-28 Daniel Neider , Rajarshi Roy

Large Language Models (LLMs) like GPT-4 have revolutionized natural language processing, showing remarkable linguistic proficiency and reasoning capabilities. However, their application in strategic multi-agent decision-making environments…

Computation and Language · Computer Science 2024-05-29 Chuanhao Li , Runhan Yang , Tiankai Li , Milad Bafarassat , Kourosh Sharifi , Dirk Bergemann , Zhuoran Yang

Hyperproperties extend trace properties to express properties of sets of traces, and they are increasingly popular in specifying various security and performance-related properties in domains such as cyber-physical systems, smart grids, and…

Logic in Computer Science · Computer Science 2023-08-11 Ernest Bonnah , Luan Viet Nguyen , Khaza Anuarul Hoque

Term rewriting plays a crucial role in software verification and compiler optimization. With dozens of highly parameterizable techniques developed to prove various system properties, automatic term rewriting tools work in an extensive…

Logic in Computer Science · Computer Science 2025-08-01 Liao Zhang , Fabian Mitterwallner , Jan Jakubuv , Cezary Kaliszyk

Logic is playing an increasingly important role in the engineering of real-time, hybrid, and cyber-physical systems, but mostly in the form of posterior verification and high-level analysis. The core methodology in the design of real-world…

Logic in Computer Science · Computer Science 2014-09-16 Sicun Gao

Component-based software development has posed a serious challenge to system verification since externally-obtained components could be a new source of system failures. This issue can not be completely solved by either model-checking or…

Software Engineering · Computer Science 2016-08-31 Gaoyan Xie , Zhe Dang

Dedukti is a type-checker for the $\lambda$$\Pi$-calculus modulo rewriting, an extension of Edinburgh's logicalframework LF where functions and type symbols can be defined by rewrite rules. It thereforecontains an engine for rewriting LF…

Programming Languages · Computer Science 2022-02-16 Gabriel Hondet , Frédéric Blanqui

Verification of large and complicated concurrent programs is an important issue in the software world. Stateless model checking is an appropriate method for systematically and automatically testing of large programs, which has proved its…

Programming Languages · Computer Science 2016-03-14 Elaheh Ghassabani , Mohammad Abdollahi Azgomi

Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has variables for strategies that are associated to specific agents with a binding operator. We introduce Graded Strategy…

Computer Science and Game Theory · Computer Science 2016-07-13 Benjamin Aminof , Vadim Malvone , Aniello Murano , Sasha Rubin

It is well known that the verification of resource-constrained multiagent systems is undecidable in general. In many such settings, resources are private to agents. In this paper, we investigate the model checking problem for a resource…

Logic in Computer Science · Computer Science 2015-08-17 Nils Bulling , Hoang Nga Nguyen

We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of…

Logic in Computer Science · Computer Science 2010-08-11 Cătălin Dima , Constantin Enea , Dimitar Guelev

This paper is an expository contribution reporting on published work. It focusses on an approach followed in the rewriting community to formalize the concept of strategy. Based on rewriting concepts, several definitions of strategy are…

Logic in Computer Science · Computer Science 2013-03-05 Hélène Kirchner

A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling…

Logic in Computer Science · Computer Science 2013-07-10 Masoud Koleini , Michael R. Clarkson , Kristopher K. Micinski

Most model checkers provide a useful simulation mode, that allows users to explore the set of possible behaviours by interactively picking at each state which event to execute next. Traditionally this simulation mode cannot take into…

Software Engineering · Computer Science 2019-12-24 Julien Brunel , David Chemouil , Alcino Cunha , Nuno Macedo

Some multi-agent scenarios call for the possibility of evaluating specifications in a richer domain of truth values. Examples include runtime monitoring of a temporal property over a growing prefix of an infinite path, inconsistency…

Multiagent Systems · Computer Science 2023-11-01 Wojciech Jamroga , Beata Konikowska , Damian Kurpiewski , Wojciech Penczek