Parallel schedule synthesis for attribute grammars

Meyerovich, Leo A.; Torok, Matthew E.; Atkinson, Eric; Bodík, Rastislav

doi:10.1145/2517327.2442535

Cited by 5 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note Comfusy [15] and Mjollnir [20]. We used the Superconductor attribute grammar scheduler [19] to compile L-solvers to (sequential) tree traversals. The resulting traversals are implemented in JavaScript and operate directly on the browser DOM.…”

Section: Discussionmentioning

confidence: 99%

“…We guarantee that the resulting functional attribute grammars are always statically schedulable. Such attribute grammars are compilable to efficient tree traversals [19]. In contrast with the backtracking search employed by general-purpose constraint solvers, our layout engines perform only value propagations and function applications.…”

Section: Synthesis Of Layout Enginesmentioning

confidence: 99%

“…In general, our formalism is too abstract to model important execution characteristics like cache locality or parallelization opportunities. We throw away the schedule found and delegate this task to a dedicated attribute grammar scheduler [19].…”

mentioning

confidence: 99%

See 2 more Smart Citations

The Emperor's New Password Manager: Security Analysis of Web-based Password Managers

Akhawe

et al. 2014

View full text Add to dashboard Cite

Synthesis is the problem of obtaining programs from relational specifications. We present grammar-modular (GM) synthesis, an algorithm for synthesis from tree-structured relational specifications. GM synthesis makes synthesis applicable to previously intractable relational specifications by decomposing them into smaller subproblems, which can be tackled in isolation by off-the-shelf synthesis procedures. The program fragments thus generated are subsequently composed to form a program satisfying the overall specification. We also generalize our technique to tree languages of relational specifications. Here, we synthesize a single program capable satisfying any (tree-shaped) relation belonging to the language; the synthesized program is syntax-directed by the structure of the relation. We evaluate our work by applying GM synthesis to document layout: given the semantics of a layout language, we synthesize tailored constraint solvers capable of laying out languages of documents. Our experiments show that GM synthesis is sufficiently complete to successfully generate solvers for non-trivial data visualizations, and that our synthesized solvers are between 39-to 200-times faster than general-purpose constraint solvers.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Synthesis Of Layout Enginesmentioning

confidence: 99%

See 1 more Smart Citation

The Emperor's New Password Manager: Security Analysis of Web-based Password Managers

Akhawe

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Program Synthesis. Synthesis techniques have been successfully applied to a wide variety of problems, including compilation for ultra low power spatial architectures [27]; generation of high-performance data-parallel code [36,39]; generation of efficient web layout engines [24]; education [1]; and end-user programming [11].…”

Section: Related Workmentioning

confidence: 99%

Optimizing synthesis with metasketches

Bornholt

Torlak

Grossman

et al. 2016

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Many advanced programming tools-for both end-users and expert developers-rely on program synthesis to automatically generate implementations from high-level specifications. These tools often need to employ tricky, custom-built synthesis algorithms because they require synthesized programs to be not only correct, but also optimal with respect to a desired cost metric, such as program size. Finding these optimal solutions efficiently requires domain-specific search strategies, but existing synthesizers hard-code the strategy, making them difficult to reuse. This paper presents metasketches, a general framework for specifying and solving optimal synthesis problems. Metasketches make the search strategy a part of the problem definition by specifying a fragmentation of the search space into an ordered set of classic sketches. We provide two cooperating search algorithms to effectively solve metasketches. A global optimizing search coordinates the activities of local searches, informing them of the costs of potentially-optimal solutions as they explore different regions of the candidate space in parallel. The local searches execute an incremental form of counterexample-guided inductive synthesis to incorporate information sent from the global search. We present SYNAPSE, an implementation of these algorithms, and show that it effectively solves optimal synthesis problems with a variety of different cost functions. In addition, metasketches can be used to accelerate classic (non-optimal) synthesis by explicitly controlling the search strategy, and we show that SYNAPSE solves classic synthesis problems that state-of-the-art tools cannot.

show abstract

“…In natural language processing, many efforts have been put to CYK [Kasami 1965;Younger 1966;Yi et al 2011] and Earley [1970] parsing algorithms. A recent work has examined how to synthesize a parallel schedule of structured traversals over trees, offering some help for parallel CSS processing [Meyerovich et al 2013]. These previous studies have laid the foundation for this work.…”

Section: Parallel Parsingmentioning

confidence: 99%

HPar

Zhao

Bebenita

Herman

et al. 2013

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Parallelizing HTML parsing is challenging due to the complexities of HTML documents and the inherent dependencies in its parsing algorithm. As a result, despite numerous studies in parallel parsing, HTML parsing remains sequential today. It forms one of the final barriers for fully parallelizing browser operations to minimize the browser's response time-an important variable for user experiences, especially on portable devices. This article provides a comprehensive analysis on the special complexities of parallel HTML parsing and presents a systematic exploration in overcoming those difficulties through specially designed speculative parallelizations. This work develops, to the best of our knowledge, the first pipelining and data-level parallel HTML parsers. The data-level parallel parser, named HPar, achieves up to 2.4× speedup on quadcore devices. This work demonstrates the feasibility of efficient, parallel HTML parsing for the first time and offers a set of novel insights for parallel HTML parsing

show abstract

Parallel schedule synthesis for attribute grammars

Cited by 5 publications

References 27 publications

The Emperor's New Password Manager: Security Analysis of Web-based Password Managers

The Emperor's New Password Manager: Security Analysis of Web-based Password Managers

Optimizing synthesis with metasketches

HPar

Contact Info

Product

Resources

About