To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr17z67
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zave, Pamela | - |
dc.contributor.author | Rexford, Jennifer | - |
dc.date.accessioned | 2021-10-08T19:48:54Z | - |
dc.date.available | 2021-10-08T19:48:54Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.citation | Zave, Pamela, and Jennifer Rexford. "Compositional Network Mobility." In Working Conference on Verified Software: Theories, Tools, and Experiments (2014): pp. 68-87. doi:10.1007/978-3-642-54108-7_4 | en_US |
dc.identifier.uri | https://www.cs.princeton.edu/~jrex/papers/vstte13.pdf | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr17z67 | - |
dc.description.abstract | Mobility is a network capability with many forms and many uses. Because it is difficult to implement at Internet scale, there is a large and confusing landscape of mobility proposals which cannot easily be compared or composed. This paper presents formal models of two distinct patterns for implementing mobility, explaining their generality and applicability. We also employ formal verification to show that different instances of the patterns, used for different purposes in a network architecture, compose without alteration or interference. This result applies to all real implementations that are refinements of the patterns. | en_US |
dc.format.extent | 68 - 87 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Working Conference on Verified Software: Theories, Tools, and Experiments | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Compositional Network Mobility | en_US |
dc.type | Conference Article | en_US |
dc.identifier.doi | 10.1007/978-3-642-54108-7_4 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CompositionalNetworkMobility.pdf | 2.24 MB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.