Andrzej Salwicki

According to our database1, Andrzej Salwicki authored at least 26 papers between 1974 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A new proof of Euclid's algorithm.
CoRR, 2023

Collatz conjecture becomes theorem.
CoRR, 2023

2013
Some Methodological Remarks Inspired by the Paper "On inner classes" by A. Igarashi and B. Pierce.
Fundam. Informaticae, 2013

2009
On an algorithm determining direct superclasses in Java and similar languages with inner classes - Its correctness, completeness and uniqueness of solutions.
Inf. Comput., 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

A Deterministic Algorithm for Identifying Direct Superclasses in Java.
Fundam. Informaticae, 2008

2007
Andrzej Grzegorczyk's Contribution to Computer Science.
Fundam. Informaticae, 2007

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

1991
On a Hierarchy of File Types and a Tower of Their Theories.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
LOGPLAN '88 - Report on the Programming Language
Lecture Notes in Computer Science 414, Springer, ISBN: 3-540-52325-1, 1990

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

1982
Algorithmic Theories of Data Structures.
Proceedings of the Automata, 1982

1981
Critical Remarks on MAX Model of Concurrency.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

1980
On the algorithmic theory of stacks.
Fundam. Informaticae, 1980

Axioms of Algorithmic Logic Univocally Determine Semantics of Programs.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
On the Algorithmic Properties of Concurrent Programs.
Proceedings of the Logics of Programs, Workshop, ETH Zürich, May-July 1979, 1979

On the Algorithmic Theory of Dictionaries.
Proceedings of the Logics of Programs, Workshop, ETH Zürich, May-July 1979, 1979

1977
Applied Algorithmic Logic.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

An Algorithmic Approach to Set Theory.
Proceedings of the Fundamentals of Computation Theory, 1977

1976
Computational Processes Generated by Programs with Recursive Procedures and Block Structures.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

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

1974
Procedures, Formal Computations and Models.
Proceedings of the Mathematical Foundations of Computer Science, 1974


  Loading...