From Network Interface to Multithreaded Web Applications: A Case Study in Modular Program Verification
Name
Chlipala_From Network.pdf
Size
465.84 KB
Format
Adobe PDF
Checksum (MD5)
93d9ead69e718f447ea09b1ae7d67837
Author(s)
Chlipala, Adam
Date Issued
January 2014
Journal
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '15
Publisher
Association for Computing Machinery
Citation
Chlipala, Adam. "From Network Interface to Multithreaded Web Applications: A Case Study in Modular Program Verification." POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Mumbai, India, January 12-18, 2015, ACM, 2014.
Version
Author's final manuscript
Abstract
Many verifications of realistic software systems are monolithic, in the sense that they define single global invariants over complete system state. More modular proof techniques promise to support reuse of component proofs and even reduce the effort required to verify one concrete system, just as modularity simplifies standard software development. This paper reports on one case study applying modular proof techniques in the Coq proof assistant. To our knowledge, it is the first modular verification certifying a system that combines infrastructure with an application of interest to end users. We assume a nonblocking API for managing TCP networking streams, and on top of that we work our way up to certifying multithreaded, database-backed Web applications. Key verified components include a cooperative threading library and an implementation of a domain-specific language for XML processing. We have deployed our case-study system on mobile robots, where it interfaces with off-the-shelf components for sensing, actuation, and control.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
http://dl.acm.org/citation.cfm?id=2676726
