Stefan Sokolowski

According to our database1, Stefan Sokolowski
  • authored at least 20 papers between 1977 and 2003.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2003
Incommensurate and commensurate phases in adsorbed monolayers: ground state properties.
Annales UMCS, Informatica, 2003

A case for po-manifolds - in chase after a good topological model for concurrency.
Electr. Notes Theor. Comput. Sci., 2003

2002
Investigation of Concurrent Processes by Means of Homotopy Functors.
Mathematical Structures in Computer Science, 2002

2001
Categories of dimaps and their dihomotopies in po-spaces and local po-spaces.
Electr. Notes Theor. Comput. Sci., 2001

Infinitely Running Concurrent Processes with Loops from a Geometric Viewpoint.
Electr. Notes Theor. Comput. Sci., 2001

1999
A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives.
Proceedings of the Static Analysis, 6th International Symposium, 1999

1996
Specifying and Verifying Parametric Processes.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1992
Toward Formal Development of Programs from Algebraic Specifications: Parameterisation Revisited.
Acta Inf., 1992

1988
Understanding an informal Description: Office Documents Architecture, an ISO Standard.
Proceedings of the VDM '88, 1988

A Set-Theoretic Model for a Typed Polymorphic Lambda Calculus - A Contribution to MetaSoft.
Proceedings of the VDM '88, 1988

1987
Soundness of Hoare's Logic: An Automated Proof Using LCF.
ACM Trans. Program. Lang. Syst., 1987

How not to sweep infoxes u nder the carpet.
Bulletin of the EATCS, 1987

1984
Partial Correctness: The Term-Wise Approach.
Sci. Comput. Program., 1984

1981
Axioms for the Term-Wise Correctness of Programs.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Programs as term transformers.
Fundam. Inform., 1980

A Uniform Approach to Applicative and Imperative Features in Programming Languages.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
Complexity of Sorting by Distributive Partitioning.
Inf. Process. Lett., 1979

1978
A Method for Proving Programming Languages non Context-Free.
Inf. Process. Lett., 1978

1977
Axioms for Total Correctness.
Acta Inf., 1977

Total Correctness for Procedures.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977


  Loading...