|
[ALRM 83] U.S. Department of Defense: The Programming Language Ada,
Reference Manual. American National Standards Institute,
Inc. ANSI/MIL-STD-1815A-1983, Lecture Notes in Computer
Science, Vol. 155 (Springer, Berlin, 1983).
|
|
[And 91] Andrews, G.R.: Concurrent Programming, Principles and
Practice. (Benjamin/Cummings, Redwood City, 1991).
|
|
[Bac Ser 90]Back, R.J.R.-Sere, K.: Stepwise Refinement of Parallel
Algorithms. Science of Computer Programming, Vol. 13
(1989/90) 133-180.
|
|
[Bak War 91]de Bakker, J.W.-Warmerdam, J.H.A.: Four domains for
concurrency. Theoretical Computer Science Vol. 90 (1991)
127-149.
|
|
[Ben 88] Benthem, J.: Time, Logic and Computation. In: Linear Time,
Branching Time and Partial Order in Logics an Models for
Concurrency, Lecture Notes in Computer Science, Vol. 354.
(Springer, Berlin, 1989) 1-49.
|
|
[Best 83] Best, E.: Relational Semantics of Concurrent Programs. In:
Formal Description of Programming Concepts, II. (1983)
431-452.
|
|
[Car 94] Carruth, A.: Real-Time Unity. Technical Report TR94-10,
University of Texas at Austin, ftp://ftp.cs.utexas.edu. (March
29, 1994).
|
|
[Cha Mis 89]Chandy, K.M.-Misra, J.: Parallel Program Design: A
Foundation. (Addison-Wesley, 1988, 1989).
|
|
[Cha 90] Chandy, K.M.: Reasoning about continuous systems. Science
of Computer Programming, Vol. 14 (1990) 117-132.
|
|
[Col 94] Collette, P.: Composition
of assumtion-commitment specifications in a UNITY style.
Science of Computer Programming, Vol. 23 (1994) 107-125.
|
|
[Dij 75] Dijkstra, E.W.: Guarded Commands, Nondeterminacy and
Formal Derivation of Programs. Communications of the ACM,
Vol. 18, Num. 8 (1975) 453-457.
|
|
[Dij 76] Dijkstra, E.W.: A Discipline of Programming. (Prentice-Hall,
1976).
|
|
[Dij Sch 89] Dijkstra, E.W.-Scholten, C.S.: Predicate Calculus and Program
Semantics. (Springer, New York, 1989).
|
|
[Eme Sri 88]Emerson, E.A.-Srinivasan, J.: Branching Time Temporal Logic.
In: Linear Time, Branching Time and Partial Order in Logics
and Models for Concurrency, Lecture Notes in Computer
Science, Vol. 354 (Springer, Berlin, 1989) 123-172.
|
|
[Fáb 94] Fábián G.: Párhuzamos algoritmusok specifikációja
osztott objektumokat használó rendszerek esetén UNITY
módszerrel. I. Osztott bináris fák. Szakdolgozat, ELTE,
Informatika Tanszékcsoport. (Témavezető: Horváth Z.)
1994.
|
|
[Flo Suz 81]Flon, L., Suzuki, N.: The Total Correctness of Parallel
Programs. SIAM Journal of Computing, Vol. 10, No. 2 (May
1981) 227-246.
|
|
[Fót 83] Fóthi Á.: Bevezetés a programozáshoz. Egyetemi jegyzet
(ELTE, TTK, Budapest, 1983).
|
|
[Fót 86] Fóthi Á.: Bevezetés a programozáshoz és Programozás
c. előadásainak anyaga (1986-1987).
|
|
[Fót 88] Fóthi Á.: A Mathematical Approach to Programming.
Annales Uni. Sci. Budapest de R. Eötvös Nom. Sectio
Computatorica, Tom. IX. (1988) 105-114.
|
|
[Fót Hor 91]Fóthi Á.- Horváth Z.: The Weakest Precondition and the
Theorem of the Specification. In: Koskimies,K.-Räihä,K.,
ed., Proceedings of the Second Symposium on Programming
Languages and Software Tools, Pirkkala, Finland, August 21-23,
1991, Report A-1991-5, University of Tampere, Department of
Computer Science (August, 1991) 39-47.
|
|
[Fót Hor 94]Fóthi Á.- Horváth Z.: A Parallel Elementwise Processing.
In: Ferenczi
Sz.-Kacsuk P., ed., Proceedings of the 2nd Austrian-Hungarian
Workshop on Transputer Applications, September 29-October
1, 1994, Budapest, Hungary, KFKI-1995-2/M,N Report (1995)
273-282.
|
|
[Fót Hor Kozs 95]Fóthi Á.- Horváth Z.- Kozsik T.:
Parallel Elementwise Processing – A Novel Version. In: Varga
L., ed., Proceedings of the Fourth Symposium on Programming
Languages and Software Tools, Visegrád, Hungary, June 9-10,
1995 (1995) 180-194. és Annales Uni. Sci. Budapest de R.
Eötvös Nom. Sectio Computatorica (1996).
|
|
[Fót Nyé 90]Fóthi Á.-Nyékyné Gaizler J.: Some Problems of
Updating Sequential Files. To appear.
|
|
[Fra 86] Franczez, N.: Fairness. (Springer, New York, 1986).
|
|
[Fro 96] Frohner Á.: Párhuzamos programozást támogató nyelvi
eszközök összehasonlítása. Diplomamunka, ELTE,
Informatika Tanszékcsoport. (Témavezető: Horváth Z.)
1996.
|
|
[Győr 94] Győrffy L.: Párhuzamos algoritmusok specifikációja osztott
objektumokat használó rendszerek esetén UNITY
módszerrel. II. Hatványlisták. Diplomamunka, ELTE,
Informatika Tanszékcsoport. (Témavezető: Horváth Z.)
1995.
|
|
[Hen 88] Hennessy, M.: Algebraic Theory of Processes. (The MIT Press,
1988).
|
|
[Hoa 78] Hoare, C.A.R.: Communicating Sequential Processes,
Communications of the ACM Vol. 21, Num. 8 (1978) 666-677.
|
|
[Hoa 85] Hoare, C.A.R.: Communicating Sequential Processes.
(Prentice-Hall Int., Englewood Cliffs, NJ, 1985).
|
|
[Hor 88] Horváth Z.: On-line folyamatirányító szakértői
rendszerek fejlesztése. In: Fekete I., ed., Szakértői rendszrek
az ipari folyamatirányításban, kutatási jelentés, ELTE,
TTK, Általános Számítástudományi Tanszék (1988).
|
|
[Hor 90] Horváth Z.: Fundamental relation operations in the
mathematical models of programming. Annales Uni. Sci.
Budapest de R. Eötvös Nom. Sectio Computatorica, Tom. X.
(1990) 277-298. {MR 92e68113 68Q55 68Q60}.
|
|
[Hor 93] Horváth Z.: The Weakest Precondition and the the Specification
of Parallel Programs. In: Proceedings of the Third Symposium on
Programming Languages and Software Tools, Käariku, Estonia,
August 21-23, 1993 (1993) 24-33.
|
|
[Hor 93-96] Horváth Z.:
Párhuzamos programozás alapjai. Jegyzet. Előkészületben.
(ftp://augusta.inf.elte.hu/pub/parh) 1993-1996.
|
|
[Hor 95] Horváth Z.: Parallel asynchronous computation of the values of an
associative function. Acta Cybernetica, Vol. 12, No. 1, Szeged (1995)
83-94.
|
|
[Hor 95a] Horváth Z.: The Formal Specification of a Problem Solved by
a Parallel Program – a Relational Model. In: Varga L., ed.,
Proceedings of the Fourth Symposium on Programming Languages
and Software Tools, Visegrád, Hungary, June 9-10, 1995 (1995)
165-179. és Annales Uni. Sci. Budapest de R. Eötvös Nom. Sectio
Computatorica (1996).
|
|
[Hor Koz 94] Horváth Z.- Kozma L.: Parallel Programming Methodology. In:
Bogdany J.-Vesztergombi G., ed., Workshop on Parallel Processing.
Technology and Applications. Budapest, Hungary, 10-11 February,
1994, KFKI-94-09/M,N Report (1994) 57-65.
|
|
[Ivá 03] Iványi A.: Párhuzamos algoritmusok. ELTE Eötvös Kiadó,
2003.
|
|
[Jär 92] Järvinen, H-M.: The Design of a Specification Language for
Reactive Systems. Thesis for the degree of Doctor of Technology,
Tampere University of Technology, Publications 95, Tampere, 1992.
|
|
[Jut Kna Rao 89]Jutla, C.S., Knapp, E., Rao, J. R.: A Predicate Transformer
Approach to Semantics of Parallel Programs. In: Proc. 8th Ann.
ACM SIGACT/SIGOPS Symposyum on Principles of Distributed
Computing, Edmonton, Alberta, Canada, August 14-16, 1989 (1989)
249-263.
|
|
[Kna 90] Knapp, E.: A Predicate Transformer for Progress. Information
Processing Letters, Vol. 33 (1989/90) 323-330.
|
|
[Kna 92] Knapp, E.: Derivation of concurrent programs: two examples.
Science of Computer Programing, Vol. 19 (Oct. 1992) 1-23.
|
[Koz 94] Kozma L.: Synthesizing Methods of Parallel
Systems. An Overview. In: Proceedings of
 P’94, Technical University Budapest, Hungary (1994) 586-.
|
|
[Koz Var 03] Kozma L., Varga L.: A szoftvertechnológia elméleti kérdései.
ELTE Eötvös Kiadó, 2003.
|
|
[Krö 87] Kröger, F.: Temporal Logic of Programs. (Spriger, 1987).
|
|
[Lam 77] Lamport, L.: Proving the Correctness of Multiprocess Programs,
IEEE Transactions on Software Engeneering, Vol. SE-3, No., 2
(March 1977) 125-143.
|
|
[Lam 90] Lamport, L.: win and sin: Predicate Transformers for Concurrency.
ACM Transactions on Programming Languages and Systems, Vol.
12, No. 3 (July 1990) 396-428.
|
|
[Lam 91] Lamport, L.: The Temporal Logic of Actions. Technical Report
SRC Research Number TR79, Digital Equipment Corporation,
Systems Research Center, Palo Alto, CA, ftp: gatekeeper.dec.com:
pub/DEC/SRC/research-reports (December 1991).
|
|
[Lam Lyn 90]Lamport, L.-Lynch, N.: Distributed Computing Models and
Methods. In: van Leeuwen, ed., Handbook of Computer Science, vol.
B (Elsevier, Amsterdam, 1990) 1157-1199.
|
|
[Lam Sin 79] van Lamsweerde, A., Sintzoff, M.: Formal Derivation of Strongly
Correct Concurrent Programs. Acta Informatica, Vol. 12, No. 1
(1979) 1-31.
|
|
[Lav 78] Laventhal, M.: Synthesis of Synchronization Code for Data
Abstractions. Ph.D. Thesis (MIT, 1978).
|
|
[Loy Vor 90] Loyens, L.D.J.C.-van de Vorst, J.G.G.: Two Small Parallel
Programming Exercises. Science of Computer Programming, Vol. 15
(1990) 159-169.
|
|
[Luk Sne 92] Lukkien, J., van de Snepscheut J.,L.,A.: Weakest Preconditions for
Progress. Formal Aspects of Computing, Vol. 4 (1992) 195-236.
|
|
[Lyn 02] Lynch, N.,A.: Osztott algoritmusok. Kiskapu Kiadó, 2002.
|
|
[Maz 89] Mazurkiewicz, A.: Basic Notions of Trace Theory. In: Linear
Time, Branching Time and Partial Order in Logics an Models
for Concurrency, Lecture Notes in Computer Science, Vol. 354.
(Springer, Berlin, 1989) 285-362.
|
|
[Mil 89] Milner, R.: Communication and Concurrency. (Prentice Hall, 1989).
|
|
[UN 88-93] Misra, J., et al.: Notes on UNITY, 1988-1993., The University of
Texas, Austin, ftp://ftp.cs.utexas.edu.
|
|
[Mis 01] Misra, J.: A Discipline of Multiprogramming - Programming Theory
for Distributed Applications, Springer, New York, 2001.
|
|
[Mor 87] Morris, J.,M.: A Theoretical Basis for Stepwise Refinement and the
Programming Calculus. Science of Computer Programming, Vol. 9
(1987) 287-306.
|
|
[Mor 90] Morris, J.,M.: Temporal Predicate Transformers and Fair
Termination. Acta Informatica, Vol. 26, 287-313, 1990.
|
|
[Mak Ver 91]Mak, R.H., Verhoeff, T.: Classification of Models, Lecture Notes on
Process Models, TU Eindhoven, manuscript, 1991.
|
|
[Mel 87] Melliar-Smyth, P.M.: Extending Interval Logic to Real Time
Systems, Lecture Notes in Computer Science, Vol. 398 (1987)
224-242.
|
|
[Owi Gri 76] Owiczki, S.S., Gries, D.: An Axiomatic Proof Technique for Parallel
Programs. Acta Informatica, Vol. 6, 319-340, 1976.
|
|
[Pac 92] Pachl, J.: A simple proof of a completeness result for leads-to in the
UNITY logic. Information Processing Letters, Vol. 41 (1992) 35-38.
|
|
[Par 79] Park, D.: On the semantics of fair parallelism In LNCS 86, pp
504-526. Springer 1980.
|
|
[Pász 93] Pásztorné
Varga K.: Logikai alapozás alkalmazásokhoz. Matematikai logika -
számítástudomány. Egyetemi jegyzet, ELTE, TTK (Budapest,
1992).
|
|
[Pra 94] Prasetya, I.S.W.B.: Error in the UNITY Substitution Rule for
Subscribed Operators. Formal Aspects of Computing, Vol. 6 (1994)
466-470.
|
|
[Pra 86] Pratt, V.: Modeling Concurrency with Partial Orders. International
Journal of Parallel Programing, Vol. 15, No. 1 (1986) 33-71.
|
|
[Qui 87] Quinn, M.,J.: Designing Efficient Algorithms for Parallel
Computers. (McGraw-Hill, Inc., 1987).
|
|
[Rácz 92] Rácz É.: A Temporal Logic Specification of a Transaction
Manager. Ph.D. Thesis, ELTE (1992) /in Hungarian/
|
|
[Rao 95] Rao, J.,R.: Extensions of the UNITY Methodology, Lecture Notes in
Computer Science, Vol. 908. (Springer, 1995).
|
|
[San 91] Sanders, B.A.: Eliminating the substitution axiom from the UNITY
logic. Formal Aspects of Computing, Vol. 3 (1991) 189-205.
|
|
[Sin 91] Singh, A.,K.: Specification of concurrent objects using auxiliary
variables. Science of Computer Programming, Vol. 16 (1991) 49-88.
|
|
[Tan Ste 02] Tanenbaum, A.,S., van Steen, M.: Distributed Systems - Pronciples
and Paradigms. Prentice Hall, 2002.
|
|
[Var 81] Varga L.: Programok analízise és szintézise. (Akadémiai
Kiadó, Budapest, 1981).
|
|
[WRMP 95] Workgroup on Relational Models of Programming – Fóthi Á.
and Fekete I.-Gregorics T.-Horváth Z.- Koncz-Nagy M.-Kozics
S.-Nyéky-Gaizler J.-Sike S.-Steingart F.-Tőke P.- Vargyas
M.-Venczel T.: Some Concepts of a Relational Model of
Programming. In: Varga L., ed., Proceedings of the Fourth
Symposium on Programming Languages and Software Tools,
Visegrád, Hungary, June 8-14, 1995 (1995) 434-446.
|