Computing in Horn clause theories
Computing in Horn clause theories
Deduction and declarative programming
Deduction and declarative programming
Inductive theorem proving for design specifications
Journal of Symbolic Computation
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of the ACM (JACM)
Theoretical Computer Science
Swinging types = functions + relations + transition systems
Theoretical Computer Science
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
| Hi-index | 0.00 |
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or computation sequences. Moreover, tailor-made interpreters display terms as two-dimensional structures ranging from trees and rooted graphs to a variety of pictorial representations that include tables, matrices, alignments, partitions, fractals and turtle systems. Proofs and computations performed with Expander2 follow the rules and the semantics of swinging types. Swinging types are based on many-sorted predicate logic and combine constructor-based types with destructor-based (e.g. state-based) ones. The former come as initial term models, the latter as final models consisting of context interpretations. Relation symbols are interpreted as least or greatest solutions of their respective axioms. This paper presents an overview of Expander2 with particular emphasis on the system's prover capabilities. It is an adaptation of [P. Padawitz, Expander2: Towards a Workbench for Interactive Formal Reasoning, in: H.-J. Kreowski, U. Montanari, F. Orejas, G. Rozenberg, G. Taentzer, eds., Formal Methods in Software and Systems Modeling, Springer LNCS 3393 (2005) 236-258] to the latest version of Expander2. In particular, proof rules tailor-made for transition rule specifications have been added to the system and are discussed and exemplified here for the first time.