Mosel: A flexible toolset for monadic second-order logic

Abstract

Abstract. MOSEL is a new tool-set for the analysis and verification in Monadic Second-order kogic. In this paper we concentrate on the system's design: MOSEL is a tool-set to include a flexible set of decision procedures for several theories of the logic complemented by a variety of support components for input format translations, visualization, and interfaces to other logics and tools. The main distinguishing features of MOSEL are its layered approach to the logic, based on a formal semantics for a minimal subset, its modular design, and its integration in a heterogeneous analysis and verification environment. Introduction and BackgroundAlready 30 years ago Alonzo Church proposed monadic second-order logic on strings (M2L(Str)) as an appropriate specification formalism for reasoning about sequences of bitvectors [9]. This logic is among the most succinct decidable logics known to capture finite state systems. It is decidable, however, only in nonelementary time: the worst-case complexity is a stack of exponentials of height proportional to the size of the formula, a good reason for it having been considered impractical for a long time. Known almost exclusively to theoreticians for a long time, recently this logic celebrates a certain renaissance: despite the worstcase computational 'intractability' of this logic, relevant practical problems are usually far better behaved and can be solved automatically in reasonable time. Fields of application have been the specification, verification, and synthesis, in a fully automatic manner, of relevant classes of parametric systems. In particular, the logic can be used profitably as a description language for model-based analysis of software [17] as well as hardware systems [2,16,18,19] and is therefore a good candidate formalism for hardware/software codesign. Some examples of distributed systems have been addressed too [14,15]. From an application point of view this logic conveniently combines two important features in a single formalism: It is both an abstract specification language and an effective programming language. Every specification can be translated into executable behaviour in the form of an equivalent finite state automaton.In this paper we present MOSEL, a new system for the automatic analysis and verification in Monadic Second-order [ogic. The accent here is put primarily on the system's design, rather than on individual algorithms: MOSEL is a

Synthesizing Semantic Web Service Compositions with jMosel and Golog

“…The first approach uses jMosel [11], our tool for solving Monadic SecondOrder Logic on Strings [19], and the second approach is based on Golog [12], a programming language combining imperative features with a Prolog flavor. As a common case study we have considered the Mediation Scenario of the Semantic Web Service Challenge [1,3], with the goal to synthesize abstract mediator processes, and to describe how the concrete, running (Web) service composition is computed.…”

Theorem proving in technology transfer: the user’s point of view

“…First, there are important results in the field of model checking of infinite state systems (see, for example, [17,56,57]), on hybrid model checking, and on real-time model checking. Second, there is relevant work on decision procedures for parametric systems (see, for example, the Mona system [34] and the Mosel system [33]). …”

Monotonic Abstraction: On Efficient Verification of Parameterized Systems

“…Our method can cope with this kind of systems, since unstructured architectures can be viewed as a special case of linear arrays where the ordering of the processes is not relevant. In [23] and [34], the authors present a tool for the analysis and the verification of linear parameterized hardware systems using the monadic second-order logic on strings.…”