×

zbMATH — the first resource for mathematics

Semantics of algorithmic languages. (English) Zbl 0554.68006
Translation from Itogi Nauki Tekh., Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern. 20, 95-166 (1983; Zbl 0542.68002).
MSC:
68-02 Research exposition (monographs, survey articles) pertaining to computer science
68Q60 Specification and verification (program logics, model checking, etc.)
68Q55 Semantics in the theory of computing
Software:
Refal; ALGOL 68; SEMANOL
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] S. A. Abramov, Mathematical Constructions and Programming [in Russian], Nauka, Moscow (1978).
[2] S. A. Abramov, ?Models of sets of sequences and proof of correctness of programs,? Zh. Vychisl. Mat. Mat. Fiz.,20, No. 5, 1347?1350 (1980).
[3] V. N. Agafonov, ?Types and abstraction of data in programming languages,? in: Data in Programming Languages; Abstraction and Typology [Russian translation]. Mir, Moscow (1981), pp. 266?327.
[4] V. N. Agafanov, ?On semantics of variables in PASCAL-like languages,? in: Teor. Foundations of Compilation [in Russian], Novosibirsk (1980), pp. 17?23.
[5] M. I. Auguston, R. P. Balodis, Ya. M. Barzdin’, and A. A. Kalnin’sh, A Subset of PL/I OS ES [in Russian], Riga (1976).
[6] I. O. Babaev, S. S. Lavrov, F. A. Novikov, and T. N. Petrushina, ?Specialized program provision of applied investigations,? All-Union Conference on Methods of Mathematical Logic in Problems of Artificial Intelligence and Systems Programming, Palanga, 1980, Part 2, Topics of Reports and Communications, Vilnius (1980), pp. 7?25.
[7] V. V. Bublik, ?Generalized structural induction,? Kibernetika, No. 3, 60?61 (1977).
[8] É. O. Bunimova, V. Sh. Kaufman, and V. A. Levin, ?On the description of language projections,? Vestn. Mosk. Gos. Univ., Vychisl. Mat. Kibern., No. 4, 68?73 (1978). · Zbl 0442.68005
[9] G. Sh. Val’dman and I. B. Zadykhailo, ?Some considerations on the determination of the degree of nonprocedurality of programming languages,? IPM Akad. Nauk SSSR, Preprint No. 51, Moscow (1977).
[10] A. Gating, Intuitionism [Russian translation], Mir, Moscow (1966).
[11] V. M. Glushkov, ?A theorem on incompleteness of formal theories from positions of a programmer,? Kibernetika, No. 2, 1?5 (1979).
[12] V. M. Glushkov, ?Theory of automata and formal transformations of microprograms,? Kibernetika, No. 5, 1?9 (1965).
[13] V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, ?Theory of structures of data and synchronous parallel computations,? Kibernetika, No. 6, 1?15 (1976).
[14] V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, Programming [in Russian], Naukova Dumka, Kiev (1978).
[15] V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, ?Problems of analysis and synthesis of structured parallel programs,? Kibernetika, No. 3, 1?16 (1981). · Zbl 0493.68020
[16] G. G. Gnezdilova, ?Verification of programs and its connection with structured programming,? All-Union State Planning and Scientific-Research Institute on Planning for Scientific-Research Laboratories, Institutes, and Scientific Centers of the Academy of Sciences of the USSR and Academy of United Republics of the Academy of Sciences of the USSR, Moscow (1980) (Manuscript deposited in VINITI 16 May 1980, No. 1882-80 Dep.).
[17] M. G. Gontsa, ?Analytical semantics of languages and semantic constructors,? Mat. Issled. (Kishinev), No. 59, 3?12 (1980).
[18] M. G. Gontsa, ?The compositional-structural approach to programming,? All-Union Conference on Methods of Mathematical Logic in Problems of Artificial Intelligence and Systems Programming, Palanga, 1980, Part 2. Texts of Reports and Communications, Vilnius (1980), pp. 161?168.
[19] O.-J. Dahl et al., Structural Programming, Academic Press (1972).
[20] E. Dexter, The Discipline of Programming [Russian translation], Mir, Moscow (1978).
[21] A. P. Ershov, ?Operator algorithms. I (basic concepts),? Probl. Kibern.,1, 5?48 (1960).
[22] A. P. Ershov, ?Operator algorithms. II (description of basic constructions of programming), Probl. Kibern.,8, 211?233 (1962).
[23] A. P. Ershov, ?The modern state of the theory of program schemes,? Probl. Kibern.,27 87?110 (1973).
[24] A. P. Ershov, Introduction to Theoretical Programming (Discussions of Method) [in Russian], Nauka, Moscow (1977).
[25] A. P. Ershov, ?On a theoretical principle of systems programming,? Dokl. Akad. Nauk SSSR,233, No. 2, 272?275 (1977). · Zbl 0371.68006
[26] A. P. Ershov, ?On the essence of translation,? Programmirovanie, No. 5, 21?39 (1977).
[27] A. P. Ershov, ?Organization of mixed computations for recursive programs,? Dokl. Akad. Nauk SSSR,245, No. 5, 1041?1044 (1979). · Zbl 0456.68019
[28] A. P. Ershov, ?Some subjective remarks on current problems of programming,? Outlook for Systems and Theoretical Programming. Proc. All-Union Symposium, Novosibirsk, 1978, Novosibirsk (1979), pp. 113?126.
[29] A. P. Ershov, ?Mixed computations, potential applications and problems of investigations,? All-Union Conference on Methods of Mathematical Logic in Problems of Artificial Intelligence and Systems Programming, Palanga (1980), Part 2, Texts of Reports and Communications, Vilnius (1980), pp. 26?55.
[30] Yu. L. Ershov, ?Constructive models,? in: Selected Questions of Algebra and Logic, Nauka, Novosibirsk (1973), pp. 111?130.
[31] Yu. L. Ershov, ?Computable functionals of finite types,? Algebra Loglka,11, No. 4, 367?437 (1972).
[32] Yu. L. Ershov, ?The theory of A-spaces,? Algebra Logika,12, No. 4, 360?416 (1972).
[33] Yu. L. Ershov, The Theory of Numberings [in Russian], Nauka, Moscow (1977).
[34] Yu. L. Ershov, Problems of Solvability and Constructive Models [in Russian], Nauka, Moscow (1980).
[35] I. B. Zadykhailo and S. D. Zelenetski, ?On an approach to formal definition of synchronization in computing systems,? IPM Akad. Nauk SSSR, Preprint (1980), No. 133.
[36] I. V. Kasatkina, ?On the proof of correctness of structured programs,? Questions of Constructing Systems of Programming [in Russian], Kiev (1978), pp. 59?74.
[37] V. Sh. Kaufman, ?The projection approach to creating compilers,? in: Outlook for Systems and Theoretical Programming. Proc. All-Union Symposium, Novosibirsk (1979), pp. 87?103.
[38] V. Sh. Kaufman and A. V. Kuryshev, ?Evaluation of the V-language by the method of Marcotty, Ledgard, and Bachmann,? in: Methods of Translation [in Russian], Rostov-on-Don (1981), pp. 84?92.
[39] V. Sh. Kaufman and V. A. Levin, ?Communication on V-language (Preliminary),? in: Works of the Computing Center MGU, No. 33 (1980), pp. 79?95.
[40] Ya. A. Kukut’, ?A formalized system for proving properties of programs,? Theory of Algorithms and Programs, Republic Interdepartmental Collection of Scientific Works, No. 3, Riga (1977), pp. 103?126.
[41] Ya. A. Kakut’, ?Proof of some properties of programs in a formalized system,? Republic Interdepartmental Collection of Scientific Works, No. 3, Riga (1977), pp. 127?142.
[42] G. M. Kursanov and G. E. Tseitlin, ?Some questions of completeness of an axiomatic system in algorithmic algebras,? Kibernetika, No. 4, 35?37 (1977).
[43] A. S. Kleshchev, ?A relation model of programming languages,? Outlooks for Development in Systems and Theoretical Programming, Proc. All-Union Symposium, Novosibirsk (1978), pp. 73?76.
[44] A. S. Kleshchev, ?A relation model of computations,? Preprint Inst. of Automata and Control Processes, DVNTs AN SSSR, Vladivostok (1979).
[45] A. S. Kleshchev, ?A relation language of programming and the principles for its realization on a sequential computer,? Preprint Inst. Automata and Control Processes, DVNTs Akad. Nauk SSSR, Vladivostok (1979).
[46] S. K. Cliny, Introduction to Mathematics [Russian translation], IL, Moscow (1957).
[47] A. N. Kolmogorov, ?On the concept of an algorithm,? Usp. Mat. Nauk,8, No. 4, 175?176 (1953).
[48] A. N. Kolmogorov and V. A. Uspenskii, ?On the definition of an algorithm,? Usp. Mat. Nauk,13, No. 4, 3?28 (1958).
[49] V. I. Konstantinov and D. I. Sviridenko, ?On the mathematical semantics of a minilanguage of parallel programming,? in: Probl. Programmirovaniya, Novosibirsk (1976), pp. 81?93.
[50] N. K. Korostina, ?Models of operational semantics of programming languages,? Questions of Realization of Language Processors, Valdivostok (1979), pp. 3?33.
[51] N. K. Kosovskii, ?Equivalence of rules for the proof of properties of cycle operators,? Vychisl. Tekh. Vopr. Kibern., Leningrad, No. 16, 67?74 (1979).
[52] V. S. Kostyrko, ?On the proof of correctness of cycle operators of the type for,? Kibernetika, No. 5, 55?59 (1977). · Zbl 0382.68014
[53] V. S. Kostyrko, ?On a method of proving correctness of programs,? Kibernetika, No. 1, 50?58 (1978). · Zbl 0384.68017
[54] V. E. Kotov, ?Theory of parallel programming: applied aspects,? Kibernetika, No. 1, 1?16 (1974).
[55] V. E. Kotov, Introduction to the Theory of Schemes of Programming [in Russian], Nauka, Novosibirsk (1978).
[56] V. E. Kotov, ?Formal models of parallel computations,? VTs Sib. Otd. Akad. Nauk SSSR, Preprint, No. 165 (1969).
[57] V. E. Kotov, ?Parallel programming with types of control,? Kibernetika, No. 3, 1?13 (1979).
[58] N. A. Krinitskii, ?Broad formal definition of an algorithm,? Probl. Kibern., No. 32, 161?186 (1977).
[59] N. A. Krinitskii, ?On logical schemes of programs and algorithms,? Programmirovanie, No. 3, 3?13 (1980).
[60] S. P. Kritskii, ?A model of synchronous computations in structures and languages of programming,? Methods of Translation, Rostov-on-Don (1981), pp. 92?100.
[61] N. A. Krupko, ?On an automatic system of logical deduction,? Programmirovanie, No. 3, 28?40 (1978). · Zbl 0419.68026
[62] V. P. Kutepov, ?The calculus of functional schemes and parallel algorithms,? Programmirovanie, No. 6, 3?15 (1976). · Zbl 0397.68006
[63] V. P. Kutepov and V. N. Fal’k, ?Models of asynchronous computations of the values of functions in the language of functional schemes,? Programmirovanie, No. 3, 3?15 (1978).
[64] B. A. Kushner, Lectures on Constructive Mathematical Analysis [in Russian], Nauka, Moscow (1973). · Zbl 0547.03040
[65] S. S. Lavrov, ?Methods of giving the semantics of programming languages,? Programmirovanie, No. 6, 3?10 (1978).
[66] I. A. Lomazova, ?Axiomatization of total correctness of programs with transition operators,? in: Theoretical Foundations of Compilation [in Russian], Novosibirsk (1980), pp. 3?16.
[67] A. A. Lyapunov, ?On logical schemes of programs,? Proc. of the Third All-Union Mathematical Congress. I. Akad. Nauk SSSR, Moscow (1956), p. 193. · Zbl 0464.68023
[68] A. I. Mal’tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).
[69] A. I. Mal’tsev, ?Constructive algebras. I,? Usp. Mat. Nauk,16, No. 3, 3?60 (1961).
[70] Z. Manna, ?The theory of fixed points of programs,? Kibern. Sb.,15, 38?100 (1978).
[71] A. A. Markov, ?The theory of algorithms,? Tr. Mat. Inst. Akad. Nauk SSSR (1954).
[72] A. A. Markov, ?On constructive mathematics,? Tr. Mat. Inst. Akad. Nauk SSSR, 8?14 (1962).
[73] P. Martin-Löf, Lectures on Constructive Mathematics [Russian translation], Mir, Moscow (1974).
[74] V. Yu. Meitus and I. V. Tancher, ?Structurally algorithmic algebras and parallel computations,? IK Akad. Nauk Ukr. SSR, Preprint, No. 11 (1977).
[75] G. E. Mints, ?Closed categories and the theory of proofs,? Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,68, 83?114 (1977).
[76] G. E. Mints, ?Stability of E-theorems and verification of programs,? Semiotika Inf., No. 12, 73?77 (1979).
[77] L. Misyavichute, ?On formal transformations preserving program correctness,? Semiotika Inf., No. 12, 77?81 (1979).
[78] N. N. Nepeivoda, ?On the construction of correct programs,? Vopr. Kibern.,46, 88?113 (1978).
[79] N. N. Nepeivoda, ?The relation between rules of natural deduction and operators of algorithmic languages of high level,? Dokl. Akad. Nauk SSSR,239, No. 3, 526?529 (1978). · Zbl 0392.68004
[80] N. N. Nepeivoda, ?On a method of constructing a correct program from correct subprograms,? Programmirovanie, No. 1, 15?25 (1979).
[81] N. N. Nepeivoda, ?Application of the theory of proofs to the problem of constructing correct programs,? Kibernetika, No. 2, 43?48 (1979).
[82] N. N. Nepeivoda, ?On some possibilities of constructing nonprocedural languages of programming,? Outlooks for the Development of Systems and Theoretical Programming. Proc. All-Union Symposium, Novosibirsk, 1978, Novosibirsk (1979), pp. 56?64.
[83] N. N. Nepeivoda, ?Constructive logics of bounded constructions,? Relevant Logics and the Theory of Succession, Materials of the Second Soviet-Finnish Colloquium on Logic, Moscow, 1979, Moscow (1979), pp. 76?80.
[84] N. N. Nepeivoda, ?Logical and algorithmic formalisms for the problem of constructing correct programs,? Programmirovanie, No. 6, 3?14 (1981).
[85] N. N. Nepeivoda, ?A project of a system of languages of a new generation,? in: Highly Productive Computing Systems. All-Union Conference, Tbilisi (1981), Moscow (1981), pp. 69?71.
[86] N. N. Nepeivoda and D. I. Sviridenko, ?Programming from a logical point of view,? Inst. Mat. Sib. Otd. Akad. Nauk SSSR, Preprint T-1, Novosibirsk (1981).
[87] N. N. Nepeivoda and D. I. Sviridenko, ?Programming from a logical point of view,? Inst. Mat. Sib. Otd. Akad. Nauk SSSR, Preprint, No. T-2 (1981).
[88] V. A. Nepomnyashchii and L. V. Chernobrod, ?On verification of the correctness of programs with the help of a computer,? in: Problemy Programmirovaniya [in Russian], Novosibirsk (1976), pp. 63?80.
[89] M. Niva, ?On the question of interpretation of recursive schemes of programs,? in: Theory of Programming and Methods of Translation [in Russian], Novosibirsk (1977), pp. 122?154.
[90] P. S. Novikov, Constructive Mathematical Logic from the Point of View of Classical Logic [in Russian], Nauka, Moscow (1977).
[91] A. Ollongren, Definition of Programming Languages by Interpreting Automat [Russian translation], Mir, Moscow (1977). · Zbl 0417.68005
[92] The Revised Report on ALGOL-68 [Russian translation], Moscow (1979).
[93] A. Ollongren, A. Yu. Plyushkyavichene, Yu. V. Sakalauskaite, and S. P. Yunka, ?On program logics,? Kibernetika, No. 2, 12?19 (1979).
[94] R. A. Plyushkyavichus, ?Logical foundations of analysis and synthesis of programs,? Semiotika Inf. (Moscow), No. 12, 92?96 (1979).
[95] V. N. Red’ko, ?Foundations of compositional programming,? Programmirovanie, No. 3, 3?13 (1979).
[96] H. Rodgers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1966).
[97] V. Yu. Sazonov, ?Sequential and parallel computing functionals,? Sib. Mat. Zh.,17, No. 3, 648?672 (1976).
[98] V. Yu. Sazonov, ?On expressibility of functionals in the language of D. Scott,? Algebra Logika,15, No. 3, 308?330 (1976). · Zbl 0415.03011
[99] D. I. Sviridenko, ?Some questions of the mathematical semantics of programming languages,? Vychisl. Sistemy, Vyp. 67, Novosibirsk (1976), pp. 93?105.
[100] Semantics of Programming Languages [Russian translation], Mir, Moscow (1980).
[101] D. S. Scott, ?A sketch of the mathematical theory of computing,? Kibern. Sb.,24, 107?121 (1977).
[102] D. S. Scott, ?Theory of lattices, types of data and programming,? in: Data in Programming Languages [Russian translation], Mir, Moscow (1982), pp. 25?54.
[103] S. A. Solakhyan, ?On formal description of the semantics of programming languages,? Programmirovanie, No. 3, 3?12 (1976).
[104] S. A. Solakhyan, ?Proof of properties of programs using the Viennese language of definition,? Programmirovanie, No. 4, 33?42 (1976).
[105] S. A. Solakhyan, ?Proof of properties of programs containing procedures and conditional operators,? Programmirovanie, No. 2, 28?36 (1977). · Zbl 0419.68017
[106] V. A. Tuzov, ?Equivalence of translation relations,? Kibernetika, No. 6, 15?22 (1975).
[107] V. A. Tuzov, ?On optimal schemes of algorithms,? Zh. Vychisl. Mat. Mat. Fiz., No. 5, 1282?1289 (1971).
[108] V. A. Tuzov, ?Mappings rule-to-rule,? in: Systems and Theoretical Programming [in Russian], Vol. 2, Kishinev (1974), pp. 103?112.
[109] V. A. Tuzov, ?On formalization of language,? Programmirovanie, No. 5, 25?35 (1978).
[110] V. A. Tuzov, ?On a method of describing programming languages,? Programmirovanie, No. 3, 14?23 (1979). · Zbl 0439.68013
[111] V. A. Tuzov, ?An approach to the construction of a universal scheme of language, Semantics,? Programmirovanie, No. 3, 7?15 (1981). · Zbl 0477.68018
[112] É. Kh. Tyugu, ?On a path to practical program synthesis,? Kibernetika, No. 6, 34?43 (1976).
[113] V. A. Uspenskii, ?Computable operations and the concept of a program,? Usp. Mat. Nauk,11, No. 4, 172?176 (1956).
[114] V. A. Uspenskii and A. L. Semenov, ?Analysis and synthesis of programs of a Post machine,? Mat. Shkole, No. 3, 18?27 (1967).
[115] G. S. Tseitin, ?Some features of a language for a system of programming verifying proofs,? Theory of Programming. Part 2. Proc. All-Union Symp., Novosibirsk (1971), Novosibirsk (1972), pp. 234?249.
[116] G. S. Tseitin, ?Nonmathematical thought in programming,? Outlooks for Systems and Theoretical Programming. Proc. All-Union Symp., Novosibirsk (1978), Novosibirsk (1979), pp. 128?132.
[117] G. S. Tseitin, ?Realization of parallel execution and flexible names in ALGOL-68,? Proc. All-Union Symp. on Methods of Realization of New Algorithmic Languages. Part 2, Novosibirsk (1975), pp. 74?87.
[118] L. V. Chernobrod, ?Correctness and equivalence of programs,? Programmirovanie, No. 6, 16?25 (1976). · Zbl 0397.68009
[119] L. V. Chernobrod, ?Verification of correctness of programs: formalization of operations on sets,? Theory and Practice of Systems Programming [in Russian], Novosibirsk (1977), pp. 86?94.
[120] N. A. Shanin, ?On constructive understanding of mathemaical arguments,? Proc. 3rd All-Union Mathematical Congress. I. Moscow, Akad. Nauk SSSR (1956), pp. 189?190.
[121] L. B. Éfros, ?Conceptual analysis of program systems,? Upravl. Sistemy Mashiny, No. 2, 25?32 (1979).
[122] S. P. Yukna, ?On the problem of characterization for theories of partial correctness of programs,? Programmirovanie ÉVM (Vilnius), No. 12, 93?126 (1979). · Zbl 0413.68011
[123] S. P. Yunka, ?On a criterion of solvability of recursively axiomatized Hoare theories,? Semiotika Inf. (Moscow), No. 12, 98?102 (1979).
[124] E. L. Yushchenko and I. V. Kasatkina, ?Modern methods of proof of program correctness,? Kibernetika, No. 6, 37?62 (1980).
[125] The Programming Language ADA (Preliminary Communication), Finansy i Statistika, Moscow (1981).
[126] Yu. I. Yanov, ?On logical schemes of algorithms,? Probl. Kibern. (Moscow),1, 75?127 (1958). · Zbl 0085.34003
[127] K. Abrahamson, ?Modal logic of concurrent nondeterministic programs,? Lect. Notes Comput. Sci.,70, 21?33 (1979). · Zbl 0402.68010
[128] G. Aguzzi, R. Pinzani, and R. Sprugnoli, ?An algorithmic approach to the semantics of programming languages,? in: Automata, Languages and Programming, Amsterdam e.a. (1973), pp. 147?166. · Zbl 0262.68007
[129] L. Aiello and M. Aiello, ?Programming language semantics in a typed ?-calculus,? Lect. Notes Comput. Sci.,37, 240?251 (1975). · Zbl 0331.68006
[130] S. Alagic, ?On proofs of correctness of well-structured programs. I,? Mat. Vesn.,1, No. 3, 251?261 (1977). · Zbl 0382.68012
[131] S. Alagic, ?On proofs of correctness of well-structured programs. II,? Mat. Vesn.,1, No. 3, 263?269 (1977). · Zbl 0382.68013
[132] L. Ammeraal, ?How program statements transform predicates,? GJ-6 Jahrestag., Stuttgart (1976), Berlin e.a. (1976), pp. 109?120.
[133] E. R. Anderson, F. C. Belz, and E. K. Blum, ?Semanol (73). A metalanguage for programming the semantics of programming languages,? Acta Inf.,6, No. 2, 109?131 (1976). · Zbl 0309.68011
[134] T. Anderson and R. W. Witty, ?Safe programming,? BIT (Sver.),18, No. 1, 1?8 (1978). · Zbl 0377.68011
[135] H. Andréka, I. Nemeti, and I. Sain, ?Completeness problems in verification of programs and program schemes,? Lect. Notes Comp. Sci.,52, 30?44 (1977).
[136] G. Degli Antoni, P. Miglioli, and M. Ornaghi, ?The synthesis of programs in an intuitionistic frame,? Univ. degli Studi di Milano (1974). · Zbl 0296.68017
[137] K. R. Apt. ?Ten years of Hoare’s logic: a survey,? Prac. 5th Scand. Logic Symp., Aarhus (1979), pp. 1?44.
[138] K. R. Apt and J. W. de Bakker, ?Semantics and proof theory of Pascal procedures,? Lect. Notes Comput. Sci.,52, 30?44 (1977). · Zbl 0353.68036
[139] M. A. Arbib and S. Alagic, ?Proof rules for gotos,? Acta Inf.,11, No. 2, 139?148 (1979).
[140] M. A. Arbib and E. G. Manes, ?Tree transformations and the semantics of loop-free programs,? Acta Cybern.,4, No. 1, 11?17 (1978).
[141] A. Arnold, ?Semantique algébraique de l’appel par valeur,? RAIRO Inf. Theor.,12, No. 2, 69?82 (1978).
[142] A. Arnold and M. Nivat, ?Nondeterministic recursive program schemes,? Lect. Notes Comp. Sci.,52, 30?44 (1977). · Zbl 0361.68020
[143] A. Arnold and M. Nivat, ?Formal computations of nondeterministic recursive program schemes,? Math. Syst. Theory,13, 219?236 (1980). · Zbl 0441.68044
[144] E. A. Ashcroft and W. W. Wadge, ?LUCID ? a formal system for writing and proving programs,? SIAM J. Comput.,5, No. 3, 336?354 (1976). · Zbl 0362.68030
[145] R. J. Back, ?Semantics of unbounded nondeterminism,? Lect. Notes Comput. Sci.,85, 51?63 (1980). · Zbl 0425.68021
[146] J. Backus, ?Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,? Commun. ACM,21, No. 8, 613?641 (1978). · Zbl 0383.68013
[147] H. G. Baker, Jr., ?Actor systems for real-time computation,? MIT Lab. Comput. Sci. Techn. Rept., No. 197 (1978).
[148] J. W. de Bakker, ?The fixed point approach in semantics: theory and applications,? Math. Centre Tracts,63, 1?53 (1975).
[149] J. W. de Bakker, ?Semantics of infinite processes using generalized trees,? Lect. Notes Comp. Sci.,53, 240?246 (1977). · Zbl 0368.68011
[150] J. W. de Bakker, ?Semantics and the foundations of program proving,? Inf. Processes,77, Amsterdam e.a. (1977), pp. 279?284.
[151] L. Banachowski, A. Kreczmar, G. Mirkowska, H. Rasiow, and A. Salwicki, ?An introduction to algorithmic logic,? Banach Cent. Publs. ol. 2, Warszawa (1977), pp. 7?99.
[152] V. R. Basili and R. E. Noonan, ?A comparison of the axiomatic and functional models of structured programming,? IEEE Trans. Software Eng.,6, No. 5, 454?465 (1980). · Zbl 0436.68005
[153] F. L. Bauer, ?Program development by stepwise transformations. The project CIP,? Lect. Notes Comput. Sci.,69, 237?272 (1979). · Zbl 0408.68064
[154] F. L. Bauer, M. Broy, H. Partsch, P. Perpper, and H. Wössner, ?Systematics of transformation rules,? Lect. Notes Comput. Sci.,69, 273?289 (1979). · Zbl 0399.68009
[155] J. Bergstra, ?What is an abstract data type?? Inf. Process. Lett.,7, No. 1, 42?43 (1978). · Zbl 0374.68023
[156] J. Bergstra, ?Recursion theory on processes,? Int. J. Comput. Math.,7, No. 2, 119?128 (1979). · Zbl 0404.03033
[157] J. Bergstra, ?Effective transformations of probabilistic data,? Z. Math. Log. Grundl. Math.,25, No. 3, 219?226 (1979). · Zbl 0424.03021
[158] J. Bergstra and J. Tiurin, ?Implicit definability of algebraic structures by means of program properties,? Math. Res.,2, 58?63 (1979).
[159] J. Bergstra and J. V. Tucker, ?On the adequacy of finite equational methods for data type specifications,? SIGPLAN Notic.,14, No. 11, 13?18 (1979).
[160] J. Bergstra, ?A characterization of computable data types by means of a finite equational specification method,? Lect. Notes Comput. Sci.,85, 76?90 (1980). · Zbl 0449.68003
[161] D. M. Berry, ?Remarks on R. D. Tennent’s language design methods based on semantic principles: ALGOL 68, a language designed using semantic principles,? Acta Inf.,15, No. 1, 83?98 (1981). · Zbl 0423.68002
[162] G. Berry and J. J. Levy, ?A survey of some syntactic results in the ?-calculus,? Lect. Notes Comput. Sci.,74, 552?566 (1979). · Zbl 0416.03016
[163] M. Bert, ?A formalization of the transformation of nested declarations,? Elektron. Inf. Kybern.,13, Nos. 1?2, 79?96 (1977). · Zbl 0361.68043
[164] A. Bertoni, G. Mauri, and P. A. Miglioli, ?A characterization of abstract data types as model-theoretic invariants,? Lect. Notes Comput. Sci.,71, 26?37 (1979). · Zbl 0411.68033
[165] A. Bertoni, ?Towards a theory of abstract data types: a discussion of problem and tools,? Lect. Notes Comput. Sci.,83, 44?52 (1980). · Zbl 0435.68022
[166] W. Bibel, ?Pradicatives Programmieren,? Lect. Notes Comput. Sci.,33, 274?283 (1975).
[167] W. Bibel, ?Syntax-directed semantics-supported program synthesis,? Artif. Intel.,14, No. 3, 243?261 (1980).
[168] D. Bjorner, ?Programming languages: linguistics and semantics,? Int. Comput. Symp. 1977, Amsterdam e.a. (1977), pp. 511?536.
[169] D. Bjorner, ?Programming languages: formal development of interpreters and compilers,? Int. Comput. Symp. 1977, Amsterdam e.a. (1977), pp. 1?21.
[170] D. Bjorner, ?The Vienna development method (VDM); software specification and program synthesis,? Lect. Notes Comput. Sci.,75, 326?359 (1979). · Zbl 0404.68009
[171] D. Bjorner, ?Experiments in block-structured GOTO language modeling: EXIT versus CONTINUATION,? Lect. Notes Comput. Sci.,86, 216?247 (1980). · Zbl 0435.68010
[172] D. Bjorner and C. B. Jones (ed.), The Vienna Development Method: the Methalanguage,? Lect. Notes Comp. Sci.,63, 1?15 (1978).
[173] A. Blikle, ?Proving programs by ?-relations,? Elektron. Inf. Kybern.,11, Nos. 4?6, 267?274 (1975). · Zbl 0328.68013
[174] A. Blikle, ?A comparative review of some program verification methods,? Lect. Notes Comput. Sci.,53, 17?33 (1977). · Zbl 0361.68011
[175] A. Blikle, ?An analytic approach to the verification of iterative programs,? Inform. Process. 77. Proc. IFIP Congr., Toronto, 1977, Amsterdam e.a. (1977), pp. 285?290. · Zbl 0363.68016
[176] A. Blikle, ?A survey of input-output semantics and program verification,? Pr. IPI PAN, No. 344 (1979). · Zbl 0407.68011
[177] A. Blikle, ?Specified programming,? Lect. Notes Comput. Sci.,75, 228?251 (1979). · Zbl 0404.68004
[178] A. Blikle, ?An analysis of programs by algebraic means,? Banach Cent. Publ., Vol. 2, Warszawa,2, 167?213 (1977). · Zbl 0358.68026
[179] A. Blikle, ?Assertion programming,? Lect. Notes Comput. Sci.,74, 26?42 (1979). · Zbl 0404.68018
[180] H. Boom, ?ABSTRACTO thoughts,? ALGOL Bull.,43, 91?96 (1978).
[181] G. Boudol, ?A new recursion induction principle,? Lect. Notes Comput. Sci.,67, 79?90 (1979). · Zbl 0405.68008
[182] M. Broy, W. Dosch, H. Partsch, P. Pepper, and M. Wirsing, ?Existential quantifiers in abstract data types,? Lect. Notes Comput. Sci.,71, 79?87 (1979). · Zbl 0404.68026
[183] M. Broy, R. Gnatz, and M. Wirsing, ?Semantics of nondeterministic and noncontinuous constructs,? Lect. Notes Comput. Sci.,69, 553?592 (1979). · Zbl 0406.03059
[184] M. Broy and P. Pepper, ?Program development as a formal activity,? IEEE Trans. Software Eng.,7, No. 1, 14?22 (1981). · Zbl 0447.68005
[185] M. Broy, P. Pepper, and M. Wirsing, ?On relations between programs,? Lect. Notes Comput. Sci.,83, 59?78 (1980). · Zbl 0435.68017
[186] B. Buchberger, ?Certain decomposition of Gödel numberings and the semantics of programming languages,? Inst, für num. Math. und elektron. Informationsverarb., Universität Innsbruck (1972).
[187] R. M. Burstall, ?Electronic category theory,? Lect. Notes Comput. Sci.,88, 22?39 (1980). · Zbl 0462.68003
[188] R. M. Burstall and J. Darlington, ?A transformation system for developing recursive programs,? J. Assoc. Comput. Mach.,24, No. 1, 44?67 (1977). · Zbl 0343.68014
[189] R. M. Burstall and M. Feather, ?Program development by transformations: an overview,? Fondem. Programm. Cours. Commiss. Commun. Eur., Toulouse (1977), Le Chesnay, S.a. (1977), pp. 45?55.
[190] R. M. Burstall and J. A. Goguen, ?The semantics of Clear, a specification language,? Lect. Notes Comput. Sci.,86, 292?332 (1980). · Zbl 0456.68024
[191] L. Cardelli, ?Analog processes,? Lect. Notes Comput. Sci.,88, 181?193 (1980). · Zbl 0454.68038
[192] R. Cartwright, ?A practical formal semantic definition and verification system for typed LISP,? Stanford Al Memo (1976), No. 296.
[193] J. C. Cherniavsky and S. N. Kamin, ?A complete and consistent Hoare axiomatics for a simple programming language,? J. Assoc. Comput. Mach.,26, No. 1, 119?128 (1979). · Zbl 0388.68007
[194] L. M. Chirica and D. F. Martin, ?An order-algebraic definition of Knuthian semantics,? Math. Syst. Theory,13, No. 1, 1?27 (1979). · Zbl 0397.68087
[195] K. Clark and J. Darlington, ?Algorithm classification through synthesis,? Comput. J.,23, No. 1, 61?65 (1980). · Zbl 0426.68041
[196] K. Clark and A. A. Törlund, ?A first-order theory of data and programs,? Inf. Process. 77.Proc. IFIP Congr., Toronto (1977), Amsterdam e.a. (1977), pp. 939?944.
[197] E. M. Clarke, Jr., ?Programming language constructs for which it is impossible to obtain good Hoare axiom systems,? J. Assoc. Comput. Mach.,26, No. 1, 129?147 (1979). · Zbl 0388.68008
[198] E. M. Clarke, Jr., ?Program invariants as fixed points,? Computing,21, No. 4, 273?294 (1979). · Zbl 0399.68022
[199] L. A. Clarke, J. C. Wileden, and A. L. Wolf, ?Nesting in Ada programs is for the birds,? SIGPLAN Notic.,15, No. 11, 139?145 (1980).
[200] J. C. Cleveland, ?Meaning and syntactic redundancy,? New Dir. Algorithmic. Lang., 1975, Rocquencourt Le Chesnay, S.a. (1976), pp. 115?124.
[201] J. C. Cleveland, ?Mathematical specifications,? SIGPIAN Notic.,15, No. 12, 31?42 (1980).
[202] G. Comyn and G. Werner, ?Computable data types,? Lect. Notes Comput. Sci.,74, 226?236 (1979). · Zbl 0409.68005
[203] R. L. Constable, ?Constructive mathematics and automatic program writers,? Inform. Process., 71. IFIP Congr. 1971, Ljubljana, Amsterdam e.a. (1972), 1, pp. 229?233.
[204] R. L. Constable, ?A constructive programming logic,? Inf. Process. 77. Proc. IFIP Congr., Toronto (1977), Amsterdam e.a. (1977), pp. 733?738.
[205] R. L. Constable, ?Programs and types,? IEEE -Symp. Found. Comp. Sci., Las Vegas (1980), pp. 112?128.
[206] S. A. Cook, ?Soundness and completeness of an axiom system for program verification,? SIAM J. Comput.,7, No. 1, 70?90 (1978). · Zbl 0374.68009
[207] B. Courselle and M. Nivat, ?The algebraic semantics of recursive program schemes,? Lect. Notes Comput. Sci.,64, 26?30 (1978).
[208] G. Cousineau and M. Nivat, ?On rational expressions representing infinite rational trees: application to the structure of flow charts,? Lect. Notes Comput. Sci.,74, 567?580 (1978). · Zbl 0421.68013
[209] G. Cousineau and P. Enjalbert, ?Program equivalence and probability,? Lect. Notes Comput. Sci.,74, 237?245 (1979). · Zbl 0404.68014
[210] P. Cousot and R. Cousot, ?Semantic analysis of communicating sequential processes,? Lect. Notes Comput. Sci.,85, 119?133 (1980). · Zbl 0433.68020
[211] H. B. Curry, ?The logic of program composition,? Collect. Logique Math., 1952, Paris,A5, 97?102 (1954).
[212] O.-J. Dahl, ?Time sequences as a tool for describing program behavior,? Lect. Notes Comput. Sci.,86, 273?289 (1980).
[213] O.-J. Dahl, ?Can program proving be made practical,? Fondem Programm. Cours Commiss. Commun. Eur., Toulouse, 1977, Le Chesnay, S.a., pp. 57?114.
[214] J. Darlington, ?Transforming specifications into efficienct programs,? New Dir. Algorithm. Lang. Rocquencourt (1976), pp. 135?145.
[215] ?Data types (Panel discussion),? Lect. Notes Comput. Sci.,54, 7?34 (1977).
[216] J. Dean Brock, ?Consistent semantics for a data flow language,? Lect. Notes Comput. Sci.,88, 168?180 (1979). · Zbl 0451.68019
[217] ?Department of Defense requirements for high-order computer programming languages,? SIGPLAN Notic.,12, No. 12, 39?54 (1977).
[218] N. Dershowitz and Z. Manna, ?Proving termination with multiset orderings,? Lect. Notes Comput. Sci.,71, 188?202 (1979). · Zbl 0404.68022
[219] N. Dershowitz, ?Inference rules for program annotation,? IEEE Trans. Software Eng.,7, No. 2, 207?222 (1981). · Zbl 0463.68023
[220] R. Devillers and G. Loucha’rd, ?Using auxiliary variables in parallel programs verification,? Int. Comput. Symp. 1977, Amsterdam e.a. (1977), pp. 215?225.
[221] V. Donzeau-Couge, G. Kahn, and B. Lang, ?On the formal definition of Ada,? Lect. Notes Comput. Sci.,94, 475?489 (1980).
[222] P. J. Downey and R. Sethi, ?Correct computation rules for recursive languages,? SIAM J. Comput.,5, No. 3, 378?401 (1976). · Zbl 0359.68010
[223] B. Dömölki, ?An example of hierarchical program specification,? Lect. Notes Comput. Sci.,86, 333?353 (1980).
[224] H. Egli and R. L. Constable, ?Computability concepts for programming language semantics,? Theor. Comput., Sci.,2, No. 2, 133?145 (1976). · Zbl 0352.68042
[225] H. D. Ehrich, ?Extensions and implementations of abstract data type specifications,? Lect. Notes Comput. Sci.,64, 155?164 (1978). · Zbl 0382.68028
[226] H. D. Ehrich, ?Algebraic semantics of type definitions and structured variables,? Lect. Notes Comput. Sci.,56, 84?97 (1977). · Zbl 0356.68023
[227] H. D. Ehrich, ?On realization and implementation,? Lect. Notes Comput. Sci.,18, 271?280 (1981). · Zbl 0465.68005
[228] H. Ehrig, H. J. Kreowski, A. Maggiolo-Schettini, B. K. Rosen, and J. Winkowsky, ?Transformation of structures: an algebraic approach,? Math. Syst. Theor.,14, No. 4, 305?334 (1981). · Zbl 0491.68035
[229] H. Ehrig, H. J. Kreowski, and P. Padawitz, ?Algebraic implementation of abstract data types: concept, syntax, semantics, and correctness,? Lect. Notes Comput. Sci.,85, 142?156 (1980). · Zbl 0457.68019
[230] B. van Emde, ?Least fixed points and the recursion theorem,? Math. Centre Dep. Pure Math. ZW, No. 78 (1976). · Zbl 0333.68014
[231] M. H. van Emden, ?Verification conditions as representation for programs.,? RR CS-76-03, Ontario (1976).
[232] M. H. van Emden, ?Programming with verification conditions,? IEEE Trans. Software Eng.,5, No. 2, 148?159 (1979). · Zbl 0395.68008
[233] M. H. van Emden and R. A. Kowalski, ?The semantics of predicate logic as a programming language,? J. Assoc. Comput. Mach.,23, No. 4, 733?742 (1976). · Zbl 0339.68004
[234] E. A. Emerson and E. M. Clarke, ?Characterizing correctness properties of parallel programs using fixed points,? Lect. Notes Comput. Sci.,85, 169?181 (1980). · Zbl 0456.68016
[235] E. Engeler, ?Algorithmic logic,? Math. Centre Tracts,63, 55?85 (1975). · Zbl 0314.68009
[236] E. Engeler, ?A new type of models of computation,? Lect. Notes Comput. Sci.,53, 52?58 (1977). · Zbl 0365.68023
[237] A. P. Ershov and V. V. Grushetski, ?On implementation-oriented method for describing algorithmic languages,? Information Processing 77, Amsterdam e.a. (1977), pp. 117?120.
[238] A. P. Ershov and V. E. Itkin, ?Correctness of mixed computation for ALGOL-like programs,? Lect. Notes Comput. Sci.,53, 59?77 (1977). · Zbl 0361.68009
[239] M. Eytan, ?Engeler algorithms in a topos,? Math. Res.,2, 128?137 (1979). · Zbl 0415.03055
[240] R. J. Fateman, ?Is a Liap machine different from a Fortran machine?? SIGSAM Bull.,12, No. 3, 8?11 (1978).
[241] I. Fekete and L. Varga, ?On the formal definition of VDL-objects,? Acta Cybern.,3, No. 3, 248 (1977). · Zbl 0374.68006
[242] J.-P. Finance, ?Une formalization de la sémantique des languages de programmation lere perts,? Rev. Franc. Automat., Inform., Rech. Opér., Inform. Théor.,10, No. 8, 5?32 (1976).
[243] J.-P. Finance, ?Data structure as a framework for the formalization of semantics of a programming language,? New Dir. Algorithm. Lang., Rocquencourt (1976), pp. 43?61. · Zbl 0361.68044
[244] M. C. Fitting, ?An axiomatic approach to computers,? Theoria,45, No. 3, 97?113 (1979).
[245] R. W. Floyd, ?Assigning meaning to programs,? Proc. Symp. Appl. Math. AMS,19, 19?32 (1967). · Zbl 0189.50204
[246] R. W. Floyd, ?The paradigms of programming,? Commun. ACM,22, No. 8, 455?460 (1979).
[247] J. M. Foster and P. D. Foster, ?Abstract data and functors,? SIGPLAN Notic.,12, No. 6, 161?167 (1977).
[248] N. Francez, C. A. R. Hoare, D. J. Lehman, and W. P. de Roever, ?Semantics of nondeterminism, concurrency and communication,? J. Comput. Syst. Sci.,19, No. 3, 290?308 (1979). · Zbl 0434.68066
[249] D. P. Friedman and D. S. Wise, ?Functional combination,? Comput. Lang.,3, No. 1, 31?35 (1978). · Zbl 0364.68010
[250] J. H. Gallier, ?Recursive schemes and generalized interpretations,? Lect. Notes Comput. Sci.,71, 256?270 (1979). · Zbl 0409.68014
[251] J. H. Gallier, ?Nondeterministic flowchart programs with recursive procedures: semantics and correctness. II,? Theor. Comput. Sci.,13, No. 2, 193?223 (1981). · Zbl 0441.68011
[252] J. H. Gallier, ?Nondeterministic flow-chart programs with recursive procedures: semantics and correctness. II,? Theor. Comput. Sci.,13, No. 3, 239?270 (1981). · Zbl 0461.68015
[253] J. D. Gannon, ?Characteristic errors in programming languages,? ACM 1978 Proc. Ann. Conf. Mach. Washington, D.C. (1978), Vol. 2, New York (1978), pp. 570?577.
[254] T. Gergely and L. Ury, ?Nondeterministic programming within the frame of first-order classical logic. Part I,? Acta Cybern.,4, No. 4, 333?354 (1980). · Zbl 0451.68029
[255] T. Gergely and L. Ury, ?Nondeterministic programming within the frame of first-order classical logic. Part II,? Acta Cybern.,4, No. 4, 356?375 (1980). · Zbl 0451.68030
[256] I. Glasner, ?Verification of while-programs in a simple calculus,? Appl. Comput. Sci.,14, 269?281 (1979). · Zbl 0407.68009
[257] I. Glasner and J. Loekx, ?A calculus for proving properties of while-programs,? Lect. Notes Comput. Sci.,75, 252?281 (1979).
[258] C. A. Goad, ?Proofs as description of computation,? Lect. Notes Comput. Sci.,87, 39?52 (1980). · Zbl 0438.68052
[259] S. J. Goldsack, ?Semantic definition of linear control algorithms,? Comput. J.,21, No. 4, 381?382 (1978).
[260] G. A. Gorelick, ?A complete axiomatic system for proving assertions about recursive and nonrecursive programs,? Toronto Univ. Tech. Rept. No. 75, Toronto, 1975.
[261] S. Goto, ?Program synthesis through Gödel’s interpretation,? Lect. Notes Comput. Sci.,75, 302?325 (1979). · Zbl 0407.68041
[262] Sh. A. Greibach, ?Theory of program structures: schemes, semantics, verification,? Lect. Notes Comput. Sci.,36, 34?62 (1975). · Zbl 0345.68002
[263] I. Greif and A. R. Meyer, ?Can partial correctness assertions specify programming lanlanguage semantics?? Lect. Notes Comput. Sci.,67, 25?26 (1979).
[264] I. Greif and A. R. Meyer, ?Specifying the semantics of while-programs; a tutorial and critique of a paper by Hoare and Lauer,? MIT Lab. Comput. Sci. Techn. Memo., No. 130 (1979). · Zbl 0471.68007
[265] D. Gries, ?Current ideas in programming methodology,? Lect. Notes Comput. Sci.,69, 77?93 (1979). · Zbl 0457.68009
[266] D. Gries, ?Basic axiomatic definitions,? Lect. Notes Comput. Sci.,69, 94?99 (1979). · Zbl 0401.68001
[267] D. Gries, ?The multiple assignment statement,? Lect. Notes Comput. Sci.,69, 100?112 (1979). · Zbl 0399.68013
[268] D. Gries, ?Is sometimes ever better than always?,? Lect. Notes Comput. Sci.,69, 113?124 (1979). · Zbl 0399.68019
[269] M. Griffits, ?Programming methodology and language implications,? Lect. Notes Comput. Sci.,69, 531?542 (1979).
[270] J. Gruel and G. Merbeth, ?Formale Beschreibung der Syntax und Semantik von Programmiersprachen am Beispiel der Beschreibung einer Systemprogrammiersprache,? Elektron. Informat Ionsverarb. Kybern.,11, Nos. 4?6, 258?263 (1975). · Zbl 0327.68014
[271] J. Gruel, ?Eine Betrachtung zur formalen Beschreibung von Programmiersprachen und Sprachverarbeitungssystemen,? Rostock Math. Kolloq., No. 8, 91?108 (1978). · Zbl 0397.68031
[272] P. Guerrero, ?A relational model for nondeterministic programs and predicate transformers,? Lect. Notes Comput. Sci.,83, 136?146 (1980).
[273] L. Guessarian, ?A propos de la sémantique de l’appel par valeur selon A. Arnold,? RAIRO Inf. Theor.,12, No. 4, 287?289 (1978). · Zbl 0392.68007
[274] G. Guiho and Ch. Gresse, ?Program synthesis from incomplete specifications,? Lect. Notes Comput. Sci.,87, 53?62 (1980). · Zbl 0445.68012
[275] A. Hajnal and I. Németi, ?Applications of universal algebra, model theory, and categories in computer science (survey and bibliography),? Comput. Ling. Comput. Lang.,13, 251?282 (1979).
[276] D. Harel, ?Logics of programs: axiomatics and descriptive power,? MIT Lab. Comput. Sci. Tech. Rept., No. 200 (1978).
[277] D. Harel, ?Proving the correctness of regular deterministic programs: a unifying survey using dynamic logic,? Theor. Comput. Sci.,12, No. 1, 61?81 (1980). · Zbl 0433.68019
[278] D. Harel, ?On and/or schemes,? Lect. Notes Comput. Sci.,88, 246?260 (1980). · Zbl 0447.68050
[279] E. C. R. Hehner, ?On removing the machine from the language,? Acta Inf.,10, No. 3, 229?243 (1978). · Zbl 0382.68007
[280] E. C. R. Hehner, ?Bunch theory: a simple set theory for computer science,? Inf. Process. Lett.,12, No. 1, 26?30 (1981). · Zbl 0454.68039
[281] F. W. von Henke, ?An algebraic approach to data types, program verification and program synthesis,? Lect. Notes Comput. Sci.,45, 330?336 (1976). · Zbl 0383.68018
[282] F. W. von Henke, ?Formal transformations and the development of programs,? Lect. Notes Comput. Sci.,53, 288?296 (1977). · Zbl 0368.68012
[283] M. A. Hennell, ?The role of procedural parameters in high-order languages,? SIGPLAN Not.,14, No. 7, 47?50 (1979).
[284] M. C. B. Hennessy, ?The semantics of call-by-value and call-by-name in a nondeterministic environment,? SIAM J. Comput.,9, No. 1, 67?84 (1980). · Zbl 0437.68002
[285] M. C. B. Hennessy and E. A. Ashcroft, ?A mathematical semantics for a semantics for a nondeterministic typed ?-calculus,? Theor. Comput. Sci.,11, No. 3, 227?245 (1980). · Zbl 0462.68006
[286] M. C. B. Hennessy and G. D. Plotkin, ?A term model for CCS,? Lect. Notes Comput. Sci.,88, 261?274 (1980). · Zbl 0479.68011
[287] M. C. B. Hennessy and G. D. Plotkin, ?Full abstraction for a simple parallel programming language,? Math. Found. Comput. Sci., 1979, Proc. 8th Symp., Olomouc, 1979, Berlin e.a. (1979), pp. 108?120. · Zbl 0457.68006
[288] P. Hitchcock and D. Park, ?Induction rules and termination proofs,? Automata, Languages Program., Amsterdam e.a. (1975), pp. 225?251.
[289] C. A. R. Hoare, ?An axiomatic basis for computer programming,? Commun. ACM,12, No. 3, 576?580, 583 (1969). · Zbl 0179.23105
[290] C. A. R. Hoare, ?Some properties of predicate transformers,? J. ACM,25, No. 3, 461?480 (1980). · Zbl 0379.68016
[291] C. A. R. Hoare, ?Parallel programming: an axiomatic approach,? Comput. Lang.,1, No. 2, 151?160 (1975). · Zbl 0362.68045
[292] C. A. R. Hoare, ?Communicating sequential processes,? Commun. ACM,21, No. 8, 666?677 (1978). · Zbl 0383.68028
[293] C. A. R. Hoare, ?The Emperor’s old clothes,? Commun. ACM,24, No. 2, 75?83 (1981).
[294] C. A. R. Hoare and J. R. Kenneway, ?A theory of nondeterminism,? Lect. Notes Comput. Sci.,85, 339?360 (1979).
[295] J. R. Hobbs and S. J. Rosenstein, ?Making computational sense of Montague’s intentional logic,? Artif. Intel.,9, No. 3, 287?306 (1977). · Zbl 0379.02005
[296] G. J. Hogger, ?Goal-oriented derivation of logic programs,? Lect. Notes Comput. Sci.,64, 267?276 (1978). · Zbl 0394.68010
[297] G. J. Hogger, ?Derivation of logic programs,? J. Assoc. Comput. Mach.,28, No. 2, 372?392 (1981). · Zbl 0464.68021
[298] G. Hornung and P. Raufels, ?Terminal algebra semantics and retractions for abstract data types,? Lect. Notes Comput. Sci.,85, 310?323 (1980).
[299] T. E. Hull, ?Semantics of floating point arithmetic and elementary functions,? Lect. Notes Comput. Sci.,54, 37?48 (1977).
[300] U. L. Hupbach, ?Abstract implementation of abstract data types,? Lect. Notes Comput. Sci.,88, 291?304 (1980). · Zbl 0467.68008
[301] Z. Huzar, ?Semantyka programów z operacjami wej?cia/wy??ia,? Podst. sterow.,11, No. 1, 33?49 (1981).
[302] K. Intermark, ?Schemes with recursion on higher types,? Lect. Notes Comput. Sci.,45, 352?358 (1976).
[303] J. Irlik, ?Transforming recursion equations to algorithms,? Lect. Notes Comput. Sci.,64, 277?285 (1978). · Zbl 0383.68008
[304] W. Issel, ?A method using a set-theoretical formalism to describe the semantics of programming languages,? Lect. Notes Comput. Sci.,45, 364?371 (1976). · Zbl 0335.68008
[305] J. Jaffar, ?Presburger arithmetic with array segments,? Inf. Process Lett.,12, No. 2, 79?82 (1981). · Zbl 0474.03006
[306] R. Janicki, ?Vectors of coroutines over Blikle nets,? Lect. Notes Comput. Sci.,56, 113?119 (1977). · Zbl 0366.68005
[307] T. M. V. Janssen and P. van Emde Boas, ?The expressive power of intentional logic in the semantics of programming languages,? Lect. Notes Comput. Sci.,53, 303?311 (1977). · Zbl 0363.68030
[308] T. M. V. Janssen, ?On the proper treatment of referencing, dereferencing and assignment,? Lect. Notes Comput. Sci.,52, 282?300 (1977). · Zbl 0353.68029
[309] K. P. Jantike, ?inductive methods of synthesizing correct programs,? Pr. IPI PAN, No. 411, 41?43 (1980).
[310] K. P. Jantike, ?Automatic synthesis of programs and inductive inference of functions,? Math. Res.,2, 219?225 (1979).
[311] H. R. Jervell, ?Constructive universes,? Lect. Notes Math.,669, 73?98 (1978). · Zbl 0398.03047
[312] C. B. Jones, ?Models of programming language concepts,? Lect. Notes Comput. Sci.,86, 100?143 (1977). · Zbl 0452.68007
[313] S. Kamin, ?Final data specifications,? 7th Ann. ACM Symp. Principles Progr. Lang., Las Vegas (1980), pp. 124?139.
[314] A. Kanda, ?Constructive category theory,? Lect. Notes Comput. Sci.,118, 563?577 (1981). · Zbl 0481.03039
[315] A. Kanda and D. Park, ?When are two effectively given domains identical?? (Extended abstract), Lect. Notes Comput. Sci.,67, 170?181 (1979). · Zbl 0405.03020
[316] H. Kaphengst and H. Reichel, ?Initial algebraic semantics of context-free languages,? Lect. Notes Comput. Sci.,56, 120?126 (1977). · Zbl 0395.68070
[317] D. Kapur and S. Mandayam, ?Expressiveness of the operation set of a data abstraction,? Seventh Ann. ACM Symp. Principl. Progr. Lang., Las Vegas (1980), pp. 139?153.
[318] S. Katz, ?Program optimization using invariants,? IEEE Trans. Software Eng.,4, No. 5, 378?389 (1978). · Zbl 0385.68015
[319] S. Katz and Z. Manna, ?A closer look at termination,? Acta Inf.,5, No. 4, 333?352 (1975). · Zbl 0304.68025
[320] R. B. Kieburtz and J. D. Cherniavsky, ?Axioms for structural induction on programs containing block exits,? Proc. Symp. Comput. Software Eng., New York, N. Y. 1976, XXXIV, Brooklyn, N. Y. (1976), pp. 239?250.
[321] H. A. Klaeren, ?A simple class of algorithmic specifications of abstract software modules,? Lect. Notes Comput. Sci.,88, 362?374 (1980). · Zbl 0461.68024
[322] H. A. Klaeren, ?Potenzkategorien und ihre Anwendung auf den Beweis von Programmeigenschaften,? Lect. Notes Comput. Sci.,33, 252?258 (1975). · Zbl 0312.68010
[323] Y. Kodratoff, ?A class of functions synthesized from a finite number of examples and a LISP program scheme,? Int. J. Comput. Inf. Sci.,8, No. 6, 489?521 (1979). · Zbl 0427.68019
[324] B. Konikowska, ?Continuous informational systems,? Ann. Soc. Math. Pol., Ser. IVL Fundam. Inf.,2, No. 1, 43?61 (1978). · Zbl 0408.68086
[325] L. Kott, ?Sémantique algébrique d’un language de programmation type ALGOL,? RAIRO Inf. Theor.,11, No. 3, 237?263 (1977).
[326] R. Kowalski, ?Algorithm ? logic + control,? Commun. ACM,22, No. 7, 424?436 (1979). · Zbl 0404.68010
[327] D. Kozen, ?Semantics of probabilistic programs,? 20th Ann. Symp. Found. Comput. Sci., San Juan, 1979, New York, N. Y. (1979), pp. 101?114.
[328] A. Kreczmar, ?On finite and infinite computations,? Lect. Notes Comput. Sci.,56, 441?446 (1977). · Zbl 0356.68036
[329] G. Kreisel, ?Some uses of proof theory for finding computer programs,? Colloq. Int. Log. Clermont-Ferrand, 1975, Paris (1977), pp. 123?124.
[330] P. Kroha, ?Semantische Transformation,? Weiterbildungzent. Math. Kybern. und Rechentechn. Informationsverarb., Techn. Univ., Dresden, No. 42, 92?98 (1980).
[331] F. Kroger, ?LAR: a logic of algorithmic reasoning,? Acta Inf.,8, No. 3, 243?266 (1977). · Zbl 0347.68016
[332] I. Kupka, ?Van Wijngaarden grammars as a special information processing model,? Lect. Notes Comput. Sci.,88, 387?401 (1979). · Zbl 0447.68091
[333] R. Kurki-Suonio, ?Nondeterminism, parallelism and intermittent assertions,? Lect. Notes Comput. Sci.,75, 106?126 (1979). · Zbl 0404.68019
[334] W. Kühnel, J. Meseguer, M. Pflender, and I. Sols, ?Primitive recursive algebraic theories and program schemes,? Bull. Austral. Math. Soc.,17, No. 2, 207?233 (1977). · Zbl 0354.18001
[335] L. Lamport, ??Sometime? is sometimes ?not ever?,? Seventh Ann. ACM Symp. Princ. of Progr. Lang., Las Vegas (1980), pp. 174?185.
[336] L. Lamport, ?The specification and proof of correctness of interactive programs,? Lect. Notes Comput. Sci.,75, 474?537 (1979). · Zbl 0404.68017
[337] A. van Lamsweerde and M. Sintzoff, ?Formal derivation of strongly correct concurrent programs,? Acta Inf.,12, No. 1, 1?31 (1979). · Zbl 0389.68012
[338] H. Langmaak and E. R. Olderog, ?Present-day Hoarelike systems for programming languages with procedures: power, limits, and most likely extensions,? Lect. Notes Comput. Sci.,85, 363?373 (1979).
[339] G. A. Lanzarone and M. Ornaghi, ?Program construction by refinements preserving correctness,? Comput. J.,18, No. 1, 55?62 (1975). · Zbl 0309.68024
[340] C. Laszló, ?A survey of semantics of Floyd-Hoare derivability,? Comput. Ling. Comput. Lang.,14, 21?42 (1980).
[341] P. E. Lauer and M. W. Shields, ?Verifying concurrent system specifications in COSY,? Lect. Notes Comput. Sci.,88, 576?586 (1980). · Zbl 0463.68029
[342] P. E. Lauer and M. W. Shields, ?Abstract specification of resource accessing disciplines: adequacy, starvation, priority arid interrupts,? SIGPLAN Not.,13, No. 12, 41?59 (1978).
[343] P. E. Lauer and M. W. Shields, ?On the abstract specification and formal analysis of synchronization properties of concurrent systems,? Lect. Notes Comput. Sci.,75, 1?32 (1979). · Zbl 0457.68027
[344] D. J. Lehmann, ?Categories for fixed-point semantics,? 17th Ann. Symp. Found. Comput. Sci. Houston, Texas, 1976, New York (1976), pp. 122?126.
[345] R. J. Lipton, ?A necessary and sufficient condition for existence of Hoare logics,? 18th Ann. Symp. Found. Comput. Sci., Providence, R. I., 1977, New York (1977), pp. 1?6.
[346] R. L. London, ?Remarks on the impact of program verification of language design,? Lect. Notes Comput. Sci.,54, 313?320 (1977).
[347] R. L. London, J. V. Guttag, J. J. Horning, B. W. Lampson, J. G. Mitchell, and G. J. Popek, ?Proof rules for programming language Euclid,? Acta Inf.,10, No. 1, 26 (1978). · Zbl 0385.68009
[348] M. E. Majster-Cederbaum, ?A simple relation between relational and predicate transformer semantics for nondeterministic programs,? Inf. Process. Lett.,11, Nos. 4?5, 190?192 (1980). · Zbl 0468.68012
[349] M. E. Majster-Cederbaum, ?Semantics: algebras, fixed points, axioms,? Lect. Notes Comput. Sci.,85, 394?408 (1980).
[350] M. E. Majster-Cederbaum, ?Data types, abstract data types and their specification problem,? Theor. Comput. Sci.,8, No. 1, 89?127 (1979). · Zbl 0393.68022
[351] J. P. Malen?e and H. Rix, ?Indécidable... pas sur!? RAIRO Inf.,15, No. 1, 99?102 (1981).
[352] E. Manes, ?Partially additive semantics: a progress report,? Math. Res.,2, 279?290 (1979). · Zbl 0442.68009
[353] Z. Manna, Theory of Computation, McGraw-Hill, New York, XII. · Zbl 0408.68022
[354] Z. Manna and A. Pnueli, ?The modal logic of programs,? Lect. Notes Comput. Sci.,71, 385?409 (1979). · Zbl 0404.68011
[355] Z. Manna and A. Shamir, ?The optimal approach to recursive programs,? Commun. ACM,20, No. 11, 824?831 (1977). · Zbl 0361.68022
[356] Z. Manna and R. Waldinger, ?sSynthesis: dreams ? programs,? IEEE Trans. Software Eng.,5, No. 4, 294?328 (1979). · Zbl 0416.68013
[357] Z. Manna and R. Waldinger, ?The synthesis of structure-changing programs,? Proc. 3rd Int. Conf. Software Eng., Atlanta, Ga., 1978, New York (1978), pp. 175?187.
[358] Z. Manna and R. Waldinger, ?The logic of computer programming,? IEEE Trans. Software Eng.,4, No. 3, 199?229 (1978). · Zbl 0381.68021
[359] Z. Manna and R. Waldinger, ?Is ?sometime? sometimes better than ?always?? Intermittent assertions in proving program correctness,? Commun. ACM,21, No. 2, 159?172 (1978). · Zbl 0367.68011
[360] Z. Manna and R. Waldinger, ?The automatic synthesis of recursive programs,? SIGPLAN Notic.,12, No. 8, 29?36 (1977).
[361] M. Marcotty, H. F. Ledgard, and G. V. Bachmann, ?A sampler of formal definitions,? Comput. Surv.,8, No. 2, 191?276 (1976). · Zbl 0352.68095
[362] D. Marini, P. A. Miglioli, and M. Ornaghi, ?First order logic as a tool to solve and classify problems,? Lect. Notes Comput. Sci.,34, 669?679 (1975). · Zbl 0329.68079
[363] P. Martin-Löf, ?Constructive mathematics and computer programming,? Stockholm Univ. Mat. Inst. Medd., No. 11 (1979).
[364] B. H. Mayoh, ?Data types as functions,? Lect. Notes Comput. Sci.,64, 56?70 (1978).
[365] J. McCarthy, ?A basis for a mathematical theory of computation,? Comput. Progr. and Formal Systems, Amsterdan e.a. (1963), pp. 33?70.
[366] J. McCarthy, ?Towards a mathematical science of computation,? Papers in the theory of Computation, Stanford (1966), pp. 27?34.
[367] J. McCarthy, ?A formal description of a subset of Algol,? Stanford AI Proj. Memo., No. 24 (1964).
[368] J. McCarthy, ?Problems in the theory of computations,? Proc. IFIP Congr., New York City, 1965, Vol. 1, Washington, D.C., Spartan Books, Inc., London, MacMillan (1965), pp. 219?222. · Zbl 0203.15101
[369] J. McCarthy and J. Painter, ?Correctness of a compiler for arithmetic expression,? Stanford AI Proj. Memo, No. 40 (1966).
[370] S. McLane, Categories for the Working Mathematician, Springer-Verlag, New York (1971).
[371] L. Meertens, ?Mode and meaning,? New Dir. Algorithmic Lang., 1975, Rocquencourt Le Chesnay, S.a., pp. 125?138.
[372] A. R. Meyer and J. Y. Halpern, ?Axiomatic definitions of programming languages: a theoretical assessment,? MIT Lab. Comput. Sci. Techn. Memo., No. 163 (1980).
[373] G. de Michelis, G. A. Lanzarone, and C. Simone, ?Program proving: exit and return jumps in structured programs,? GI-6, Jahrestag, Stuttgart, 1976, Berlin a.e. (1976), pp. 121?132. · Zbl 0354.68020
[374] P. A. Miglioli and M. Ornaghi, ?A calculus to build up correct programs,? Lect. Notes Comput. Sci.,53, 398?409 (1977).
[375] R. Milne and E. Strachey, A Theory of Programming Language Semantics, New York (1976). · Zbl 0357.68004
[376] R. Milner, ?Synthesis of communicating behavior,? Lect. Notes Comput. Sci.,64, 71?83 (1978). · Zbl 0411.68031
[377] J. Misra, ?An approach to formal definitions and proofs of programming principles,? IEEE Trans. Software Eng.,4, No. 5, 410?413 (1978). · Zbl 0385.68011
[378] J. H. Morris, Jr. and B. Wegbreit, ?Subgoal induction,? Commun. ACM,20, No. 4, 209?222 (1977). · Zbl 0349.68007
[379] J. H. Morris, Jr. and E. Schmidt, ?Experience with an applicative string processing language,? 7th Ann. ACM Symp. Princ. of Progr. Lang., Las Vegas, New York (1980), pp. 32?46.
[380] P. D. Mosses, ?A constructive approach to compiler correctness,? Lect. Notes Comput. Sci.,94, 189?210 (1980).
[381] P. D. Mosses, ?Compiler generation using denotational semantics,? Lect. Notes Comput. Sci.,45, 436?441 (1976). · Zbl 0338.68021
[382] D. R. Musser, ?On proving inductive properties of abstract data types,? 7th Ann. ACM Symp. Princ. Progr. Lang., Las Vegas (1980), pp. 154?162.
[383] T. Müldner, ?On semantics of parallel programs,? Pr. IPI PAN, No. 348 (1979).
[384] R. Nakajima, M. Honda, and H. Nakahara, ?Hierarchical program specifications and verification ? a many-sorted logical approach,? Acta Inf.,14, No. 2, 135?155 (1980). · Zbl 0432.68011
[385] N. N. Nepeivoda, ?The logical approach to programming,? Lect. Notes Comp. Sci.,122, 261?289 (1981).
[386] J. R. Nestor, ?Models of data obects and data types,? Lect. Notes Comput. Sci.,54, 131?170 (1977).
[387] R. Nicolescu, ?Some short comments on the definition and the documentation of the Ada programming language,? SIGPLAN Not.,15. Nos. 7?8, 64?71 (1980).
[388] D. Normann, ?Set recursion,? Gen. Recursion Theory 2. Proc. Symp., Oslo, 1977, Amsterdam e.a. (1978), pp. 303?320. · Zbl 0352.02034
[389] F. Nourani, ?A model-theoretic approach to specification, extension, and implementation,? Lect. Notes Comput. Sci.,83, 282?297 (1980). · Zbl 0435.68021
[390] F. Orejas, ?On the power of conditional specifications,? SIGPLAN Not.,14, No. 7, 78?81 (1979).
[391] P. Padawitz, ?New results on completeness and consistency of abstract data types,? Lect. Notes Comput. Sci.,88, 460?473 (1980). · Zbl 0441.68015
[392] F. G. Pagan, ?ALGOL 68 as a methalanguage for denotational semantics,? Comp. J.,22, No. 1, 63?66 (1978).
[393] F. G. Pagan, ?Semantic specification using two-level grammars: blocks, procedures and parameters,? Comput. Lang.,4, Nos. 3?4, 171?185 (1979). · Zbl 0416.68074
[394] F. G. Pagan, ?Formal semantics of SNOBOL-4 subset,? Comput. Lang.,3, No. 1, 13?30 (1978). · Zbl 0364.68016
[395] F. G. Pagan, ?On interpreter-oriented definitions of programming languages,? Comput. J.,19, No. 2, 151?155 (1976). · Zbl 0335.68006
[396] C. Pair, ?La programmation: de l’enonce au programme,? Theor. Techn. Inform. Log. Mater. Act. Congr. AFCET, Gif-sur-Yvette, T. 1, 1978, Suresnes (1978), pp. 325?337.
[397] C. Pair, ?Some theoretical aspects of program construction,? Lect. Notes Comput. Sci.,69, 617?651 (1979). · Zbl 0408.68020
[398] D. Park, ?On the semantics of fair parallelism,? Lect. Notes Comput. Sci.,86, 506?526 (1980). · Zbl 0456.68028
[399] J. S. Pedersen, ?A formal semantics definition of sequential Ada,? Lect. Notes Comput. Sci.,98, 213?308 (1980).
[400] P. Pepper, ?Transformational semantics,? Lect. Notes Comput. Sci.,69, 322?405 (1979).
[401] R. Peter, ?Rekursive Funktionen in der Komputer-Theorie,? Akad. Kiado, Budapest (1976).
[402] J. C. Peterson and W. D. Murray, ?Parallel computer architecture employing functional programming systems,? Proc. Int. Conf. Parallel Proc., 1980, New York, N.Y. (1980), pp. 145?156.
[403] G. D. Plotkin, ?A power domain construction,? SIAM J. Comput.,5, No. 3, 452?487 (1976). · Zbl 0355.68015
[404] G. D. Plotkin, ?LCF considered as a programming language,? Theor. Comp. Sci.,5, No. 2, 223?255 (1977). · Zbl 0369.68006
[405] A. Pnueli, ?The temporal semantics of concurrent programs,? Lect. Notes Comput. Sci.,70, 1?20 (1979). · Zbl 0402.68009
[406] M. B. Pour-El, ?Computer science and recursion theory,? ACM 78. Proc. Ann. Conf. ACM, Washington, D.C., 1978, Vol. 1, New York, N.Y. (1978), pp. 15?20.
[407] V. R. Pratt, ?Application of modal logic in programming,? MIT Lab. Comput. Sci. Techn. Memo., No. 116 (1978).
[408] P. Pritchard, ?Program proving-expression language,? Information Processing, 77 Amsterdam e.a. (1977), pp. 727?731.
[409] I. C. Pyle, ?Axioms for user-defined operators,? Software Pract. Exper.,10, No. 4, 307?318 (1980). · Zbl 0429.68017
[410] V. Rajlich, ?Relational definition of computer languages,? Lect. Notes Comput. Sci.,32, 362?376 (1975). · Zbl 0318.68016
[411] H. Rasiowa, ?Completeness in classical logic of complex algorithms,? Lect. Notes Comput. Sci.,88, 488?503 (1980). · Zbl 0459.68001
[412] M. Raskowsky and R. Turner, ?Compiler generation and denotational semantics,? Math. Res.,2, 382?386 (1979). · Zbl 0412.68079
[413] H. Reichel, ?Initially restricting algebraic theories,? Lect. Notes Comput. Sci.,88, 504?514 (1980). · Zbl 0469.68026
[414] J. C. Reynolds, ?Using category theory to design implicit conversions and generic operators,? Lect. Notes Comput. Sci.,94, 211?258 (1980). · Zbl 0836.68064
[415] W. P. de Roever, ?On backtracking and greatest fixed points,? Formal Descr. Program. Conc., Proc. IFIP Work. Conf. St. Andrews, 1977, Amsterdam e.a. (1978), pp. 621?636.
[416] B. Russell, ?On an equivalence between continuation and stack semantics,? Acta Inf.,8, No. 2, 113?123 (1977). · Zbl 0382.68009
[417] P. Sallé, ?Echappements et continuations en semantique dénotationelle,? Lect. Notes Comput. Sci.,83, 298?310 (1980).
[418] A. Salwicki, ?Axioms of algorithmic logic univocally determine semantics of programs,? Lect. Notes Comput. Sci.88, 552?561 (1980). · Zbl 0441.68023
[419] A. Salwicki, ?On the algorithmic theory of stacks,? Ann. Soc. Math. Pol. Ser. 4: Fundam. Inf.,3, No. 3, 311?331 (1980). · Zbl 0441.68013
[420] V. Yu. Sazonov, ?Sequentially and parallelly computable functionals,? Lect. Notes Comput. Sci.,37, 311?318 (1975). · Zbl 0332.02036
[421] V. Yu. Sazonov, ?Degrees of parallelism in computations,? Lect. Notes Comput. Sci.,46, 517?523 (1976).
[422] R. W. Schufler, ?A denotational semantics of CLU,? MIT Lab. Comp. Sci. Tech. Rept., No. 201 (1978).
[423] J. S. Schwartz, ?Denotational semantics of parallelism,? Lect. Notes Comput Sci.,70, 191?202 (1979).
[424] J. T. Schwartz, ?Correct-program technology,? Fondem. programm. Cours Commiss. Commun. eur., Toulouse, 1977, Le Chesnay, S.a., pp. 229?269.
[425] R. L. Schwartz, ?An axiomatic treatment of ALGOL 68 routines,? Lect. Notes Comput. Sci.,71, 530?545 (1979). · Zbl 0404.68002
[426] D. S. Scott, ?Logic and programming languages,? Commun. ACM,20, No. 9, 634?641 (1977). · Zbl 0355.68019
[427] D. S. Scott, ?Data types as lattices,? Lect. Notes Math.,499, 579?651 (1975). · Zbl 0322.02024
[428] R. Sethi and A. Tang, ?Constructing call-by-value continuation semantics,? Lect. Notes Comput. Sci.,71, 556?570 (1979). · Zbl 0404.68006
[429] A. Shamir and W. W. Wadge, ?Data types as objects,? Lect. Notes Comput. Sci.,52, 465?479 (1977). · Zbl 0353.68050
[430] J. C. Shepherdson, ?On the definition of computable of a real variable,? Z. Math. Log. Grundl. Math.,22, No. 5, 391?402 (1976). · Zbl 0359.02029
[431] M. Sintzoff, ?Suggestion of composing and specifying program design decisions,? Lect. Notes Comput. Sci.,83, 311?326 (1980). · Zbl 0435.68019
[432] M. Sintzoff, ?Ensuriring correctness by arbitrary postfixed-points,? Lect. Notes Comput. Sci.,64, 484?492 (1978). · Zbl 0412.68015
[433] M. Sintzoff, ?On language design for program construction,? ALGOL Bull., No. 42, 75?85 (1978). · Zbl 0374.68005
[434] M. B. Smyth, ?Computability in categories,? Lect. Notes Comput. Sci.,85, 609?620 (1980). · Zbl 0471.68031
[435] M. B. Smyth, ?Power domains,? J. Comput. Syst. Sci.,16, No. 1, 23?36 (1978). · Zbl 0391.68011
[436] S. Sokolowsky, ?Axioms for total correctness,? Acta Inf.,9, No. 1, 61?71 (1977).
[437] J. F. Stoy, ?Foundations of denotational semantics,? Lect. Notes Comput. Sci.,86, 43?99 (1980). · Zbl 0468.68013
[438] M. Suchenek, ?O logice obliczeniowej,? Pr. Nauk PWarz, Electron., No. 50, 3?57 (1980).
[439] K. Sugawara, H. Kawaguchi, and T. Nishizawa, ??E-correctness? of a set of ?computation processes?,? Lect. Notes Comput. Sci.,75, 282?301 (1979). · Zbl 0416.68012
[440] N. Suzuki and D. Jefferson, ?Verification decidability of presburger array programs,? J. Assoc. Comput. Mach.,27, No. 1, 191?205 (1980). · Zbl 0429.68025
[441] S. A. Tärnlund, ?Horn clauses computability,? BIT (Sver.),17, No. 2, 215?226 (1977). · Zbl 0359.02042
[442] R. D. Tennent, ?The denotational semantics of programming languages,? Commun. ACM,19, No. 8, 437?453 (1976). · Zbl 0337.68010
[443] J. W. Thatcher, E. G. Wagner, and J. B. Wright, ?More on advice on structuring compilers and proving them correct,? Lect. Notes Comput. Sci.,52, 596?615 (1977). · Zbl 0468.68007
[444] J. Tiurin, ?Fixed points in the power-set algebra of infinite and algebras with infinitely long expressions,? Lect. Notes Comput. Sci.,56, 332?339 (1977).
[445] J. Tiurin, ?Unique fixed points vs least fixed points,? Lect. Notes Comput. Sci.,71, 633?645 (1979).
[446] Tsong Yueh Chen, ?Formalization of correctness of recursive definitions,? Int. J. Comp. Inf. Sci.,9, No. 1, 55?61 (1980). · Zbl 0435.03034
[447] V. F. Turchin, ?Semantic definitions in Refal and automatic production of compilers,? Lect. Notes Comput. Sci.,94, 441?474 (1980).
[448] J. W. Ulrich and R. Moll, ?Program synthesis by analogy,? SIGPLAN Not.,12, No. 8, 22?28 (1977).
[449] W. A. Uspenski and A. L. Semenov, ?What are gains of the algorithms,? Lect. Notes Comput. Sci.,122, 100?234 (1981).
[450] C. P. Wadsworth, ?The relation between computational and denotational properties for Scott’s D?-models of the ?-calculus,? SIAM J. Comput.,5, No. 3, 488?521 (1976). · Zbl 0346.02013
[451] E. G. Wagner, J. W. Thatcher, and J. B. Wright, ?Programming languages as mathematical objects,? Lect. Notes Comput. Sci., No. 64, 84?111 (1978). · Zbl 0394.68008
[452] M. Wand, ?A new incompleteness result for Hoare’s system,? Conf. Rec. 8th Ann. ACM Symp. Theory Comput., Hershey, Pa., Calif., 1976, New York (1976), pp. 87?91. · Zbl 0365.68009
[453] M. Wand, ?A characterization of weakest preconditions,? J. Comput System Sci.,15, No. 2, 209?212 (1977). · Zbl 0369.68004
[454] M. Wand, ?Final algebra semantics and data type extensions,? J. Comput. Syst. Sci.,19, No. 1, 27?44 (1979). · Zbl 0418.68020
[455] A. Wang, ?An axiomatic basis for proving total correctness of Goto programs,?16, No. 1, 88?102 (1976). · Zbl 0321.68010
[456] H. Wedekind, ?Konstruktive abstrakte Datentypen,? GI-10, Jahrestag, Saarbrücken, 1980, Berlin e.a. (1980), pp. 213?224.
[457] B. Wegbrait, ?Verifying program performance,? J. Assoc. Comput. Mach.,23, No. 4, 691?699 (1976). · Zbl 0333.68013
[458] M. H. Williams, ?Methods for specifying static semantics,? Comput. Lang.,6, No. 1, 1?17 (1981). · Zbl 0456.68100
[459] J. Winkowski, ?A formalism for describing nonsequential processes,? Ann. Soc. Math. Pol. Ser. IV: Fundam. Informat.,2, No. 1, 129?139 (1978). · Zbl 0402.68037
[460] J. Winkowski, ?An algebraic approach to concurrence,? Lect. Notes Comput. Sci.,74, 523?532 (1979). · Zbl 0428.68068
[461] J. Winkowski, ?Algebras of partial sequences ? a tool to deal with concurrency,? Lect. Notes Comput. Sci.,56, 187?196 (1977). · Zbl 0382.68010
[462] J. Winkowski, ?A natural method of proving properties of programs,? Pr. CO PAN, No. 199 (1975). · Zbl 0315.68013
[463] J. Winkowski, ?An algebraic approach to nonsequential computations,? Pr. IPI PAN, No. 312 (1978).
[464] T. Winograd, ?Beyond programming languages,? Commun. ACM,22, No. 7, 391?401 (1979).
[465] M. Wirsing and M. Broy, ?Abstract data types as lattices of finitely generated models,? Lect. Notes Comput. Sci.,88, 673?685 (1980). · Zbl 0441.68014
[466] N. Wirth, Algorithms + Data Structures=Programs, Prentice-Hall (1976). · Zbl 0375.68005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.