Some Complexity Results for Stateful Network Verification - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yaron Velner, Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham. Some Complexity Results for Stateful Network Verification. In Marsha Chechik, Jean-François Raskin, editors, Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings. Volume 9636 of Lecture Notes in Computer Science, pages 811-830, Springer, 2016. [doi]

This author has not been identified. Look up 'Yaron Velner' in GoogleThis author has not been identified. Look up 'Kalev Alpernas' in GoogleThis author has not been identified. Look up 'Aurojit Panda' in GoogleThis author has not been identified. Look up 'Alexander Rabinovich' in GoogleThis author has not been identified. Look up 'Mooly Sagiv' in GoogleThis author has not been identified. Look up 'Scott Shenker' in GoogleThis author has not been identified. Look up 'Sharon Shoham' in Google

runs on WebDSL