{"id":"https://openalex.org/W2013497748","doi":"https://doi.org/10.1145/2527269.2527279","title":"Bringing safe, dynamic parallel programming to the spark verifiable subset of ada","display_name":"Bringing safe, dynamic parallel programming to the spark verifiable subset of ada","publication_year":2013,"publication_date":"2013-11-10","ids":{"openalex":"https://openalex.org/W2013497748","doi":"https://doi.org/10.1145/2527269.2527279","mag":"2013497748"},"language":"en","primary_location":{"id":"doi:10.1145/2527269.2527279","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2527269.2527279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023671470","display_name":"S. Tucker Taft","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S. Tucker Taft","raw_affiliation_strings":["AdaCore, Lexington, MA, USA","AdaCore, Lexington, MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"AdaCore, Lexington, MA, USA","institution_ids":[]},{"raw_affiliation_string":"AdaCore, Lexington, MA, USA#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023671470"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08508169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.9032355546951294},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.8815745115280151},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.8034814596176147},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6473720669746399},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6315330266952515},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.6072860956192017},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.48262009024620056},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.393069863319397}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9032355546951294},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.8815745115280151},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.8034814596176147},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6473720669746399},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6315330266952515},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.6072860956192017},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.48262009024620056},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.393069863319397},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2527269.2527279","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2527269.2527279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5199999809265137,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2003494253","https://openalex.org/W2041466536"],"related_works":["https://openalex.org/W1542410906","https://openalex.org/W197049984","https://openalex.org/W1993191611","https://openalex.org/W2023938924","https://openalex.org/W2918840249","https://openalex.org/W1991859582","https://openalex.org/W2110053126","https://openalex.org/W2104702637","https://openalex.org/W2079303253","https://openalex.org/W4248099758"],"abstract_inverted_index":{"SPARK":[0,42,71],"is":[1,35,46],"a":[2,47,52],"verifiable":[3],"subset":[4,29],"of":[5,22,30,41,55,70,83],"Ada":[6,32],"which":[7],"has":[8],"been":[9],"in":[10,37],"use":[11],"for":[12,16],"over":[13],"20":[14],"years":[15],"developing":[17],"the":[18,31,38,80,90],"most":[19],"critical":[20],"parts":[21],"complex":[23],"real-time":[24],"applications":[25],"[1][2].":[26],"A":[27],"restricted":[28],"tasking":[33],"model":[34],"included":[36],"newer":[39],"versions":[40],"(\"RavenSPARK\"),":[43],"but":[44],"this":[45,63],"very":[48],"static":[49],"model,":[50],"with":[51],"fixed":[53],"number":[54,82],"tasks":[56],"and":[57,85],"minimal":[58],"task":[59],"interaction":[60],"[3].":[61],"In":[62],"presentation":[64],"we":[65],"will":[66],"describe":[67],"an":[68],"extension":[69],"to":[72],"support":[73],"safe":[74],"highly":[75],"parallel":[76],"programming,":[77],"targeted":[78],"at":[79],"growing":[81],"multicore":[84],"manycore":[86],"processors":[87],"appearing":[88],"on":[89],"market":[91],"today.":[92]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}