Ada is a general purpose programming language suitable for use in large applications and/or embedded real-time applications. However, its use in verification, i.e., the mathematical proof that a program's implementation is consistent with its specification, poses significant problems.One potential solution to this problem is to allow the integration of Ada software with other software that has been verified. The implications of integrating Ada with a verification language extend well beyond the technical challenge of developing language-heterogenous software systems. Not only must one implement a way to allow this integration, but one must do it in such a way as to not invalidate the underlying assumptions of the verification effort.The question as to whether it makes sense to integrate trusted (verified) and untrusted (Ada) software is addressed. The conclusion is that with proper decomposition, and the understanding that the goal is to verify specific properties and not entire programs, it is feasible to do this and still maintain the validity of the verification effort.Several integration approaches are presented. The most promising, separate processes communicating via remote procedure calls, is studied in more detail and a high level design for an implementation is described.
End of preview. The entire article is 8 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/interfacing-ada-with-verification-languages-jg8EIvHnsi
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Interfacing Ada with verification languages
Leeson, David; MacEwen, Glenn; Andrews, David
Follow ACM SIGAda Ada Letters
, Volume XIV (SI)
Association for Computing Machinery – Sep 1, 1994
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
