Keywords (1)

Academic
Publications
Validating indefinitely large communication networks with finite model checking

Validating indefinitely large communication networks with finite model checking,Adam D. Bradley,Assaf J. Kfoury,Azer Bestavros

Validating indefinitely large communication networks with finite model checking   (Citations: 1)
BibTex | RIS | RefWorks Download
Published in 2002.
Cumulative Annual
    • ...While much of the work in this paper was done manually, it is evident that many of the tasks and inferences made are plausible candidates for mechanical analysis and deduction; our hope is that the lessons learned will lead us to algorithms and results toward that end, and some such results will soon be forthcoming [3]...
    • ...Indefinitely Long Arrangements In another forthcoming paper [3], we show that these results are not sufficient to characterize the infinite set of all possible arrangements through finitely many model checks...

    Adam D. Bradleyet al. Safe Composition of Web Communication Protocols for Extensible Edge Se...

Sort by: