Grazyna Mirkowska

According to our database1, Grazyna Mirkowska authored at least 17 papers between 1976 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Collatz conjecture becomes theorem.
CoRR, 2023

2009
Verifying a Class: combining Testing and Proving.
Fundam. Informaticae, 2009

2008
Algorithmic Logic + SpecVer = the Methodology for High Integrity Programming - Invited Paper.
Fundam. Informaticae, 2008

2000
First-Order Specifications of Programmable Data Types.
SIAM J. Comput., 2000

1996
The Algebraic Specifications do not Have the Tennenbaum Property.
Fundam. Informaticae, 1996

1987
Axiomatic definability of programming language semantics.
Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

1986
On Applications of Algorithmic Logic.
Proceedings of the CAAP '86, 1986

On Axiomatic Definition of Max-Model of Concurrency.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

1981
PAL - propositional algorithmic logic.
Fundam. Informaticae, 1981

The Representation Theorem for Algorithmic Algebras.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

The Deducibility Problem in Propositional Dynamic Logic.
Proceedings of the Automata, 1981

1980
Model existence theorems in algorithmic logic with non-deterministic programs.
Fundam. Informaticae, 1980

Algorithmic logic with nondeterministic programs.
Fundam. Informaticae, 1980

Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

On the propositional algorithmic theory of arithmetic.
Proceedings of the Logics of Programs and Their Applications, 1980

1979
On the Propositional Algorithmic Logic.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1976
A Complete Axiomatic Characterization of Algorithmic Properties of Block-Structured Programs with Procedures.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976


  Loading...