Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Helmuth Partsch

dblp:p/HPartsch · also Helmuth Arthur Partsch · DBLP profile ↗
← Back
13ranked-venue papers
8as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 8 · 6 first-authorTheory of computation · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 78% Requirements engineering and software design · 12% Programming languages and type systems · 10%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › program transformation
semantics-preserving transformation
0.011989
Formal Program Construction by Transformations-Computer-Aided, Intuition-Guided Programming · IEEE Trans. Software Eng. 1989
Compilers and program optimization › program transformation › program derivation
transformational implementation
0.011989
Formal Program Construction by Transformations-Computer-Aided, Intuition-Guided Programming · IEEE Trans. Software Eng. 1989
Requirements engineering and software design
formal specification
0.011989
Formal Program Construction by Transformations-Computer-Aided, Intuition-Guided Programming · IEEE Trans. Software Eng. 1989
Programming languages and type systems
abstract data types
0.011979
Existential Quantifiers in Abstract Data Types · ICALP 1979
Logic in computer science
type theory
0.011979
Existential Quantifiers in Abstract Data Types · ICALP 1979
YearPublicationVenuePosition
1992 How to Produce Correct Software - An Introduction to Formal Specification and Program Development by Transformations
abstract
The task of software production is to build software systems which are to fulfil certain requirements. For years the approach has been to build up by trial and error a program which, having satisfied carefully prepared test data, offers a plausible solution to the problem. But is it correct? Even for toy examples this is not obvious. In particular, it is often not even clear whether the original problem has been properly understood. The reason for this dilemma is that the transition from the informal problem statement to the final program is too big to be intellectually manageable. To master these problems, we advocate a software development method where the whole process is split into smaller steps by introducing formal specifications for (parts of) the problem and then stepwisely deriving efficient programs by correctness-preserving transformations.
Eerke A. Boiten, Helmuth Partsch, Daniel Tuijnman, Norbert Völker
Comput. J.2
1990 A Fast Pattern Matching Algorithm Derived by Transformational and Assertional Reasoning
abstract
Abstract Highly optimised algorithms are, in general, hard to understand. This is a consequence of the designer's sacrifice of clarity and modularity in favour of efficiency. In this paper we present a formal derivation of a rather ingenious algorithm, viz., the fast pattern matching algorithm of Boyer and Moore. The development illustrates that transformational programming combined with assertional reasoning provides an appropriate approach for developing and understanding highly optimised algorithms.
Helmuth Partsch, Frank A. Stomp
Formal Aspects Comput.1
1989 From Informal Requirements to a Running Program: A Case Study in Algebraic Specification and Transformational Programming
Helmuth Partsch
Sci. Comput. Program.1
1989 Formal Program Construction by Transformations-Computer-Aided, Intuition-Guided Programming
abstract
Formal program construction by transformations is a method of software development in which a program is derived from a formal problem specification by manageable, controlled transformation steps which guarantee that the final product meets the initial specification. This methodology has been investigated in the Munich project CIP (computer-aided intuition-guided programming). The research includes the design of a wide-spectrum language specifically tailored to the needs of transformational programming, the construction of a transformation system to support the methodology, and the study of transformation rules and other methodological issues. Particular emphasis has been laid on developing a sound theoretical basis for the overall approach.>
Friedrich L. Bauer, Bernhard Möller, Helmuth Partsch, Peter Pepper
IEEE Trans. Software Eng.3
1986 Transformational Program Development in a Particular Program Domain
Helmuth Partsch
Sci. Comput. Program.1
1984 Structuring Transformational Developments: A Case Study Based on Earley's Recognizer
Helmuth Partsch
Sci. Comput. Program.1
1983 On the Use of Algebraic Methods for Formal Requirements Definitions
Helmuth Partsch
Requirements Engineering1
1983 Abstract Data Types as a Tool for Requirement Engineering
Helmuth Partsch, Peter Pepper
Requirements Engineering1
1983 On Hierarchies of Abstract Data Types
Martin Wirsing, Peter Pepper, Helmuth Partsch, Walter Dosch
Acta Informatica3
1983 An Exercise in the Transformational Derivation of an Efficient Program by Joing Development of Control and Data Structure
Helmuth Partsch
Sci. Comput. Program.1
1981 Programming in a Wide Spectrum Language: A Collection of Examples
Friedrich L. Bauer, Manfred Broy, Walter Dosch, Rupert Gnatz, Bernd Krieg-Brückner, Alfred Laut, M. Luckmann, Thomas Matzner, Bernhard Möller, Helmuth Partsch, Peter Pepper, Klaus Samelson, Ralf Steinbrüggen, Martin Wirsing, Hans Wössner
Sci. Comput. Program.10
1979 Existential Quantifiers in Abstract Data Types
Manfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing
ICALP3
1976 A Family of Rules for Recursion Removal
Helmuth Partsch, Peter Pepper
Inf. Process. Lett.1