Results 1 
9 of
9
An Optimal Algorithm for Generating Minimal Perfect Hash Functions
 Information Processing Letters
, 1992
"... A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic, involving generation of random graphs. It uses expected linear time and requires a linear number words to represent the hash function, and thus is optimal up to constant facto ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic, involving generation of random graphs. It uses expected linear time and requires a linear number words to represent the hash function, and thus is optimal up to constant factors. It runs very fast in practice. Keywords: Data structures, probabilistic algorithms, analysis of algorithms, hashing, random graphs
Graph Based Modeling and Implementation with EER/GRAL
, 1996
"... This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Zlike constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give con ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Zlike constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give conceptual models which can be implemented in a seamless manner by efficient data structures using the GraLab graph library. Descriptions of four medium size EER/GRALapplications conclude the paper to demonstrate the usefulness of the approach in practice.
A Declarative Approach to Graph Based Modeling
 Graphtheoretic Concepts in Computer Science, number 903 in LNCS
, 1995
"... The class of TGraphs, i.e. typed, attributed, and ordered directed graphs, is introduced as a general graph class for graph based modeling. TGraphs are suitable for a wide area of applications. A declarative approach to specifying subclasses of TGraphs by a combination of a schematic graphical descr ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
The class of TGraphs, i.e. typed, attributed, and ordered directed graphs, is introduced as a general graph class for graph based modeling. TGraphs are suitable for a wide area of applications. A declarative approach to specifying subclasses of TGraphs by a combination of a schematic graphical description and an additional constraint language is given. The implementation of TGraphs by an appropriate software approach is described. 1 Introduction Modeling parts of the real world is a wide area of applications of graph theoretic concepts in practice. E.g. in the software design process the structure of the information to be kept and handled by the system is often describable by graphs. In order to describe which graphs are correct models and which are not, an approach to describing classes of graphs (graph languages) is necessary. Since graphs are to the same extent B expressive pictures, B formal models, and B efficient data structures, a wellbased approach to working with graphs i...
XMLbased Reference Modelling: Foundations of an EPC Markup Language
 Referenzmodellierung  Proceedings of the 8th GIWorkshop on Reference Modelling, MKWI
, 2004
"... The advent of XML... This paper describes the proposal of an EPC Markup Language from its guiding design principles to its concrete definition. We gather findings from other XML standardisation initiatives and derive general EPML design principles, as well as theoretical and practical XML design gui ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
The advent of XML... This paper describes the proposal of an EPC Markup Language from its guiding design principles to its concrete definition. We gather findings from other XML standardisation initiatives and derive general EPML design principles, as well as theoretical and practical XML design guidelines. A survey on graph representation in XML languages founds the decision to model EPC processes as edge element lists. Subsequently, the syntactical elements of EPML describing EPC hierarchies, EPC control flow, graphical display of objects, and business perspectives on EPCs are discussed.
Generic Support for Understanding Heterogeneous Software
 FACHBERICHT INFORMATIK 3/96, UNIVERSITAT KOBLENZLANDAU, FACHBEREICH INFORMATIK
, 1996
"... The GUPRO approach to support program understanding in heterogeneous software environments is presented. GUPRO is an acronym for Generic Understanding of PROgrams. A tool of the GUPRO family consists of a parsing component which translates source code into a repository together with a source code in ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The GUPRO approach to support program understanding in heterogeneous software environments is presented. GUPRO is an acronym for Generic Understanding of PROgrams. A tool of the GUPRO family consists of a parsing component which translates source code into a repository together with a source code independent query component. Since the repository can be defined for different languages on arbitrary levels of granularity a generic program understanding tool is given. Thus, also heterogeneous software environments using various programming languages can be analysed.
Signatures for Library Functions in Executable Files
, 1993
"... A method for efficiently generating signatures for detecting library functions in executable files is described. The signatures are used to automatically detect such functions in dcc, the reverse compiler at the Queensland University of Technology. Difficulties arise from the variability of the sign ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A method for efficiently generating signatures for detecting library functions in executable files is described. The signatures are used to automatically detect such functions in dcc, the reverse compiler at the Queensland University of Technology. Difficulties arise from the variability of the signatures, the multiplicity of library code vendors, and of memory models, and indistinguishable functions. An efficient hashing technique involving perfect optimal hashing functions is used. Performance is good  the signature files are created in a few seconds, and the name of a library function can be found in about the time of two standard hashes. One signature file is required for each vendor, version, and memory model combination, and they are generated from the appropriate library file (e.g. slibce.lib). Some issues are yet to be addressed, such as variation due to floating point math options (e.g. emulator, fast alternate, or coprocessor calls). 1 Application Signatures are required w...
GDR: A Visualization Tool For Graph Algorithms
 In Proceedings of Computational Support for Discrete Mathematics
, 1991
"... . This paper describes GDR, a tool for editing graphs and animating graph algorithms. The design of GDR emphasizes simplicity and the ability to interact with other tools. GDR has been used to implement classroom animations of graph algorithms and finite automata, and as a research tool for prototyp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. This paper describes GDR, a tool for editing graphs and animating graph algorithms. The design of GDR emphasizes simplicity and the ability to interact with other tools. GDR has been used to implement classroom animations of graph algorithms and finite automata, and as a research tool for prototyping algorithms. 1. Introduction GDR (for Graph Drawing) is a tool for editing graphs and animating graph algorithms. The motivation for animation tools comes primarily from the classroom; students often have difficulty mastering the formal concepts of graph theory, even though they usually have no trouble in following the associated visual intuitions. An appropriate animation tool can provide an invaluable link between formalism and graphical intuition, since students are given the opportunity to see how a formal presentation of a graph algorithm directly translates into visually intuitive operations on graphs. For this reason, animation tools can also play a useful research role as testbed...
A Comparative Study of Code Query Technologies
, 2011
"... When analyzing software systems we are faced with the challenge of how to implement a particular analysis for different programming languages. A solution for this problem is to write a single analysis using a code query language abstracting from the specificities of languages being analyzed. Over th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
When analyzing software systems we are faced with the challenge of how to implement a particular analysis for different programming languages. A solution for this problem is to write a single analysis using a code query language abstracting from the specificities of languages being analyzed. Over the past ten years many code query technologies have been developed, based on different formalisms. Each technology comes with its own query language and set of features. To determine the state of the art of code querying we compare the languages and tools for seven code query technologies: Grok, Rscript, JRelCal, SemmleCode, JGraLab, CrocoPat and JTransformer. The specification of a package stability metric is used as a running example to compare the languages. The comparison involves twelve criteria, some of which are concerned with properties of the query language (paradigm, types, parametrization, polymorphism, modularity, and libraries), and some of which are concerned with the tool itself (output formats, interactive interface, API support, interchange formats, extraction support, and licensing). We contextualize the criteria in two usage scenarios: interactive and tool integration. We conclude that there is no particularly weak or dominant tool. As important improvement points, we identify the lack of library mechanisms, interchange formats, and possibilities for integration with source code extraction components.
KGB  A Customizable Graph Browser
, 1995
"... ion Common visualization techniques like windowing, zooming, fisheye view or graph folding are not suitable to render graphs larger than a few thousand vertices and edges [7, 8, 9, 11]. Beyond this threshold either the required drawing area gets too large or the size of the graph elements approach ..."
Abstract
 Add to MetaCart
ion Common visualization techniques like windowing, zooming, fisheye view or graph folding are not suitable to render graphs larger than a few thousand vertices and edges [7, 8, 9, 11]. Beyond this threshold either the required drawing area gets too large or the size of the graph elements approaches the size of a pixel. In any case the amount of the displayed information easily overloads human ability to successfully perceive and utilize it, so that other techniques have to be used. Abstraction describes a method that hides irrelevant detail and by that enhances larger interrelations. It is therefore an adequate method to filter and structure large amounts of information. The KGB currently offers three variations of abstraction which are shortly described in the next three paragraphs. Abstraction by Global Exclusion. This method permits to selectively exclude certain graph elements from browsing. It is based on the idea that a large and complex graph contains several semantic struct...