English
Related papers

Related papers: Checking Interval Properties of Computations

200 papers

ESBMC implements many state-of-the-art techniques for model checking. We report on new and improved features that allow us to obtain verification results for previously unsupported programs and properties. ESBMC employs a new static…

Model checking of temporal logics in a well established technique to verify and validate properties of multi-agent systems (MAS). However, practical model checking requires input models of manageable size. In this paper, we extend the model…

Multiagent Systems · Computer Science 2025-03-18 Yan Kim , Wojciech Jamroga , Wojciech Penczek , Laure Petrucci

In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li \cite{li12} introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue,…

Logic in Computer Science · Computer Science 2014-01-21 Yongming Li , Yali Li , Zhanyou Ma

We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining hyperproperties, i.e., properties which relate multiple…

Logic in Computer Science · Computer Science 2021-11-24 Jonni Virtema , Jana Hofmann , Bernd Finkbeiner , Juha Kontinen , Fan Yang

The high availability and scalability of weakly-consistent systems attracts system designers. Yet, writing correct application code for this type of systems is difficult; even how to specify the intended behavior of such systems is still an…

Logic in Computer Science · Computer Science 2017-04-19 Mathias Weber , Annette Bieniusa , Arnd Poetzsch-Heffter

This set of theories presents a formalisation in Isabelle/HOL+Isar of data dependencies between components. The approach allows to analyse system structure oriented towards efficient checking of system: it aims at elaborating for a concrete…

Software Engineering · Computer Science 2014-05-14 Maria Spichkova

A key problem in verification of multi-agent systems by model checking concerns the fact that the state-space of the system grows exponentially with the number of agents present. This makes practical model checking unfeasible whenever the…

Multiagent Systems · Computer Science 2014-05-26 Panagiotis Kouvaros , Alessio Lomuscio

Temporal hyperproperties are system properties that relate multiple execution traces. For (finite-state) hardware, temporal hyperproperties are supported by model checking algorithms, and tools for general temporal logics like HyperLTL…

Logic in Computer Science · Computer Science 2022-08-26 Raven Beutner , Bernd Finkbeiner

HyperLTL is an extension of linear-time temporal logic for the specification of hyperproperties, i.e., temporal properties that relate multiple computation traces. HyperLTL can express information flow policies as well as properties like…

Logic in Computer Science · Computer Science 2020-05-18 Norine Coenen , Bernd Finkbeiner , César Sánchez , Leander Tentrup

Temporal Equilibrium Logic (TEL) is a promising framework that extends the knowledge representation and reasoning capabilities of Answer Set Programming with temporal operators in the style of LTL. To our knowledge it is the first…

Logic in Computer Science · Computer Science 2015-03-03 Laura Bozzelli , David Pearce

Biological systems are often modeled as a system of ordinary differential equations (ODEs) with time-invariant parameters. However, cell signaling events or pharmacological interventions may alter the cellular state and induce multi-mode…

Quantitative Methods · Quantitative Biology 2020-04-28 Bing Liu

In this paper we present an efficient approach to implementing model checking in the Higher Order Logic (HOL) of Isabelle. This is a non-trivial task since model checking is restricted to finite state sets. By restricting our scope to…

Logic in Computer Science · Computer Science 2024-01-01 Florian Kammüller

We introduce a machine learning approach to model checking temporal logic, with application to formal hardware verification. Model checking answers the question of whether every execution of a given system satisfies a desired temporal logic…

Logic in Computer Science · Computer Science 2024-11-01 Mirco Giacobbe , Daniel Kroening , Abhinandan Pal , Michael Tautschnig

We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (nondeterministic, game-based, probabilistic etc.) and in the next-step modalities used in formulae. The tool implements…

Logic in Computer Science · Computer Science 2023-11-06 Daniel Hausmann , Merlin Humml , Simon Prucker , Lutz Schröder , Aaron Strahlberger

Reasoning models produce long traces of intermediate decisions and tool calls, making test-time verification important for ensuring correctness. Existing approaches either verify only the final answer, which misses early errors, or rely on…

Hyperproperties are system properties that relate multiple execution traces and occur, e.g., when specifying security and information-flow properties. Checking if a hyperproperty is satisfiable has many important applications, such as…

Logic in Computer Science · Computer Science 2025-12-30 Raven Beutner , Bernd Finkbeiner

In a software product line (SPL), a collection of software products is defined by their commonalities in terms of features rather than explicitly specifying all products one-by-one. Several verification techniques were adapted to establish…

Software Engineering · Computer Science 2013-12-31 Clemens Dubslaff , Sascha Klüppelholz , Christel Baier

The behaviour of systems characterised by a closed interaction of software components with the environment is inevitably subject to perturbations and uncertainties. In this paper we propose a general framework for the specification and…

Logic in Computer Science · Computer Science 2022-04-29 Valentina Castiglioni , Michele Loreti , Simone Tini

Metric Interval Temporal Logic (MITL) is a popular formalism for specifying properties of reactive systems with timing constraints. Existing approaches to using MITL in verification tasks, however, have notable drawbacks: they either…

Formal Languages and Automata Theory · Computer Science 2025-10-03 Hsi-Ming Ho , Shankara Narayanan Krishna , Khushraj Madnani , Rupak Majumdar , Paritosh Pandya

This paper presents the first model-checking algorithm for an expressive modal mu-calculus over timed automata, $L^{\mathit{rel}, \mathit{af}}_{\nu,\mu}$, and reports performance results for an implementation. This mu-calculus contains…

Formal Languages and Automata Theory · Computer Science 2014-08-29 Peter Fontana , Rance Cleaveland
‹ Prev 1 8 9 10 Next ›