SC Harvester Papers Database Interface

Specification for Verification

H. Hansson, B. Jonsson, F. Orava, B. Pehrson. In: . 1989

A framework for reasoning about time and reliability

H. Hansson, B. Jonsson. In: [1989] Proceedings. Real-Time Systems Symposium. 1989

Edge concentration: a method for clustering directed graphs

Frances Paulisch. In: Proceedings of the 2nd International Workshop on Software configuration management. 1989

Morphological findings during retinal development and maturation in hereditary rod-cone degeneration in Abyssinian cats.

Kristina Narfström, Kristina Narfström, S. Nilsson. In: Experimental eye research. 1989

Single-Assignment Semantics for Imperative Programs

B. Lisper. In: . 1989

Synthesizing Synchronous Systems by Static Scheduling in Space-Time

B. Lisper. In: . 1989

Computational events and computation networks

B. Lisper. In: . 1989

Data dependent scheduling

B. Lisper. In: . 1989

Formal expressions as schemes for evaluation

B. Lisper. In: . 1989

Schedules and performance criteria

B. Lisper. In: . 1989

Compound events of computation

B. Lisper. In: . 1989

Index vectors and complexity

B. Lisper. In: . 1989

A hardware model

B. Lisper. In: . 1989

Knowledge-Based Planning of Experiments in a Biochemical Domain: Membrane Protein Purification

H. Eriksson, K. Sandahl. In: . 1989

Edge Concentration: A Method for Clustering Directed Graphs

Frances Paulisch. In: . 1989

Abstract: The display of a directed graph is a commonly used visual aid for representing relationships. However, some graphs contain so many edges that their display by traditional graph layout algorithms is virtually impossible because of the overwhelming number of crossings. Graphs representing large software systems and their configurations are particularly prone to this problem. Examples of such graphs ...