Array Folds Logic

Daca, Przemysław; Henzinger, Thomas A.; Kupriyanov, Andrey

doi:10.1007/978-3-319-41540-6_13

Cited by 14 publications

(13 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work is related to a long tradition of decision procedures for the theories of arrays [4,5,10,12,17,21]. Our direct inspiration is combinatory array logic [19].…”

Section: Related Workmentioning

confidence: 99%

“…In our study, we have given priority to those procedures that decide satisfiability within the NP complexity class. From these, [1] and [5] are the more closely related since they also address counting properties. The main difference with these works is that our index theory is arbitrary and that the element theory is any one in NP.…”

Section: Related Workmentioning

confidence: 99%

“…Decision procedures for arrays are therefore of paramount importance for deductive program verification. A number of results have examined fragments that strike interesting trade-offs between expressive power and complexity [4,5,10,12,17,21].…”

Section: Introductionmentioning

confidence: 99%

“…The result is a logic that can express cardinality constraints that hold componentwise. Unlike [5], the logic is independent of the component or the index theory. Our formalism shows that QFBAPA sets can be interpreted, overcoming a limitation pointed out in [1].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

NP Satisfiability for Arrays as Powers

Raya¹,

Kunčak²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Our work is related to a long tradition of decision procedures for the theories of arrays [4,5,10,12,17,21]. Our direct inspiration is combinatory array logic [19].…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

NP Satisfiability for Arrays as Powers

Raya¹,

Kunčak²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Casper then uses an off-the-shelf program synthesizer to perform the search, but it is guided by an incremental search algorithm and our domainspecific cost model to speed the process. A theorem prover is used to check whether the found program summary is indeed semantically arXiv:1801.09802v2 [cs.DB] 19 Jun 2018 equivalent to the input. Once proved, the summary is translated into the concrete syntax of the target MapReduce API.…”

Section: Introductionmentioning

confidence: 99%

Automatically Leveraging MapReduce Frameworks for Data-Intensive Applications

Ahmad

Cheung

2018

Proceedings of the 2018 International Conference on Management of Data

View full text Add to dashboard Cite

MapReduce is a popular programming paradigm for developing large-scale, data-intensive computation. Many frameworks that implement this paradigm have recently been developed. To leverage these frameworks, however, developers must become familiar with their APIs and rewrite existing code. We present Casper, a new tool that automatically translates sequential Java programs into the MapReduce paradigm. Casper identifies potential code fragments to rewrite and translates them in two steps: (1) Casper uses program synthesis to search for a program summary (i.e., a functional specification) of each code fragment. The summary is expressed using a high-level intermediate language resembling the MapReduce paradigm and verified to be semantically equivalent to the original using a theorem prover. (2) Casper generates executable code from the summary, using either the Hadoop, Spark, or Flink API. We evaluated Casper by automatically converting realworld, sequential Java benchmarks to MapReduce. The resulting benchmarks perform up to 48.2× faster compared to the original.We implemented Casper using the Polyglot framework [37] to parse Java code into an abstract syntax tree (AST). Casper traverses the program AST to identify candidate code fragments, performs program analysis, and generates target code. We now describe the Java features supported by our compiler front-end. We also discuss how Casper identifies code fragments for translation and generates executable code from the verified program summary.

show abstract

NP Satisfiability for Arrays as Powers

Raya

Kunčak

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our decomposition to obtain tight computational complexity bounds on the decision problem for this automata class and an extension that considers linear arithmetic constraints on the underlying effective Boolean algebra.

show abstract

Array Folds Logic

Cited by 14 publications

References 29 publications

NP Satisfiability for Arrays as Powers

NP Satisfiability for Arrays as Powers

Automatically Leveraging MapReduce Frameworks for Data-Intensive Applications

NP Satisfiability for Arrays as Powers

Contact Info

Product

Resources

About