SCOPUS 정보 검색 플랫폼

Volumn 6, Issue 2, 1992, Pages 107-120

Verification of distributed programs using representative interleaving sequences

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

Author keywords

Communication closed layers; Distributed programs; Eventuality properties; Interleaving sets; Partial order semantics; Proof lattices; Representative sequences; Verification

Indexed keywords

EID: 0001123063 PISSN: 01782770 EISSN: 14320452 Source Type: Journal
DOI: 10.1007/BF02252682 Document Type: Article

Times cited : (55)

References (37)

1
- 0346072994
- University of Washington, Seattle
- (1980) Decidability and expressiveness of logics of programs
- Abrahaon, K.¹

2
- 0000627069
- Appraising fairness in languages for distributed programming
- (1988) Distribut. Comput. , vol.2 , Issue.4 , pp. 226-241
- Apt, K.¹ Francez, N.² Katz, S.³

3
- 84976742643
- A proof system for communicating sequential processes
- (1980) ACM Transactions on Programming Languages and Systems , vol.2 , pp. 359-385
- Apt, K.R.¹ Francez, N.² de Roever, W.P.³

4
- 0022420723
- Defining liveness
- (1985) Inf. Process. Lett. , vol.21 , pp. 181-185
- Alpern, B.¹ Schneider, F.B.²

5
- 0022020346
- Distributed snapshots: determining global states of distributed systems
- (1985) ACM Trans. Comp. Syst. , vol.3 , pp. 63-75
- Chandy, K.M.¹ Lamport, L.²

6
- 84936721299
- Chou CT, Gafni E: Understanding and verifying distributed algorithms using stratified decomposition. 7th Annual ACM Symposium on Principles of Distributed Computing 44–65 (1988)

7
- 85032225591
- Partial ordering for CCS
- L., Budach, Lect. Notes Comput. Sci., Vol. 199, Springer, Berlin Heidelberg New York
- (1985) Proceedings FCT 85 , pp. 520-533
- Degano, P.¹ De Nicola, R.² Montanari, U.³

8
- 0016543936
- Guarded commands, nondeterminancy and formal derivation of programs
- (1975) Commun. ACM , vol.18 , pp. 453-457
- Dijkstra, E.W.¹

9
- 84936721300
- Dijkstra EW: The distributed snapshot algorithm of K.M. Chandy and L. Lamport. EWD864a

10
- 0020240360
- Decomposition of distributed programs into communication-closed layers
- (1982) Sci. Comput Programm , vol.2 , pp. 155-173
- Elrad, T.¹ Francez, N.²

11
- 0003297274
- Alternative semantics for temporal logic
- (1983) Theor. Comput. Sci. , vol.26 , pp. 121-130
- Emerson, E.A.¹

12
- 0022514018
- “Sometimes” and “not never” revisited: on branching versus linear time temporal logic
- (1986) J. ACM , vol.33 , pp. 151-178
- Emerson, E.A.¹ Halpern, J.Y.²

13
- 0003974004
- Fairness
- D., Gries, Springer, Berlin Heidelberg New York
- (1986) Texts and monographs in computer science
- Francez, N.¹

14
- 0022099693
- A proof rule for termination of guarded commands
- (1985) Information and Control , vol.66 , pp. 83-102
- Grümberg, O.¹ Francez, N.² Makowski, J.A.³ de Roever, W.P.⁴

15
- 0018005391
- Communicating sequential processes
- (1978) Commun. ACM , vol.21 , pp. 666-677
- Hoare, C.A.R.¹

16
- 84936721297
- Janicki R, Koutny M: Towards a theory of simulations for verification of concurrent systems. In: Odijk EM, Rem M, Syre JC (eds), PARLE '89, Lect Notes Comput Sci 366:73–88 (1989)

17
- 0025506042
- Interleaving set temporal logic
- (1990) Theor. Comput. Sci. , vol.75 , Issue.3 , pp. 263-287
- Katz, S.¹ Peled, D.²

18
- 84936721298
- Katz S, Peled D: Defining conditional independence using collapses, to appear in Theor. Comput. Sci. Preliminary version in Workshop on Semantics for Concurrency Leicester England 1990

19
- 84935249545
- An efficient verification method for parallel and distributed programs
- Lect. Notes Comput. Sci., vol. 354, Springer, Berlin Heidelberg New York
- (1988) Proceedings of Workshop on Linear Time, Branching Time and Partial Orders, in Logics and Models for Concurrency , pp. 489-507
- Katz, S.¹ Peled, D.²

20
- 84936721303
- Kwiatkowska MZ: Fairness for Non-Interleaving Concurrency. Phd Thesis, Department of Computing Studies Leicester 1989

21
- 0346967652
- Paradigms for distributed programs: computing global states
- M., Paul, H., Siegart, Lect Notes Comput Sci, vol. 190, Springer, Berlin Heidelberg New York
- (1985) Distributed systems — Methods and tools for specification. An advanced course. Munich , pp. 454-468
- Lamport, L.¹

22
- 85034565451
- Impartiality, justice and fairness: the ethics of concurrent termination. Proc. of 8^th International colloquium on Automata, Languages and Programming
- (1981) Lect Notes Comput Sci , vol.115 , pp. 264-277
- Lehman, D.¹ Pnueli, A.² Stavi, J.³

23
- 84936721304
- Manna Z, Pnueli A: Verification of concurrent programs: the temporal framework. In: Boyer RS, Moore JS (eds) The correctness problem in computer science. Academic Press 1981, pp 215–273

24
- 84936721301
- Manna Z, Pnueli A: How to cook a temporal proof system for your pet language. 10^th Symposium on Principles of Programming Languages. Austin Texas 1983, pp 141–154

25
- 85027619392
- Completing the temporal picture. Proceedings 16^th International Colloqium on Automata, Languages and Programming
- (1989) Lect Notes Comput Sci , vol.372 , pp. 534-558
- Manna, Z.¹ Pnueli, A.²

26
- 85034819445
- Trace semantics, Proceedings of advances in Petri nets 1986. Bad Honnel
- (1987) Lect Notes Comput Sci , vol.255 , pp. 279-324
- Mazurkiewicz, A.¹

27
- 84936721302
- Owicki S, Lamport L: Proving liveness properties of concurrent programs. ACM Trans Program Lang Syst 4:455–495

28
- 84936721305
- Peled D, Katz S, Pnueli A: Specifying and Proving Serializability in Temporal Logic. Proceedings of 6^th annual IEEE symposium on Logic in Computer Science. Amsterdam 1991, pp 232–245

29
- 85031896029
- Proving partial order liveness properties
- Lect Notes Comput Sci, vol. 443, Springer, Berlin Heidelberg New York
- (1990) 17th International Colloquium on Automata, Languages and Programming. Warwick University England July 1990 , pp. 553-571
- Peled, D.¹ Pnueli, A.²

30
- 0000769580
- A temporal logic for event structures
- (1988) Fundamenta Informaticae , vol.11 , Issue.3 , pp. 297-326
- Penczek, W.¹

31
- 0004068620
- Schriften des IIM, Nr. 2, Institut für Instrumentelle Mathematik, Bonn
- (1962) Kommunikation mit Automaten
- Petri, C.A.¹

32
- 0001206576
- Applications of temporal logic to the specification and verification of reactive systems, a survey of current trends
- Lect Notes Comput Sci, vol. 224, Springer, Berlin Heidelberg New York
- (1986) Current Trends in Concurrency , pp. 510-584
- Pnueli, A.¹

33
- 0003354698
- Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness
- Lect Notes Comput Sci, 172, Springer, Berlin Heidelberg New York
- (1984) 11^th ICALP, Antwerp Belgium , pp. 403-413
- Reisig, W.¹

34
- 85011164033
- Temporal logic and causality in concurrent systems
- F.H., Vogt, Lect Notes Comput Sci, vol 335, Springer, Berlin Heidelberg New York
- (1988) CONCURRENCY 88 , pp. 121-139
- Reisig, W.¹

35
- 0005354632
- Designing distributed algorithms by means of formal sequentially phased reasoning
- Lect Notes Comput Sci, vol 392, Springer, Berlin Heidelberg New York
- (1989) Proceedings of the 3^rd International Workshop on Distributed Algorithms
- Stomp, F.A.¹ deRoever, W.P.²

36
- 84936721286
- Valmari A: Stubborn sets for reduced state space generation, 10th International Conference on Application and Theory of Petri Nets. Bonn 1989 (2), pp 1–22

37
- 0001486078
- A stubborn attack on state explosion
- E., Clarke, R., Kurshan, Discrete Math, vol. 3, North-Holland, Amsterdam
- (1990) Computer-aided Verification '90 , pp. 25-42
- Valmari, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.