SPECIFICATION AND VERIFICATION OF CONCURRENT PROGRAMS BY ALL-AUTOMATA

被引：0

作者：

MANNA, Z

PNUELI, A

机构：

来源：

TEMPORAL LOGIC IN SPECIFICATION | 1989年 / 398卷

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：124 / 164

页数：41

共 15 条

[1] COUNTABLE NONDETERMINISM AND RANDOM ASSIGNMENT [J].

APT, KR ;

PLOTKIN, GD .

JOURNAL OF THE ACM, 1986, 33 (04) :724-767

[2] AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS USING TEMPORAL LOGIC SPECIFICATIONS [J].

CLARKE, EM ;

EMERSON, EA ;

SISTLA, AP .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1986, 8 (02) :244-263

[3]

EMERSON E, 1985, 12TH P ANN ACM S PRI, P84

[4] A PROOF RULE FOR FAIR TERMINATION OF GUARDED COMMANDS [J].

GRUMBERG, O ;

FRANCEZ, N ;

MAKOWSKY, JA ;

DEROEVER, WP .

INFORMATION AND CONTROL, 1985, 66 (1-2) :83-102

[5] EFFECTIVE TRANSFORMATIONS ON INFINITE-TREES, WITH APPLICATIONS TO HIGH UNDECIDABILITY, DOMINOES, AND FAIRNESS [J].

HAREL, D .

JOURNAL OF THE ACM, 1986, 33 (01) :224-248

[6] AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J].

HOARE, CAR .

COMMUNICATIONS OF THE ACM, 1969, 12 (10) :576-&

[7]

MANNA Z, 1981, CORRECTNESS PROBLEM, P215

[8] PROVING LIVENESS PROPERTIES OF CONCURRENT PROGRAMS [J].

OWICKI, S ;

LAMPORT, L .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :455-495

[9] MYTHS ABOUT THE MUTUAL EXCLUSION PROBLEM [J].

PETERSON, GL .

INFORMATION PROCESSING LETTERS, 1981, 12 (03) :115-116

[10]

VARDI MY, 1987, 2ND P IEEE S LOG COM, P167

← 1 2 →