| 2007 |
|---|
| 33 | EE | Peter Padawitz:
Expander2: Program Verification Between Interaction and Automation.
Electr. Notes Theor. Comput. Sci. 177: 35-57 (2007) |
| 2005 |
|---|
| 32 | EE | Peter Padawitz:
Expander2.
Formal Methods in Software and Systems Modeling 2005: 236-258 |
| 2000 |
|---|
| 31 | EE | Peter Padawitz:
Swinging UML: How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving.
UML 2000: 162-177 |
| 30 | EE | Peter Padawitz:
Swinging types=functions+relations+transition systems.
Theor. Comput. Sci. 243(1-2): 93-165 (2000) |
| 1997 |
|---|
| 29 | | Peter Padawitz:
Towards the one-tiered design of data types and transition systems.
WADT 1997: 365-380 |
| 1996 |
|---|
| 28 | | Peter Padawitz:
Inductive Theorem Proving for Design Specification.
J. Symb. Comput. 21(1): 41-99 (1996) |
| 1995 |
|---|
| 27 | | Peter Padawitz:
Swinging Data Types: Syntax, Semantics, and Theory.
COMPASS/ADT 1995: 409-435 |
| 1994 |
|---|
| 26 | | Mihaly Lenart,
Peter Padawitz,
Ana Pasztor:
Formal specification for design automation.
Formal Design Methods for CAD 1994: 201-220 |
| 1992 |
|---|
| 25 | | Peter Padawitz:
Generic Induction Proofs.
CTRS 1992: 175-197 |
| 1991 |
|---|
| 24 | | Peter Padawitz:
Reduction and Narrowing for Horn Clause Theories.
Comput. J. 34(1): 42-51 (1991) |
| 23 | | Peter Padawitz:
Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic Programs.
J. Autom. Reasoning 7(1): 27-103 (1991) |
| 1989 |
|---|
| 22 | | Peter Padawitz:
Proving the Correctness of Schorr-Waite Graph Marking by Inductive Expansion.
IFIP Congress 1989: 1121-1126 |
| 21 | | Peter Padawitz:
Inductive Proofs by Resolution and Paramodulation.
TAPSOFT, Vol.1 1989: 352-368 |
| 20 | | Peter Padawitz:
Can inductive proofs be automated? Part II.
Bulletin of the EATCS 37: 168-174 (1989) |
| 1988 |
|---|
| 19 | | Peter Padawitz:
Inductive Expansion.
ADT 1988 |
| 18 | | Peter Padawitz:
Can inductive proofs be automated?
Bulletin of the EATCS 35: 163-170 (1988) |
| 17 | | Peter Padawitz:
The Equational Theory of Parameterized Specifications
Inf. Comput. 76(2/3): 121-137 (1988) |
| 1987 |
|---|
| 16 | | Peter Padawitz:
Strategy-Controlled Reduction and Narrowing.
RTA 1987: 242-255 |
| 15 | | Peter Padawitz:
Parameter-Preserving Data Type Specifications.
J. Comput. Syst. Sci. 34(2/3): 179-209 (1987) |
| 1986 |
|---|
| 14 | | Peter Padawitz:
The Use of Terminal Semantics for Disproving Inductive Theorems.
ADT 1986 |
| 1985 |
|---|
| 13 | | Peter Padawitz:
Parameter Preserving Data Type Specifications.
TAPSOFT, Vol.1 1985: 323-341 |
| 1984 |
|---|
| 12 | | Peter Padawitz:
Towards a Proof Theory of Parameterized Specifications.
Semantics of Data Types 1984: 375-391 |
| 11 | | Peter Padawitz,
Martin Wirsing:
Completeness of many-sorted equational logic revisited.
Bulletin of the EATCS 24: 88-93 (1984) |
| 1983 |
|---|
| 10 | | Ulrich Grude,
Peter Padawitz:
Initial and Fixpoint Semantics of Algebraic Specifications.
ADT 1983 |
| 1982 |
|---|
| 9 | | Peter Padawitz:
On the Proof of Completeness and Consistency.
ADT 1982 |
| 8 | | Peter Padawitz:
Graph Grammars and Operational Semantics.
Theor. Comput. Sci. 19: 117-141 (1982) |
| 7 | | Hartmut Ehrig,
Hans-Jörg Kreowski,
Bernd Mahr,
Peter Padawitz:
Algebraic Implementation of Abstract Data Types.
Theor. Comput. Sci. 20: 209-263 (1982) |
| 1980 |
|---|
| 6 | | Hartmut Ehrig,
Hans-Jörg Kreowski,
Peter Padawitz:
Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness.
ICALP 1980: 142-156 |
| 5 | | Hartmut Ehrig,
Hans-Jörg Kreowski,
Bernd Mahr,
Peter Padawitz:
Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems.
MFCS 1980: 231-245 |
| 4 | | Peter Padawitz:
New Results on Completeness and Consistency of Abstract Data Types.
MFCS 1980: 460-473 |
| 3 | | Hartmut Ehrig,
Hans-Jörg Kreowski,
Peter Padawitz:
A Case Study of Abstract Implementations and Their Correctness.
Symposium on Programming 1980: 108-122 |
| 1978 |
|---|
| 2 | | Peter Padawitz:
Graph Grammars and Operational Semantics.
Graph-Grammars and Their Application to Computer Science and Biology 1978: 350-366 |
| 1 | | Hartmut Ehrig,
Hans-Jörg Kreowski,
Peter Padawitz:
Stepwise Specification and Implementation of Abstract Data Types.
ICALP 1978: 205-226 |
