We stand with Ukraine

We stand with Ukraine

Peter Padawitz

Affiliations:

Technical University of Dortmund, Germany

According to our database¹, Peter Padawitz authored at least 39 papers between 1978 and 2011.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on fldit-www.cs.uni-dortmund.de
on dl.acm.org

On csauthors.net:

Bibliography

2011

From Grammars and Automata to Algebras and Coalgebras.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010

Algebraic Model Checking.

[BibT_eX]

[DOI]

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

2006

Expander2: Program Verification Between Interaction and Automation.

[BibT_eX]

[DOI]

Proceedings of the 15th Workshop on Functional and (Constraint) Logic Programming, 2006

2005

Expander2.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2000

Swinging types=functions+relations+transition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Swinging UML: How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving.

[BibT_eX]

[DOI]

Proceedings of the «UML» 2000, 2000

1999

Proof in Flat Specifications.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Foundations of Systems Specification, 1999

1997

Towards the one-tiered design of data types and transition systems.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

1996

Inductive Theorem Proving for Design Specification.

[BibT_eX]

[DOI]

J. Symb. Comput., 1996

1995

Swinging Data Types: Syntax, Semantics, and Theory.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Data Type Specification, 1995

1994

Formal specification for design automation.

[BibT_eX]

,

,

Proceedings of the Formal Design Methods for CAD, 1994

1992

Generic Induction Proofs.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

Deduction and declarative programming.

[BibT_eX]

Cambridge tracts in theoretical computer science 28, Cambridge University Press, ISBN: 978-0-521-41723-5, 1992

1991

Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic Programs.

[BibT_eX]

[DOI]

J. Autom. Reason., 1991

Reduction and Narrowing for Horn Clause Theories.

[BibT_eX]

[DOI]

Comput. J., 1991

1989

Can inductive proofs be automated? Part II.

[BibT_eX]

Bull. EATCS, 1989

Inductive Proofs by Resolution and Paramodulation.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Proving the Correctness of Schorr-Waite Graph Marking by Inductive Expansion.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Computing in Horn Clause Theories

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 16, Springer, ISBN: 978-3-642-73824-1, 1988

The Equational Theory of Parameterized Specifications

[BibT_eX]

[DOI]

Inf. Comput., 1988

Can inductive proofs be automated?

[BibT_eX]

Bull. EATCS, 1988

Inductive Expansion.

[BibT_eX]

Proceedings of the 6st Workshop on Abstract Data Type, 1988. University of Berlin, Germany, 1988

1987

Parameter-Preserving Data Type Specifications.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

Strategy-Controlled Reduction and Narrowing.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1986

The Use of Terminal Semantics for Disproving Inductive Theorems.

[BibT_eX]

Proceedings of the 4st Workshop on Abstract Data Type, 1986

1984

Completeness of many-sorted equational logic revisited.

[BibT_eX]

,

Bull. EATCS, 1984

Towards a Proof Theory of Parameterized Specifications.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Data Types, International Symposium, 1984

1983

Correctness, completeness, and consistency of equational data type specifications.

[BibT_eX]

[DOI]

PhD thesis, 1983

Initial and Fixpoint Semantics of Algebraic Specifications.

[BibT_eX]

,

Proceedings of the Proceedings 2nd Workshop on Abstract Data Type, 1983

1982

Graph Grammars and Operational Semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Algebraic Implementation of Abstract Data Types.

[BibT_eX]

[DOI]

,

Hans-Jörg Kreowski

,

,

Theor. Comput. Sci., 1982

Equational Data Type Specifications and Recursive Program Schemes.

[BibT_eX]

Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

On the Proof of Completeness and Consistency.

[BibT_eX]

Proceedings of the Proceedings 1st Workshop on Abstract Data Type, 1982

1980

A Case Study of Abstract Implementations and Their Correctness.

[BibT_eX]

[DOI]

,

Hans-Jörg Kreowski

,

Proceedings of the International Symposium on Programming, 1980

New Results on Completeness and Consistency of Abstract Data Types.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems.

[BibT_eX]

[DOI]

,

Hans-Jörg Kreowski

,

,

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness.

[BibT_eX]

[DOI]

,

Hans-Jörg Kreowski

,

Proceedings of the Automata, 1980

1979

Algebraic implementation of abstract data types: an announcement.

[BibT_eX]

[DOI]

,

Hans-Jörg Kreowski

,

SIGACT News, 1979

1978

Stepwise Specification and Implementation of Abstract Data Types.

[BibT_eX]

[DOI]

,

Hans-Jörg Kreowski

,

Proceedings of the Automata, 1978

Loading...