English
Related papers

Related papers: Visualising CTL Witnesses and Counterexamples -- E…

200 papers

An essential element of any verification technique is that of identifying and communicating to the user, system behaviour which leads to a deviation from the expected behaviour. Such behaviours are typically made available as long traces of…

Software Engineering · Computer Science 2014-06-10 Gordon J. Pace , Michael Rosner

Online tracking of multiple objects in videos requires strong capacity of modeling and matching object appearances. Previous methods for learning appearance embedding mostly rely on instance-level matching without considering the temporal…

Computer Vision and Pattern Recognition · Computer Science 2021-07-07 Wei Li , Yuanjun Xiong , Shuo Yang , Mingze Xu , Yongxin Wang , Wei Xia

An entanglement witness is an observable with the property that a negative expectation value signals the presence of entanglement. The question arises how a witness can be improved if the expectation value of a second observable is known,…

Quantum Physics · Physics 2018-08-03 Mariami Gachechiladze , Nikolai Wyderka , Otfried Gühne

Not all properties are monitorable. This is a well-known fact, and it means there exist properties that cannot be fully verified at runtime. However, given a non-monitorable property, a monitor can still be synthesised, but it could end up…

Logic in Computer Science · Computer Science 2022-11-22 Luca Ciccone , Francesco Dagnino , Angelo Ferrando

Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple…

Logic in Computer Science · Computer Science 2019-10-28 Jens Oliver Gutsfeld , Markus Müller-Olm , Christian Dielitz

Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring. Given a set of positive and negative examples,…

Software Engineering · Computer Science 2025-01-03 Changjian Zhang , Parv Kapoor , Ian Dardik , Leyi Cui , Romulo Meira-Goes , David Garlan , Eunsuk Kang

Recent advances in Large Language Models have led to Large Reasoning Models, which produce step-by-step reasoning traces. These traces offer insight into how models think and their goals, improving explainability and helping users follow…

Human-Computer Interaction · Computer Science 2025-11-17 Ludwig Felder , Jacob Miller , Markus Wallinger , Stephen Kobourov , Chunyang Chen

Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*,…

Logic in Computer Science · Computer Science 2014-10-29 Benjamin Aminof , Aniello Murano , Sasha Rubin

To verify and validate networks, it is essential to gain insight into their decisions, limitations as well as possible shortcomings of training data. In this work, we propose a post-hoc, optimization based visual explanation method, which…

Computer Vision and Pattern Recognition · Computer Science 2019-08-08 Jörg Wagner , Jan Mathias Köhler , Tobias Gindele , Leon Hetzel , Jakob Thaddäus Wiedemer , Sven Behnke

Context: Traceability is a key quality attribute of artifacts that are used in knowledge-intensive tasks and supports software engineers in producing higher-quality software. Despite its clear benefits, traceability is often neglected in…

Software Engineering · Computer Science 2026-04-10 Waleed Abdeen , Michael Unterkalmsteiner , Peter Löwenadler , Parisa Yousefi , Krzysztof Wnuk

The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint…

Logic in Computer Science · Computer Science 2015-07-21 Andreas Krebs , Arne Meier , Martin Mundhenk

Entanglement witnesses provide a standard tool for the analysis of entanglement in experiments. We investigate possible nonlinear entanglement witnesses from several perspectives. First, we demonstrate that they can be used to show that the…

Quantum Physics · Physics 2007-06-13 Otfried Gühne , Norbert Lütkenhaus

Contrastive explanations clarify why an event occurred in contrast to another. They are more inherently intuitive to humans to both produce and comprehend. We propose a methodology to produce contrastive explanations for classification…

Computation and Language · Computer Science 2021-09-15 Alon Jacovi , Swabha Swayamdipta , Shauli Ravfogel , Yanai Elazar , Yejin Choi , Yoav Goldberg

Context: Safety is of paramount importance for cyber-physical systems in domains such as automotive, robotics, and avionics. Formal methods such as model checking are one way to ensure the safety of cyber-physical systems. However, adoption…

Software Engineering · Computer Science 2022-01-14 Arut Prakash Kaleeswaran , Arne Nordmann , Thomas Vogel , Lars Grunske

The two major systems of formal verification are model checking and algebraic model-based testing. Model checking is based on some form of temporal logic such as linear temporal logic (LTL) or computation tree logic (CTL). One powerful and…

Logic in Computer Science · Computer Science 2019-01-31 Stefan D. Bruda , Sunita Singh , A. F. M. Nokib Uddin , Zhiyu Zhang , Rui Zuo

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

Hyperproperties are a modern specification paradigm that extends trace properties to express properties of sets of traces. Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and…

Logic in Computer Science · Computer Science 2021-04-28 Laura Bozzelli , Adriano Peron , Cesar Sanchez

Standpoint linear temporal logic ($SLTL$) is a recently introduced extension of classical linear temporal logic ($LTL$) with standpoint modalities. Intuitively, these modalities allow to express that, from agent $a$'s standpoint, it is…

Logic in Computer Science · Computer Science 2025-02-28 Rajab Aghamov , Christel Baier , Toghrul Karimov , Rupak Majumdar , Joël Ouaknine , Jakob Piribauer , Timm Spork

Contract conformance is hard to determine statically, prior to the deployment of large pieces of software. A scalable alternative is to monitor for contract violations post-deployment: once a violation is detected, the trace characterising…

Software Engineering · Computer Science 2012-09-13 Christian Colombo , Adrian Francalanza , Ian Grima

The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of…

Logic in Computer Science · Computer Science 2015-07-01 Olaf Beyersdorff , Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Heribert Vollmer