Stepwise Specification and Implementation of Abstract Data Types. - Hartmut Ehrig; Hans-Jörg Kreowski; Peter Padawitz (ICALP, 1978)

Algebraic implementation of abstract data types: an announcement. - Hartmut Ehrig; Hans-Jörg Kreowski; Peter Padawitz (SIGACT News, 1979)

Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness. - Hartmut Ehrig; Hans-Jörg Kreowski; Peter Padawitz (ICALP, 1980)

Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems. - Hartmut Ehrig; Hans-Jörg Kreowski; Bernd Mahr; Peter Padawitz (MFCS, 1980)

New Results on Completeness and Consistency of Abstract Data Types. - Peter Padawitz (MFCS, 1980)

A Case Study of Abstract Implementations and Their Correctness. - Hartmut Ehrig; Hans-Jörg Kreowski; Peter Padawitz (Symposium on Programming, 1980)

On the Proof of Completeness and Consistency. - Peter Padawitz (ADT, 1982)

Equational Data Type Specifications and Recursive Program Schemes. - Peter Padawitz (Formal Description of Programming Concepts, 1982)

Algebraic Implementation of Abstract Data Types. - Hartmut Ehrig; Hans-Jörg Kreowski; Bernd Mahr; Peter Padawitz (Theor. Comput. Sci., 1982)

Graph Grammars and Operational Semantics. - Peter Padawitz (Theor. Comput. Sci., 1982)

Initial and Fixpoint Semantics of Algebraic Specifications. - Ulrich Grude; Peter Padawitz (ADT, 1983)

Correctness, completeness, and consistency of equational data type specifications. - Peter Padawitz (1983)

Towards a Proof Theory of Parameterized Specifications. - Peter Padawitz (Semantics of Data Types, 1984)

Completeness of many-sorted equational logic revisited. - Peter Padawitz; Martin Wirsing (Bull. EATCS, 1984)

The Use of Terminal Semantics for Disproving Inductive Theorems. - Peter Padawitz (ADT, 1986)

Strategy-Controlled Reduction and Narrowing. - Peter Padawitz (RTA, 1987)

Parameter-Preserving Data Type Specifications. - Peter Padawitz (J. Comput. Syst. Sci., 1987)

Inductive Expansion. - Peter Padawitz (ADT, 1988)

Can inductive proofs be automated? - Peter Padawitz (Bull. EATCS, 1988)

The Equational Theory of Parameterized Specifications - Peter Padawitz (Inf. Comput., 1988)

Computing in Horn Clause Theories - Peter Padawitz (Springer, 1988)

Proving the Correctness of Schorr-Waite Graph Marking by Inductive Expansion. - Peter Padawitz (IFIP Congress, 1989)

Inductive Proofs by Resolution and Paramodulation. - Peter Padawitz (TAPSOFT, Vol.1, 1989)

Can inductive proofs be automated? Part II. - Peter Padawitz (Bull. EATCS, 1989)

Reduction and Narrowing for Horn Clause Theories. - Peter Padawitz (Comput. J., 1991)

Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic Programs. - Peter Padawitz (J. Autom. Reason., 1991)

Deduction and declarative programming. - Peter Padawitz (Cambridge University Press, 1992)

Generic Induction Proofs. - Peter Padawitz (CTRS, 1992)

Formal specification for design automation. - Mihaly Lenart; Peter Padawitz; Ana Pasztor (Formal Design Methods for CAD, 1994)

Swinging Data Types: Syntax, Semantics, and Theory. - Peter Padawitz (COMPASS/ADT, 1995)

Inductive Theorem Proving for Design Specification. - Peter Padawitz (J. Symb. Comput., 1996)

Towards the one-tiered design of data types and transition systems. - Peter Padawitz (WADT, 1997)

Proof in Flat Specifications. - Peter Padawitz (Algebraic Foundations of Systems Specification, 1999)

Swinging UML: How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving. - Peter Padawitz (UML, 2000)

Swinging types=functions+relations+transition systems. - Peter Padawitz (Theor. Comput. Sci., 2000)

Expander2. - Peter Padawitz (Formal Methods in Software and Systems Modeling, 2005)

Expander2: Program Verification Between Interaction and Automation. - Peter Padawitz (WFLP, 2006)

Algebraic Model Checking. - Peter Padawitz (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

From Grammars and Automata to Algebras and Coalgebras. - Peter Padawitz (CAI, 2011)