{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:02:49Z","timestamp":1776304969920,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,18]]},"DOI":"10.1145\/3395363.3397367","type":"proceedings-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T21:44:18Z","timestamp":1594676658000},"page":"428-439","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A programming model for semi-implicit parallelization of static analyses"],"prefix":"10.1145","author":[{"given":"Dominik","family":"Helm","sequence":"first","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"given":"Florian","family":"K\u00fcbler","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"given":"Jan Thomas","family":"K\u00f6lzer","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"given":"Philipp","family":"Haller","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}]},{"given":"Michael","family":"Eichberg","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"given":"Guido","family":"Salvaneschi","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"given":"Mira","family":"Mezini","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ACTORS-A Model of Concurrent Computation in Distributed Systems","author":"Agha Gul A."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3088515.3088522"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2259051.2259052"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_3_2_1_5_1","unstructured":"DoopBenchmarks [n.d.]. Doop Benchmarks. https:\/\/bitbucket.org\/yanniss\/doopbenchmarks. DoopBenchmarks [n.d.]. Doop Benchmarks. https:\/\/bitbucket.org\/yanniss\/doopbenchmarks."},{"key":"e_1_3_2_1_6_1","first-page":"113","volume-title":"Lattice Based Modularization of Static Analyses. In Companion Proceedings for the ISSTA\/ECOOP 2018 Workshops (ISSTA'18)","author":"Eichberg M."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258973"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/506315.506316"},{"key":"e_1_3_2_1_9_1","first-page":"2","volume-title":"Codequest: Scalable Source Code Queries with Datalog. In European Conference on Object-Oriented Programming (ECOOP'06)","author":"Hajiyev Elnar","year":"2006"},{"key":"e_1_3_2_1_10_1","first-page":"11","article-title":"Reactive Async: Expressive Deterministic Concurrency. In SCALA@SPLASH","author":"Haller Philipp","year":"2016","journal-title":"ACM"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Philipp Haller and Heather Miller. 2019. A Reduction Semantics for Direct-Style Asynchronous Observables. J. Log. Algebr. Meth. Program. 105 ( 2019 ) 75-111. Philipp Haller and Heather Miller. 2019. A Reduction Semantics for Direct-Style Asynchronous Observables. J. Log. Algebr. Meth. Program. 105 ( 2019 ) 75-111.","DOI":"10.1016\/j.jlamp.2019.03.002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.019"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291192"},{"key":"e_1_3_2_1_14_1","first-page":"340","article-title":"A Unified Lattice Model and Framework for Purity Analyses","author":"Helm Dominik","year":"2018","journal-title":"ASE. ACM"},{"key":"e_1_3_2_1_15_1","unstructured":"Heros [n.d.]. Heros IFDS \/IDE Solver. https:\/\/github.com\/Sable\/heros. Heros [n.d.]. Heros IFDS \/IDE Solver. https:\/\/github.com\/Sable\/heros."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1624775.1624804"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1504176.1504181","article-title":"How much Parallelism is there in Irregular Applications?","author":"Kulkarni Milind","year":"2009","journal-title":"PPoPP. ACM"},{"key":"e_1_3_2_1_18_1","first-page":"211","article-title":"Optimistic Parallelism Requires Abstractions","author":"Kulkarni Milind","year":"2007","journal-title":"PLDI. ACM"},{"key":"e_1_3_2_1_19_1","volume-title":"Newton","author":"Kuper Lindsey","year":"2014"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635878"},{"key":"e_1_3_2_1_21_1","first-page":"194","article-title":"From Datalog to Flix","author":"Madsen Magnus","year":"2016","journal-title":"A Declarative Language for Fixed Points on Lattices. In PLDI. ACM"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2833109"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596563"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1900160.1900173"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145831"},{"key":"e_1_3_2_1_26_1","first-page":"428","article-title":"Parallel Inclusion-Based Points-to Analysis","author":"M\u00e9ndez-Lojo Mario","year":"2010","journal-title":"OOPSLA. ACM"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640091"},{"key":"e_1_3_2_1_28_1","unstructured":"Opal [n.d.]. OPAL. https:\/\/github.com\/stg-tud\/opal. Opal [n.d.]. OPAL. https:\/\/github.com\/stg-tud\/opal."},{"key":"e_1_3_2_1_29_1","volume-title":"Hall","author":"Prabhu Tarun","year":"2011"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330555"},{"key":"e_1_3_2_1_31_1","volume-title":"Systematic Evaluation of the Unsoundness of Call Graph Construction Algorithms for Java. In Companion Proceedings for the ISSTA\/ECOOP 2018 Workshops. ACM, 107-112","author":"Reif Michael","year":"2018"},{"key":"e_1_3_2_1_32_1","first-page":"49","article-title":"Precise Interprocedural Dataflow Analysis via Graph Reachability","author":"Reps Thomas W.","year":"1995","journal-title":"POPL. ACM"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","volume-title":"Actor-Based Parallel Dataflow Analysis","author":"Rodriguez Jonathan","DOI":"10.1007\/978-3-642-19861-8_11"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596596"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2577080.2577083"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884815"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892226"},{"key":"e_1_3_2_1_38_1","volume-title":"Karim Ali, and Eric Bodden.","author":"Sp\u00e4th Johannes","year":"2016"},{"key":"e_1_3_2_1_39_1","unstructured":"Wala [n.d.]. Wala. http:\/\/wala.sourceforge.net. Wala [n.d.]. Wala. http:\/\/wala.sourceforge.net."},{"key":"e_1_3_2_1_40_1","volume-title":"Using Datalog with Binary Decision Diagrams for Program Analysis. In Asian Symposium on Programming Languages and Systems. Springer, 97-118","author":"Whaley John","year":"2005"},{"key":"e_1_3_2_1_41_1","first-page":"131","volume-title":"Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation (PLDI'04)","author":"Whaley John"}],"event":{"name":"ISSTA '20: 29th ACM SIGSOFT International Symposium on Software Testing and Analysis","location":"Virtual Event USA","acronym":"ISSTA '20","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3395363.3397367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3395363.3397367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:35Z","timestamp":1750199915000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3395363.3397367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,18]]},"references-count":41,"alternative-id":["10.1145\/3395363.3397367","10.1145\/3395363"],"URL":"https:\/\/doi.org\/10.1145\/3395363.3397367","relation":{},"subject":[],"published":{"date-parts":[[2020,7,18]]},"assertion":[{"value":"2020-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}