skip to main content
10.1145/2527269.2527279acmconferencesArticle/Chapter ViewAbstractPublication PagesadaConference Proceedingsconference-collections
research-article

Bringing safe, dynamic parallel programming to the spark verifiable subset of ada

Published:10 November 2013Publication History

ABSTRACT

SPARK is a verifiable subset of Ada which has been in use for over 20 years for developing the most critical parts of complex real-time applications [1][2]. A restricted subset of the Ada tasking model is included in the newer versions of SPARK ("RavenSPARK"), but this is a very static model, with a fixed number of tasks and minimal task interaction [3]. In this presentation we will describe an extension of SPARK to support safe highly parallel programming, targeted at the growing number of multicore and manycore processors appearing on the market today.

References

  1. Chapman, R., Industrial experience with SPARK, Ada Letters. XX(4), 64--68 (2000). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. O'Neill, I. et al, The Formal Semantics of SPARK83, Program Validation Limited 1994.Google ScholarGoogle Scholar
  3. SPARK Team, SPARK Examiner, The SPARK Ravenscar Profile, Praxis, 2008, available at: http://intelligent-systems.altran.com/fileadmin/medias/0.commons/documents/Technology_documents/examiner_ravenscar.pdf (retrieved 8/2013).Google ScholarGoogle Scholar
  4. Sparkel web site, http://www.sparkel.org .Google ScholarGoogle Scholar
  5. Taft, S. Tucker, ParaSail: Less is More with Multicore, www.embedded.com, 2012, available at http://www.embedded.com/design/other/4375616/ParaSail-Less-is-more-with-multicore (retrieved 9/23/2013).Google ScholarGoogle Scholar
  6. Wirth, Niklaus, Algorithms + Data Structures = Programs, Prentice-Hall, ISBN 0-13-022418-9, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Bringing safe, dynamic parallel programming to the spark verifiable subset of ada

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
                November 2013
                100 pages
                ISBN:9781450324670
                DOI:10.1145/2527269

                Copyright © 2013 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 10 November 2013

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

                Acceptance Rates

                HILT '13 Paper Acceptance Rate9of17submissions,53%Overall Acceptance Rate27of48submissions,56%
              • Article Metrics

                • Downloads (Last 12 months)2
                • Downloads (Last 6 weeks)0

                Other Metrics

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader