Manipulating LTL Formulas Using Spot 1.0

Duret-Lutz, Alexandre

doi:10.1007/978-3-319-02444-8_31

Cited by 48 publications

(31 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each number of alternations we tested 100 formulas of size 60 and 120, where 50 start with ∃ and 50 with ∀. The size is the size argument provided for randltl [5]. The runtimes are shown in Figure 1.…”

Section: Resultsmentioning

confidence: 99%

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^\forall ^$$∃∗∀∗ Fragment

Finkbeiner

Hahn

Hans

2018

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Hyperproperties are properties that refer to multiple computation traces. This includes many information-flow security policies, such as observational determinism, (generalized) noninterference, and noninference, and other system properties like symmetry or Hamming distances between in error-resistant codes. We introduce MGHyper, a tool for automatic satisfiability checking and model generation for hyperproperties expressed in HyperLTL. Unlike previous satisfiability checkers, MGHyper is not limited to the decidable ∃ * ∀ * fragment of Hy-perLTL, but provides a semi-decisionprocedure for the full logic. An important application of MGHyper is to automatically check equivalences between different hyperproperties (and different formalizations of the same hyperproperty) and to build counterexamples that disprove a certain claimed implication. We describe the semi-decisionprocedure implemented in MGHyper and report on experimental results obtained both with typical hyperproperties from the literature and with randomly generated HyperLTL formulas.

show abstract

Section: Resultsmentioning

confidence: 99%

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^\forall ^$$∃∗∀∗ Fragment

Finkbeiner

Hahn

Hans

2018

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

“…(i) We use formulae collected from literature [9,11,14,20,25] that can be obtained using the tool genltl from SPOT [7]. For each such a formula, we added its negation, simplified all the formulae and removed duplicates and formulae equivalent to tt or ff .…”

Section: Evaluation Settingsmentioning

confidence: 99%

LTL to Smaller Self-Loop Alternating Automata and Back

Blahoudek

Major

Strejček

2019

Theoretical Aspects of Computing – ICTAC 2019

View full text Add to dashboard Cite

Self-loop alternating automata (SLAA) with Büchi or co-Büchi acceptance are popular intermediate formalisms in translations of LTL to deterministic or nondeterministic automata. This paper considers SLAA with generic transition-based Emerson-Lei acceptance and presents translations of LTL to these automata and back. Importantly, the translation of LTL to SLAA with generic acceptance produces considerably smaller automata than previous translations of LTL to Büchi or co-Büchi SLAA. Our translation is already implemented in the tool LTL3TELA, where it helps to produce small deterministic or nondeterministic automata for given LTL formulae.

show abstract

“…We vary the number of components between 3 and 5, and ensure that for each number we have at least 1,000 formulae that reference all components. Specifications are generated as random LTL formulae using randltl from Spot [7], then converted to automata using ltl2mon [4]. Figure 2 displays our example query on the database to retrieve the communication measures, where column alg (resp.…”

Section: The Migration Algorithmmentioning

confidence: 99%

THEMIS: a tool for decentralized monitoring algorithms

El-Hokayem

Falcone

2017

Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis

View full text Add to dashboard Cite

THEMIS is a tool to facilitate the design, development, and analysis of decentralized monitoring algorithms; developed using Java and AspectJ. It consists of a library and command-line tools. THEMIS provides an API, data structures and measures for decentralized monitoring. These building blocks can be reused or extended to modify existing algorithms, design new more intricate algorithms, and elaborate new approaches to assess existing algorithms. We illustrate the usage of THEMIS by comparing two variants of a monitoring algorithm.

show abstract

Manipulating LTL Formulas Using Spot 1.0

Cited by 48 publications

References 13 publications

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^\forall ^$$∃∗∀∗ Fragment

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^\forall ^$$∃∗∀∗ Fragment

LTL to Smaller Self-Loop Alternating Automata and Back

THEMIS: a tool for decentralized monitoring algorithms

Contact Info

Product

Resources

About

Manipulating LTL Formulas Using Spot 1.0

Cited by 48 publications

References 13 publications

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^*\forall ^*$$∃∗∀∗ Fragment

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^*\forall ^*$$∃∗∀∗ Fragment

LTL to Smaller Self-Loop Alternating Automata and Back

THEMIS: a tool for decentralized monitoring algorithms

Contact Info

Product

Resources

About

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^\forall ^$$∃∗∀∗ Fragment

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the $$\exists ^\forall ^$$∃∗∀∗ Fragment