English
Related papers

Related papers: Deciding Hyperproperties

200 papers

In this paper, we investigate the problem of synthesizing strategies for linear temporal logic (LTL) specifications that are interpreted over finite traces -- a problem that is central to the automated construction of controllers, robot…

Logic in Computer Science · Computer Science 2018-09-03 Alberto Camacho , Meghyn Bienvenu , Sheila A. McIlraith

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…

Logic in Computer Science · Computer Science 2013-12-11 Marta Cialdea Mayer

We address the problem of learning human-interpretable descriptions of a complex system from a finite set of positive and negative examples of its behavior. In contrast to most of the recent work in this area, which focuses on descriptions…

Machine Learning · Computer Science 2020-02-11 Rajarshi Roy , Dana Fisman , Daniel Neider

Hyperproperties lift conventional trace-based languages from a set of execution traces to a set of sets of executions. From a formal-language perspective, these are sets of sets of words, namely hyperlanguages. Hyperautomata are based on…

Formal Languages and Automata Theory · Computer Science 2022-09-22 Hadar Frenkel , Sarai Sheinvald

Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are quantitative extensions of linear temporal logic, which are prominent and widely used in the verification of real-timed systems. It was recently shown that the…

Logic in Computer Science · Computer Science 2023-06-22 Shiguang Feng , Markus Lohrey , Karin Quaas

We consider the problem of learning temporal logic formulas from examples of system behavior. Learning temporal properties has crystallized as an effective mean to explain complex temporal behaviors. Several efficient algorithms have been…

Logic in Computer Science · Computer Science 2024-08-09 Benjamin Bordais , Daniel Neider , Rajarshi Roy

Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a…

Logic in Computer Science · Computer Science 2020-02-11 Magdalena Kacprzak , Artur Niewiadomski , Wojciech Penczek

Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…

Artificial Intelligence · Computer Science 2020-06-04 Nadia Labai , Magdalena Ortiz , Mantas Šimkus

The set of answers to a query may be very large, potentially overwhelming users when presented with the entire set. In such cases, presenting only a small subset of the answers to the user may be preferable. A natural requirement for this…

Databases · Computer Science 2024-08-06 Marcelo Arenas , Timo Camillo Merkl , Reinhard Pichler , Cristian Riveros

Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…

Logic · Mathematics 2022-11-03 Caleb M. H. Camrud , Timothy H. McNicholl

Linear Temporal Logic (LTL) is widely used for defining conditions on the execution paths of dynamic systems. In the case of dynamic systems that allow for nondeterministic evolutions, one has to specify, along with an LTL formula f, which…

Artificial Intelligence · Computer Science 2011-09-30 M. Pistore , M. Y. Vardi

Hyperproperties elevate the traditional view of trace properties form sets of traces to sets of sets of traces and provide a formalism for expressing information-flow policies. For trace properties, algorithms for verification, monitoring,…

Formal Languages and Automata Theory · Computer Science 2021-01-01 Bernd Finkbeiner , Lennart Haas , Hazem Torfah

We address the problem of measuring inconsistency in declarative process specifications, with an emphasis on linear temporal logic on fixed traces (LTLff). As we will show, existing inconsistency measures for classical logic cannot provide…

Artificial Intelligence · Computer Science 2022-06-16 Carl Corea , John Grant , Matthias Thimm

We introduce and investigate a number of fragments of propo- sitional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of…

Logic in Computer Science · Computer Science 2013-10-11 A. Artale , R. Kontchakov , V. Ryzhikov , M. Zakharyaschev

In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the…

Programming Languages · Computer Science 2014-05-20 Damiano Zanardini , Samir Genaim

Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only…

Logic in Computer Science · Computer Science 2013-10-29 Guillaume Aucher , Francois Schwarzentruber

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

Smart contracts are small but highly security-critical programs that implement wallets, token systems, auctions, crowd funding systems, elections, and other multi-party transactions on the blockchain. A broad range of methods has been…

Logic in Computer Science · Computer Science 2023-07-11 Norine Coenen , Bernd Finkbeiner , Jana Hofmann , Julia Tillman

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties…

Formal Languages and Automata Theory · Computer Science 2019-10-08 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive…

Logic in Computer Science · Computer Science 2007-08-14 Volker Weber
‹ Prev 1 8 9 10 Next ›