English
Related papers

Related papers: AutoHyper: Explicit-State Model Checking for Hyper…

200 papers

The expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning.…

Logic in Computer Science · Computer Science 2023-06-22 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala

This paper presents a transformational approach for model checking two important classes of metric temporal logic (MTL) properties, namely, bounded response and minimum separation, for nonhierarchical object-oriented Real-Time Maude…

Logic in Computer Science · Computer Science 2010-09-23 Daniela Lepri , Peter Csaba Ölveczky , Erika Ábrahám

This work proposes a novel approach for automatic verification and synthesis of infinite-state reactive programs with respect to ${CTL}^*$ specifications, based on translation to Existential Horn Clauses (EHCs). $CTL^*$ is a powerful…

Logic in Computer Science · Computer Science 2026-05-13 Mishel Carelli , Orna Grumberg

Most autonomous robotic agents use logic inference to keep themselves to safe and permitted behaviour. Given a set of rules, it is important that the robot is able to establish the consistency between its rules, its perception-based…

Robotics · Computer Science 2016-11-11 Hongyang Qu , Sandor M. Veres

We study the problem of monitoring at runtime whether a system fulfills a specification defined by a hyperproperty, such as linearizability or variants of non-interference. For this purpose, we introduce specifications with both passive and…

Logic in Computer Science · Computer Science 2025-08-05 Marek Chalupa , Thomas A. Henzinger , Ana Oliveira da Costa

Strategy logic (SL) is a powerful temporal logic that enables first-class reasoning over strategic behavior in multi-agent systems (MAS). In many MASs, the agents (and their strategies) cannot observe the global state of the system, leading…

Logic in Computer Science · Computer Science 2025-10-07 Raven Beutner , Bernd Finkbeiner

In this paper, we investigate property verification problems in partially-observed discrete-event systems (DES). Particularly, we are interested in verifying observational properties that are related to the information-flow of the system.…

Systems and Control · Electrical Eng. & Systems 2022-12-20 Jianing Zhao , Xiang Yin , Shaoyuan Li

Formal properties represent a cornerstone of the system-correctness proofs based on formal verification techniques such as model checking. Formalizing requirements into temporal properties may be very complex and error prone, due not only…

Logic in Computer Science · Computer Science 2017-09-08 Stefano Tonetta

To maximize the information gained from a single execution when verifying a concurrent system, one can derive all concurrency-aware equivalent executions and check them against linear specifications. This paper offers an alternative…

Logic in Computer Science · Computer Science 2025-07-08 Martin Leucker

We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the…

Logic in Computer Science · Computer Science 2016-05-25 Krishnendu Chatterjee , Laurent Doyen

In this paper we consider two different views of the model checking problems for the Linear Temporal Logic (LTL). On the one hand, we consider the universal model checking problem for LTL, where one asks that for a given system and a given…

Logic in Computer Science · Computer Science 2024-09-30 Damien Busatto-Gaston , Youssouf Oualhadj , Léo Tible , Daniele Varacca

We present a method for the automated verification of temporal properties of infinite state systems. Our verification method is based on the specialization of constraint logic programs (CLP) and works in two phases: (1) in the first phase,…

Logic in Computer Science · Computer Science 2015-03-19 Fabio Fioravanti , Alberto Pettorossi , Maurizio Proietti , Valerio Senni

We introduce the tool HyperQB 2.0, the first highly efficient push-button bounded model checker (BMC) for hyperproperties. HyperQB takes as input a model in NuSMV or Verilog and a formula expressed in the temporal logics HyperLTL or A-HLTL.…

In the age of autonomously driving vehicles, functionality and complexity of embedded systems are increasing tremendously. Safety aspects become more important and require such systems to operate with the highest possible level of fault…

Software Engineering · Computer Science 2021-10-20 Jonas Fritzsch , Tobias Schmid , Stefan Wagner

Selecting artificial intelligence (AI) models, such as large language models (LLMs), from multiple candidates requires accurate performance estimation. This is ideally achieved through empirical evaluations involving abundant real-world…

Machine Learning · Statistics 2025-12-03 Sangwoo Park , Matteo Zecchin , Osvaldo Simeone

This article describes the application of a credible autocoding framework for control systems towards a nonlinear car controller example. The framework generates code, along with guarantees of high level functional properties about the code…

Systems and Control · Computer Science 2013-08-28 Timothy Wang , Eric Feron

TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs written in a declarative style requiring little background beyond elementary mathematics. The language supports hierarchical and…

Logic in Computer Science · Computer Science 2010-11-12 Kaustuv Chaudhuri , Damien Doligez , Leslie Lamport , Stephan Merz

Path checking, the special case of the model checking problem where the model under consideration is a single path, plays an important role in monitoring, testing, and verification. We prove that for linear-time temporal logic (LTL), path…

Logic in Computer Science · Computer Science 2019-03-14 Lars Kuhtz , Bernd Finkbeiner

Monitoring is a runtime verification technique that allows one to check whether an ongoing computation of a system (partial trace) satisfies a given formula. It does not need a complete model of the system, but it typically requires the…

Artificial Intelligence · Computer Science 2025-08-26 Andrea Brunello , Luca Geatti , Angelo Montanari , Nicola Saccomanno

Hyperproperties govern the behavior of a system or systems across multiple executions, and are being recognized as an important extension of regular temporal properties. So far, such properties have resisted comprehensive treatment by…

Logic in Computer Science · Computer Science 2024-02-02 Shachar Itzhaky , Sharon Shoham , Yakir Vizel
‹ Prev 1 8 9 10 Next ›