English
Related papers

Related papers: Bounded Model Checking for Asynchronous Hyperprope…

200 papers

We present a bounded model checking algorithm for signal temporal logic (STL) that exploits mixed-integer linear programming (MILP). A key technical element is our novel MILP encoding of the STL semantics; it follows the idea of stable…

Systems and Control · Electrical Eng. & Systems 2024-08-14 Sota Sato , Jie An , Zhenya Zhang , Ichiro Hasuo

Metric Temporal Logic (MTL) is a popular formalism to specify temporal patterns with timing constraints over the behavior of cyber-physical systems with application areas ranging in property-based testing, robotics, optimization, and…

Logic in Computer Science · Computer Science 2026-03-11 Dogan Ulus

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

Automated software verification of concurrent programs is challenging because of exponentially large state spaces with respect to the number of threads and number of events per thread. Verification techniques such as model checking need to…

Programming Languages · Computer Science 2020-04-15 Patrick Metzler , Habib Saissi , Péter Bokor , Neeraj Suri

Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore…

Logic in Computer Science · Computer Science 2013-07-01 Bernd Finkbeiner , Markus N. Rabe , César Sánchez

Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics,…

Logic in Computer Science · Computer Science 2016-01-25 A. Molinari , A. Montanari , A. Peron

This thesis addresses the foundational aspects of formal methods for applications in security and in particular in anonymity. More concretely, we develop frameworks for the specification of anonymity properties and propose algorithms for…

Cryptography and Security · Computer Science 2011-11-14 Miguel E. Andrés

In this paper we introduce Behavioral QLTL, which is a ``behavioral'' variant of linear-time temporal logic on infinite traces with second-order quantifiers. Behavioral QLTL is characterized by the fact that the functions that assign the…

Logic in Computer Science · Computer Science 2021-02-23 Giuseppe De Giacomo , Giuseppe Perelli

We study the runtime verification of hyperproperties, expressed in the temporal logic HyperLTL, as a means to inspect a system with respect to security polices. Runtime monitors for hyperproperties analyze trace logs that are organized by…

Logic in Computer Science · Computer Science 2021-01-21 Borzoo Bonakdarpour , Bernd Finkbeiner

The landscape of Large Language Models (LLMs) shifts rapidly towards dynamic, multi-agent systems. This introduces a fundamental challenge in establishing computational trust, specifically how one agent can verify that another's output was…

Artificial Intelligence · Computer Science 2025-09-16 Zan-Kai Chong , Hiroyuki Ohsaki , Bryan Ng

Many important system properties, particularly in security and privacy, cannot be verified statically. Therefore, runtime verification is an appealing alternative. Logics for hyperproperties, such as HyperLTL, support a rich set of such…

Logic in Computer Science · Computer Science 2019-10-07 Sandro Stucki , César Sánchez , Gerardo Schneider , Borzoo Bonakdarpour

Modern complex software systems produce a large amount of execution data, often stored in logs. These logs can be analyzed using trace checking techniques to check whether the system complies with its requirements specifications. Often…

Software Engineering · Computer Science 2014-06-17 Domenico Bianculli , Carlo Ghezzi , Srdan Krstic

Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by…

Logic in Computer Science · Computer Science 2019-02-07 A. Molinari , A. Montanari , A. Murano , G. Perelli , A. Peron

Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call…

Logic in Computer Science · Computer Science 2015-03-17 Pierre Ganty , Rupak Majumdar

Privacy concerns have led to the development of privacy-preserving approaches for learning models from sensitive data. Yet, in practice, even models learned with privacy guarantees can inadvertently memorize unique training examples or leak…

Machine Learning · Statistics 2019-11-11 Mario Diaz , Peter Kairouz , Jiachun Liao , Lalitha Sankar

Hyperproperties, such as non-interference and observational determinism, relate multiple computation traces with each other and are thus not monitorable by tools that consider computations in isolation. We present the monitoring approach…

Logic in Computer Science · Computer Science 2021-01-19 Bernd Finkbeiner , Christopher Hahn , Marvin Stenger , Leander Tentrup

Conformance checking quantifies the deviations between a set of traces in a given process log and a set of possible traces defined by a process model. Current approaches mostly focus on added or missing events. Lately, multi-perspective…

Software Engineering · Computer Science 2020-08-18 Florian Stertz , Juergen Mangler , Stefanie Rinderle-Ma

Controller confidentiality under sensor attacks refers to whether the internal states of the controller can be estimated when the adversary knows the model of the plant and controller, while only having access to sensors, but not the…

Optimization and Control · Mathematics 2022-02-02 Michelle S. Chong

Bounded model checking (BMC) is an efficient formal verification technique which allows for desired properties of a software system to be checked on bounded runs of an abstract model of the system. The properties are frequently described in…

Logic in Computer Science · Computer Science 2026-02-19 Ramchandra Phawade , Tephilla Prince , S. Sheerazuddin

We present a novel asynchronous hyper linear time temporal logic named LPrL (Linear Time Predicate Logic) and establish its basic theory. LPrL is a natural first order extension of LTL (Linear time temporal logic), in which the predicates…

Logic in Computer Science · Computer Science 2026-01-22 Parasara Sridhar Duggirala , P. S. Thiagarajan