Stefan Sokolowski

Stefan Sokolowski: A case for po-manifolds - in chase after a good topological model for concurrency. Electr. Notes Theor. Comput. Sci. 81: 15-35 (2003)

Stefan Sokolowski: Investigation of Concurrent Processes by Means of Homotopy Functors. Mathematical Structures in Computer Science 12(5): 665-699 (2002)

Lisbeth Fajstrup, Stefan Sokolowski: Infinitely Running Concurrent Processes with Loops from a Geometric Viewpoint. Electr. Notes Theor. Comput. Sci. 39(2): 1-19 (2001)

Stefan Sokolowski: Categories of dimaps and their dihomotopies in po-spaces and local po-spaces. Electr. Notes Theor. Comput. Sci. 52(2): 164-186 (2001)

John Hatcliff, James C. Corbett, Matthew B. Dwyer, Stefan Sokolowski, Hongjun Zheng: A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives. SAS 1999: 1-18

Wieslaw Pawlowski, Pawel Paczkowski, Stefan Sokolowski: Specifying and Verifying Parametric Processes. MFCS 1996: 469-481

Andrzej M. Borzyszkowski, Stefan Sokolowski (Eds.): Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings. Lecture Notes in Computer Science 711, Springer 1993, isbn 3-540-57182-5

Donald Sannella, Stefan Sokolowski, Andrzej Tarlecki: Toward Formal Development of Programs from Algebraic Specifications: Parameterisation Revisited. Acta Inf. 29(8): 689-736 (1992)

Andrzej M. Borzyszkowski, Stefan Sokolowski: Understanding an informal Description: Office Documents Architecture, an ISO Standard. VDM Europe 1988: 48-63

Andrzej M. Borzyszkowski, Ryszard Kubiak, Stefan Sokolowski: A Set-Theoretic Model for a Typed Polymorphic Lambda Calculus - A Contribution to MetaSoft. VDM Europe 1988: 267-298

Stefan Sokolowski: How not to sweep infoxes u nder the carpet. Bulletin of the EATCS 31: 42-46 (1987)

Stefan Sokolowski: Soundness of Hoare's Logic: An Automated Proof Using LCF. ACM Trans. Program. Lang. Syst. 9(1): 100-120 (1987)

Stefan Sokolowski: Partial Correctness: The Term-Wise Approach. Sci. Comput. Program. 4(2): 141-157 (1984)

Stefan Sokolowski: Axioms for the Term-Wise Correctness of Programs. MFCS 1981: 499-507

Stefan Sokolowski: Programs as term transformers. Fundam. Inform. 3(4): 419-432 (1980)

Stefan Sokolowski: A Uniform Approach to Applicative and Imperative Features in Programming Languages. MFCS 1980: 612-626

Boguslaw L. Jackowski, Ryszard Kubiak, Stefan Sokolowski: Complexity of Sorting by Distributive Partitioning. Inf. Process. Lett. 9(2): 100 (1979)

Stefan Sokolowski: A Method for Proving Programming Languages non Context-Free. Inf. Process. Lett. 7(3): 151-153 (1978)

Stefan Sokolowski: Axioms for Total Correctness. Acta Inf. 9: 61-71 (1977)

Stefan Sokolowski: Total Correctness for Procedures. MFCS 1977: 475-483