RelView
The RelView-System is an interactive tool for computer-supported manipulation of relations represented as Boolean matrices or directed graphs, especially for prototyping relational specifications and programs. It is developed at the Department of Computer Science of the Christian-Albrechts-University of Kiel. This Web-page describes how to get RelView and provides some further information.
Keywords for this software
References in zbMATH (referenced in 98 articles , 2 standard articles )
Showing results 1 to 20 of 98.
Sorted by year (- Berghammer, Rudolf; Schmidt, Gunther; Winter, Michael: Cryptomorphic topological structures: a computational, relation-algebraic approach (2019)
- Guttmann, Walter: Verifying minimum spanning tree algorithms with Stone relation algebras (2018)
- Guttmann, Walter: An algebraic framework for minimum spanning tree problems (2018)
- Joosten, Stef: Relation algebra as programming language using the Ampersand compiler (2018)
- Alain, Mathieu; Desharnais, Jules: Relations as images (2017)
- Berghammer, Rudolf: Tool-based relational investigation of closure-interior relatives for finite topological spaces (2017)
- Berghammer, Rudolf; Winter, Michael: Solving computational tasks on finite topologies by means of relation algebra and the RelView tool (2017)
- Guttmann, Walter: Stone relation algebras (2017)
- Joosten, Stef: Software development in relation algebra with ampersand (2017)
- Killingbeck, Dylan; Teixeira, Milene Santos; Winter, Michael: Relations in linear algebra (2017)
- Berghammer, Rudolf; Danilenko, Nikita; Höfner, Peter; Stucke, Insa: Cardinality of relations with applications (2016)
- Berghammer, Rudolf; Höfner, Peter; Stucke, Insa: Cardinality of relations and relational approximation algorithms (2016)
- Guttmann, Walter: Relation-algebraic verification of Prim’s minimum spanning tree algorithm (2016)
- Jaskolka, Jason; Khedri, Ridha: Mitigating covert channels based on analysis of the potential for communication (2016)
- Polyakovskiy, S.; Berghammer, R.; Neumann, F.: Solving hard control problems in voting systems via integer programming (2016)
- Berghammer, Rudolf: Column-wise extendible vector expressions and the relational computation of sets of sets (2015)
- Berghammer, Rudolf; Fischer, Sebastian: Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (2015)
- Berghammer, Rudolf; Höfner, Peter; Stucke, Insa: Tool-based verification of a relational vertex coloring program (2015)
- Berghammer, Rudolf; Schnoor, Henning: Control of Condorcet voting: complexity and a relation-algebraic approach (2015)
- Berghammer, Rudolf; Stucke, Insa; Winter, Michael: Investigating and computing bipartitions with algebraic means (2015)
Further publications can be found at: https://www.informatik.uni-kiel.de/~progsys/relview/papers