Journal:Informatica
Volume 26, Issue 2 (2015), pp. 199–219
Abstract
Abstract
This paper investigates an approach which is called structural legal visualization (SLV). It is about diagrammatical views which facilitate comprehension of the meaning of legal contents. Complexity reduction is a motive. An issue is the complexity of the entire legal system and the layman’s limited ability to understand legal institutions and the millions of documents. A sequence of views in SLV can be compared with a narrative. SLV differs from information visualization and knowledge visualization. SLV relates to a scenario-centered graphical narrative rather than information display or user interfaces. SLV is about the generation (synthesis) of diagrams. The sequence of images depends on the user’s goals. Different pathways through the informational space are concerned. With respect to an object’s change or non-change, two variations of SLV are identified: dynamic SLV and static SLV. The latter is divided into two: incremental SLV and alternate focuses SLV.
Journal:Informatica
Volume 18, Issue 1 (2007), pp. 37–54
Abstract
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations and focuses on data dependencies in loops. The paper presents language constructs and semantics for expressing programs that have complex data dependency patterns. These constructs are expressed using structural “blanks” for computations based on recurrence relations. In SB the recurrence structure and the functional part of a recurrence relation may be described separately. Therefore declarative representation of data dependencies is examined. SB aims at supporting the transformational development and reuse of program modules. The approach deals with two aspects: pragmatics and semantics. In the paper we aim at: (1) developing a theory and language for functional and structural modules, (2) an algorithm for composition of structural modules. The approach is illustrated by toy problems: the Fibonacci function, heat flow, etc. Hence the reuse and verification are viewed as those of, e.g., stacks, queues, bubble sort, etc.
Journal:Informatica
Volume 10, Issue 1 (1999): Special Issue on Programming Theory, Information System Engineering, Software Engineering, and Artificial Intelligence, pp. 45–70
Abstract
In the paper we examine data dependencies in the algorithm of back substitution in the problem of solving triangular systems of linear equations. The aim of the paper is to illustrate the structural blanks (SB) notation in consistency proof of data dependencies in loop programs. Data dependency semantics of programs is introduced and investigated. The introduced notation constitutes the theoretical basis of data dependencies in SB. Two structural modules – a sequential S-module and a parallel one – are examined.
Journal:Informatica
Volume 9, Issue 1 (1998): Special Issue on Programming Theory, Information System Engineering, Software Engineering, and Artificial Intelligence, pp. 21–50
Abstract
In this paper we examine data dependence in a nested loop programs which are obtained by inserting one loop program into another. This is viewed as the composition of structural modules (S-modules) in the structural blanks (SB) approach. SB is a method for expressing computations based on recurrence relations. It is built on top of traditional programming languages like Fortran or Pascal. SB aims at supporting the transformational development and reuse of program modules that have complex data dependence patterns and provides an architectural framework for software packages.
Journal:Informatica
Volume 6, Issue 4 (1995): Special Issue on Information Systems and Software Systems Engineering, pp. 397–444
Abstract
We present two methods for expressing computations based on recurrence relations and discuss their relative merits. One method, the structural blanks approach, is built on top of traditional programming languages like Fortran or Pascal. It aims at program reuse and bases a certain architecture of software packages. The other method, the constructive recursive approach, is based on recursive relations over graphs.