SIGN IN
SIGN UP
Graph-transformation verification using monadic second-order logic
Full Text:
PDF
Buy this Article
Authors:
Kazuhiro Inaba
National Institute of Informatics, Tokyo, Japan
Soichiro Hidaka
National Institute of Informatics, Tokyo, Japan
Zhenjiang Hu
National Institute of Informatics, Tokyo, Japan
Hiroyuki Kato
National Institute of Informatics, Tokyo, Japan
Keisuke Nakano
The University of Electro-Communications, Tokyo, Japan
2011 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 45
· Downloads (cumulative): 87
· Citation Count: 4
Published in:
· Proceeding
PPDP '11
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Pages 17-28
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0776-5
doi>
10.1145/2003476.2003482
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
graph transformation
languages
mechanical verification
monadic second-order logic
uncal
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