Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wladyslaw M. Turski

dblp:31/3189 · DBLP profile ↗
← Back
23ranked-venue papers
20as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 11 · 9 first-authorTheory of computation · 7 · 7 first-authorDatabases, data management, data science and information retrieval · 4 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
4 papers
Software maintenance and evolution · 90% Requirements engineering and software design · 5% Compilers and program optimization · 5%
Theoretical computer science
2 papers
Logic in computer science · 100%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › program transformation
program derivation
0.011984
On Programming by Iterations · IEEE Trans. Software Eng. 1984
Requirements engineering and software design
software process
0.011984
On What Exactly Is Going On When Software Is Developed Step-by-Step · ICSE 1984

Methods — techniques the papers use, named apart from their topics

differential equations · 0.0
YearPublicationVenuePosition
2003 It was fun
Wladyslaw M. Turski
Inf. Process. Lett.1
2002 The Reference Model for Smooth Growth of Software Systems Revisited
abstract
Terms-Software evolution,The difference equation determining evolutionary growth of (some) software systems is generalized to a differential one. A hypothetical geometric model is derived and its possible uses are illustrated.
Wladyslaw M. Turski
IEEE Trans. Software Eng.1
2000 Essay on Software Engineering at the Turn of Century
Wladyslaw M. Turski
FASE1
1998 Should/could software be more reliable than the "world" in which it is used?
abstract
The Concise Oxford Dictionary defines the adjective "reliable" as follows: that may be relied upon, of sound and consistent character of quality. Thus there are two distinct components of the notion: one, relating to the use, another to internal properties of the thing that is described as reliable. The author considers some consequences of blurring the distinction, or worse, of substituting one meaning for another.
Wladyslaw M. Turski
ISSRE1
1997 Coordination Durative Actions
Isabel Nunes, José Luiz Fiadeiro, Wladyslaw M. Turski
COORDINATION3
1997 Desert Island Column
Wladyslaw M. Turski
Autom. Softw. Eng.1
1997 Foreword
Jan Madey, Andrzej Tarlecki, Wladyslaw M. Turski
Sci. Comput. Program.3
1996 I Was a Computer
Wladyslaw M. Turski
Sci. Comput. Program.1
1996 Reference Model for Smooth Growth of Software Systems
Wladyslaw M. Turski
IEEE Trans. Software Eng.1
1992 Programming for Behaviour
Wladyslaw M. Turski
MPC1
1991 On Starvation and Some Related Issues
Wladyslaw M. Turski
Inf. Process. Lett.1
1991 Prescribing Behaviors
Wladyslaw M. Turski
Theor. Comput. Sci.1
1990 On Specification of Multiprocessor Computing
Wladyslaw M. Turski
Acta Informatica1
1985 The Role of Logic in Software Enterprise (Panel)
Wladyslaw M. Turski
ICSE1
1984 On What Exactly Is Going On When Software Is Developed Step-by-Step
T. S. E. Maibaum, Wladyslaw M. Turski
ICSE2
1984 On Programming by Iterations
abstract
Iterative computations are considered in this paper as a general problem-solving technique. The loop invariant is derived from problem properties rather than from program properties (as is usual in programming literature). To this end, the notion of equisolution states-a special subset of space-state in which lie the iterated trajectories-is introduced.
Wladyslaw M. Turski
IEEE Trans. Software Eng.1
1979 Software Engineering : As It Will Be
Wladyslaw M. Turski
ICSE1
1978 A Model of Nonmorphological Data Collection Based on Sentential Calculus
abstract
This paper describes, in a preliminary way, a model of data collection, patterned after sentential calculus. The purely syntactic character of the latter (Grzegorczyk, 1974), combined with recent advances in formal grammars (Deussen, 1975) seem to indicate how to push the confusing issues of semantics well outside the operational part of the system supporting such collection; at the same time, we get a total independence of any implementational factors. With today's notational technology it does not seem prohibitively difficult to develop completely the model proposed in this paper; it is felt, however, that the chosen form of presentation brings up the salient features of the idea uncluttered by a mass of details.
Wladyslaw M. Turski
Comput. J.1
1972 A Model for Data Structures and its Applications. (Part II)
Wladyslaw M. Turski
Acta Informatica1
1972 A correspondence between thesaurus-based and multi-attribute retrieval systems
Wladyslaw M. Turski
Inf. Storage Retr.1
1971 A Model for Data Structures and Its Applications. I
Wladyslaw M. Turski
Acta Informatica1
1971 On a model of information retrieval system based on thesaurus
Wladyslaw M. Turski
Inf. Storage Retr.1
1968 SODA - A Dual Activity Operating System
abstract
SODA is an operating system for a new Polish computer ODRA-1204. This paper gives an account of the basic principles of SODA structure and operation. SODA is an operating system for a small computer (without magnetic tapes) tailored to the needs of a research institute. A fundamental objective achieved by means of SODA is the simultaneous preparation and execution of programs.
Wladyslaw M. Turski
Comput. J.1