The UniForM workbench a universal development environment for formal methods

Krieg-Brückner, Bernd; Peleskã, Jan; Olderog, Ernst-Rüdiger; Baer, Alexander

doi:10.1007/3-540-48118-4_13

Cited by 31 publications

(17 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An even better integration can be achieved with the UniForM workbench [12], which also provides library management and access to a generic transformation application system [15,14] that will be instantiated to CASL. Future work will turn our tool into a theorem proving environment that can be used for practical problems.…”

Section: Discussionmentioning

confidence: 99%

CASL: From Semantics to Tools

Mossakowski

2000

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. CASL, the common algebraic specification language, has been developed as a language that subsumes many previous algebraic specification frameworks and also provides tool interoperability. CASL is a complex language with a complete formal semantics. It is therefore a challenge to build good tools for CASL. In this work, we present and discuss the Bremen HOL-CASL system, which provides parsing, static checking, conversion to L A T E X and theorem proving for CASL specifications. To make tool construction manageable, we have followed some guidelines: re-use of existing tools, interoperability of tools developed at different sites, and construction of generic tools that can be used for several languages. We describe the structure of and the experiences with our tool and discuss how the guidelines work in practice.

show abstract

Section: Discussionmentioning

confidence: 99%

CASL: From Semantics to Tools

Mossakowski

2000

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…As benchmarks, we use the Single-tracked Line Segment case study, which comes from an industrial project partner of the UniForM-project [12]. The case study models a distributed real-time controller for a segment of tracks where trams share a piece of track.…”

Section: Methodsmentioning

confidence: 99%

Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy

Kupferschmid

Wehrle

2011

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Directed model checking is a well-established technique for detecting error states in concurrent systems efficiently. As error traces are important for debugging purposes, it is preferable to find as short error traces as possible. A wide spread method to find provably shortest error traces is to apply the A * search algorithm with distance heuristics that never overestimate the real error distance. An important class of such distance estimators is the class of pattern database heuristics, which are built on abstractions of the system under consideration. In this paper, we propose a systematic approach for the construction of pattern database heuristics. We formally define a concept to measure the accuracy of abstractions. Based on this technique, we address the challenge of finding abstractions that are succinct on the one hand, and accurate to produce informed pattern databases on the other hand. We evaluate our approach on large and complex industrial problems. The experiments show that the resulting distance heuristic impressively advances the state of the art.

show abstract

“…The first set of benchmarks stems from an industrial case study called "Single-Tracked Line Segment", which comes from an industrial project partner of the UniForM-project [20]. It models a distributed real-time controller for a segment of tracks where trams share a particular piece of track.…”

Section: Benchmarksmentioning

confidence: 99%

Downward pattern refinement for timed automata

Wehrle

Kupferschmid²

2014

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Directed model checking is a well-established approach for detecting error states in concurrent systems. A popular variant to find shortest error traces is to apply the A * search algorithm with distance heuristics that never overestimate the real error distance. An important class of such distance heuristics is the class of pattern database heuristics. Pattern database heuristics are built on abstractions of the system under consideration. In this paper, we propose downward pattern refinement, a systematic approach for the construction of pattern database heuristics for concurrent systems of timed automata. First, we propose a general framework for pattern databases in the context of timed automata and show that desirable theoretical properties hold for the resulting pattern database. Afterward, we formally define a concept to measure the accuracy of abstractions. Based on this concept, we propose an algorithm for computing succinct abstractions that are still accurate to produce informed pattern databases. We evaluate our approach on large and complex industrial problems. The experiments show the practical potential of the resulting pattern database heuristic.

show abstract

The UniForM workbench a universal development environment for formal methods

Cited by 31 publications

References 31 publications

CASL: From Semantics to Tools

CASL: From Semantics to Tools

Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy

Downward pattern refinement for timed automata

Contact Info

Product

Resources

About