SIGN IN
SIGN UP
Formal network packet processing with minimal fuss: invertible syntax descriptions at work
Full Text:
PDF
Buy this Article
Authors:
Reynald Affeldt
National Institute of Advanced Industrial Science and Technology, Tsukuba, Japan
David Nowak
National Institute of Advanced Industrial Science and Technology, Tsukuba, Japan
Yutaka Oiwa
National Institute of Advanced Industrial Science and Technology, Tsukuba, Japan
Published in:
· Proceeding
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Pages 27-36
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-1125-0
doi>
10.1145/2103776.2103781
2012 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 46
· Downloads (cumulative): 79
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
POPL '14
Share:
|
Tags:
applicative languages
coq
data-dependent grammar
internet protocol
languages
parsing and pretty-printing
protocol verification
standardization
type classes
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder