![]() | ![]() |
1980 | ||
---|---|---|
3 | Lech Banachowski: On proving program correctness by means of stepwise refinement method. Logic of Programs 1980: 27-44 | |
2 | Lech Banachowski: A Complement to Tarjan's Result about the Lower Bound on the Complexity of the Set Union Problem. Inf. Process. Lett. 11(2): 59-65 (1980) | |
1974 | ||
1 | Lech Banachowski: Modular Approach to the Logical Theory of Programs. MFCS 1974: 327-332 |