The Temporal Logic Sugar

Beer, Ilan; Ben-David, Shoham; Eisner, Cindy; Fisman, Dana; Gringauze, Anna; Rodeh, Yoav

doi:10.1007/3-540-44585-4_33

Cited by 92 publications

(56 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since automata represent finite-state control, it is hard to see why random directed graphs with linear density do not provide a realistic model. Hopefully, with the recent increase in popularity of finite-state formalisms in industrial temporal property specification languages (c.f., [4,6]), such benchmarks will become available in the not-too-far future, enabling us to evaluate our findings on such benchmarks. While our results are purely empirical, as the lack of success with fully analyzing related probabilistic models indicates (cf.…”

Section: Discussionmentioning

confidence: 99%

Experimental Evaluation of Classical Automata Constructions

Tabakov

Vardi

2005

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Abstract. There are several algorithms for producing the canonical DFA from a given NFA. While the theoretical complexities of these algorithms are known, there has not been a systematic empirical comparison between them. In this work we propose a probabilistic framework for testing the performance of automatatheoretic algorithms. We conduct a direct experimental comparison between Hopcroft's and Brzozowski's algorithms. We show that while Hopcroft's algorithm has better overall performance, Brzozowski's algorithm performs better for "highdensity" NFA. We also consider the universality problem, which is traditionally solved explicitly via the subset construction. We propose an encoding that allows this problem to be solved symbolically via a model-checker. We compare the performance of this approach to that of the standard explicit algorithm, and show that the explicit approach performs significantly better.

show abstract

Section: Discussionmentioning

confidence: 99%

Experimental Evaluation of Classical Automata Constructions

Tabakov

Vardi

2005

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

show abstract

“…A possible way to achieve this is to adopt some of the ideas discussed in [3], [6], [18], [19]. This will require an appropriate adaptation of the translation scheme.…”

Section: Discussionmentioning

confidence: 99%

“…Paper [6] introduces a language for pattern definition as a way to create extendable sets of property patterns. Sugar [19] provides several layers for property specification and verification; in particular, extended regular expressions are used to describe execution sequences on which temporal properties are checked.…”

Section: Introductionmentioning

confidence: 99%

Run time monitoring of reactive system models

Auguston

Trakhtenbrot²

2004

"Second International Workshop on Dynamic Analysis (WODA 2004)" W10S Workshop - 26th International Conference on Software Engin

View full text Add to dashboard Cite

show abstract

“…In the static verification community, several other specification languages like Sugar [4] and ForSpec [3] exist, which also contain additional syntactic sugar hiding the temporal logics in the semantic layer to make the input languages more user-friendly.…”

Section: G(modify(c) → Remove(s C) R ¬Contains(s C))mentioning

confidence: 99%

Tracechecks: Defining Semantic Interfaces with Temporal Logic

Bodden

Stolz

2006

Software Composition

View full text Add to dashboard Cite

Abstract. Tracechecks are a formalism based on linear temporal logic (LTL) with variable bindings and pointcuts of the aspect-oriented language AspectJ for the purpose of verification. We demonstrate how tracechecks can be used to model temporal assertions. These assertions reason about the dynamic control flow of an application. They can be used to formally define the semantic interface of classes. We explain in detail how we make use of AspectJ pointcuts to derive a formal model of an existing application and use LTL to express temporal assertions over this model.We developed a reference implementation with the abc compiler showing that the tool can be applied in practice and is memory-efficient.In addition we show how tracechecks can be deployed as Java5 annotations, yielding a system which is fully compliant with any Java compiler and hiding any peculiarities of aspect-oriented programming from the user. Through annotations, the tracecheck specifications become a semantic part of an interface. Consumers of such a component can then take advantage of the contained annotations by applying our tool and have their use of this component automatically checked at runtime for compliance with the intent of the component provider.

show abstract

The Temporal Logic Sugar

Cited by 92 publications

References 5 publications

Experimental Evaluation of Classical Automata Constructions

Experimental Evaluation of Classical Automata Constructions

Run time monitoring of reactive system models

Tracechecks: Defining Semantic Interfaces with Temporal Logic

Contact Info

Product

Resources

About