SIGN IN
SIGN UP
A proof-based approach to verifying reachability properties
Full Text:
PDF
Buy this Article
Authors:
Amel Mammar
Institut Telecom SudParis, CNRS/SAMOVAR, Evry Cedex
Marc Frappier
Université de Sherbrooke(Québec), Canada
Fama Diagne
Institut Telecom SudParis, CNRS/SAMOVAR, Evry Cedex
Published in:
· Proceeding
SAC '11
Proceedings of the 2011 ACM Symposium on Applied Computing
Pages 1651-1657
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0113-8
doi>
10.1145/1982185.1982531
2011 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 16
· Downloads (cumulative): 31
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
b language
ctl formulas
design
experimentation
mathematical logic
measurement
performance
proof obligations
reachability properties
theory
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