Computer Aided Verification: 10th International Conference, CAV'98, Vancouver, BC, Canada, June 28-July 2, 1998, Proceedings, 10. sējumsSpringer Science & Business Media, 1998. gada 3. jūn. - 552 lappuses This book consitutes the refereed proceedings of the 10th International Conference on Computer Aided Verification, CAV'98, held in Vancouver, BC, Canada, in June/July 1998. The 33 revised full papers and 10 tool papers presented were carefully selected from a total of 117 submissions. Also included are 11 invited contributions. Among the topics covered are modeling and specification formalisms; verification techniques like state-space exploration, model checking, synthesis, and automated deduction; various verification techniques; applications and case studies, and verification in practice. |
Saturs
I | 1 |
III | 17 |
V | 29 |
VI | 39 |
VIII | 45 |
IX | 49 |
X | 57 |
XI | 61 |
XLIV | 305 |
XLV | 319 |
XLVII | 332 |
XLVIII | 345 |
L | 357 |
LI | 369 |
LIII | 379 |
LVI | 391 |
XIII | 71 |
XIV | 77 |
XVII | 88 |
XVIII | 98 |
XX | 110 |
XXI | 122 |
XXIII | 135 |
XXV | 147 |
XXVII | 159 |
XXVIII | 172 |
XXIX | 184 |
XXX | 195 |
XXXII | 207 |
XXXIII | 219 |
XXXV | 232 |
XXXVI | 244 |
XXXVIII | 256 |
XXXIX | 268 |
XLI | 280 |
XLII | 293 |
LVIII | 403 |
LIX | 416 |
LXI | 428 |
LXII | 440 |
LXIII | 452 |
LXIV | 464 |
LXVI | 477 |
LXVII | 488 |
LXVIII | 500 |
LXX | 505 |
LXXII | 511 |
LXXIV | 516 |
LXXV | 521 |
LXXVI | 526 |
LXXVIII | 532 |
LXXIX | 537 |
LXXX | 542 |
LXXXII | 546 |
551 | |
Citi izdevumi - Skatīt visu
Computer Aided Verification: 10th International Conference, CAV'98 ... Alan J. Hu,Moshe Y. Vardi Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
abstract ACL2 algorithm analysis applied approach atomic automata automaton boolean Büchi automata cache circuit Computer Aided Verification Computer Science concurrent condition constraints construction correctness corresponding cycle defined denote E.M. Clarke equivalent example execution expressed finite finite-state formal methods formal verification formula FP adder function given graph IEEE implementation infinite initial input instruction integer invariant iterations Kripke structure language latches Lemma linear LNCS loop memory model checking module node Nqthm Nuprl on-the-fly operations output partial order partial order reduction performed Petri nets pipeline POSET predicate Presburger Presburger arithmetic problem Proc processor properties protocol prove queue reduced refinement RegFile representation represented requirements satisfies Section semantics sequence sequential simulation space specification speculative execution symbolic model checking symmetry synchronous techniques temporal logic theorem prover tion tool transition relation variables