Synthesis from Recursive-Components Libraries

Synthesis is the automatic construction of a system from its specification. In classical synthesis algorithms it is always assumed that the system is "constructed from scratch" rather than composed from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial software system relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. In 2009 we introduced LTL synthesis from libraries of reusable components. Here, we extend the work and study synthesis from component libraries with "call and return"' control flow structure. Such control-flow structure is very common in software systems. We define the problem of Nested-Words Temporal Logic (NWTL) synthesis from recursive component libraries, where NWTL is a specification formalism, richer than LTL, that is suitable for "call and return" computations. We solve the problem, providing a synthesis algorithm, and show the problem is 2EXPTIME-complete, as standard synthesis.Comment: In Proceedings GandALF 2011, arXiv:1106.081

An experimental evaluation and possible extensions of SyPet

Program synthesis is an automated programming technique that automatically constructs a program which satisfies given specifications. SyPet is a recently published novel component-based synthesis tool that assembles a straight-line Java method body that invokes a sequence of methods from a given set of libraries to implement desired functionality that is defined by a given test suite. In this report, we experimentally evaluate the correctness and performance of the publicly available SyPet implementation, at the black-box level, focusing on the size of test suites. We then demonstrate how SyPet can be extended to support some other applications, such as synthesizing non-straight-line methods and program repair. Finally, we conjecture an alternative technique that is conceptually simpler for synthesizing straight-line methods and present a few initial experimental results.Electrical and Computer Engineerin

Bridging high-level synthesis to RTL technology libraries

The output of high-level synthesis typically consists of a netlist of generic RTL components and a state sequencing table. While module generators and logic synthesis tools can be used to map RTL components into standard cells or layout geometries, they cannot provide technology mapping into the data book libraries of functional RTL cells used commonly throughout the industrial design community. In this paper, we introduce an approach to implementing generic RTL components with technology-specific RTL library cells. This approach addresses the criticism of designers who feel that high-level synthesis tools should be used in conjunction with existing RTL data books. We describe how GENUS, a library of generic RTL components, is organized for use in high-level synthesis and how DTAS, a functional synthesis system, is used to map GENUS components into RTL library cells

High throughput methodology for synthesis, screening, and optimization of solid state Lithium ion electrolytes

A study of the lithium ion conductor Li3xLa2/3–xTiO3 solid solution and the surrounding composition space was carried out using a high throughput physical vapor deposition system. An optimum total ionic conductivity value of 5.45 × 10–4 S cm–1 was obtained for the composition Li0.17La0.29Ti0.54 (Li3xLa2/3–xTiO3x = 0.11). This optimum value was calculated using an artificial neural network model based on the empirical data. Due to the large scale of the data set produced and the complexity of synthesis, informatics tools were required to analyze the data. Partition analysis was carried out to determine the synthetic parameters of importance and their threshold values. Multivariate curve resolution and principal component analysis were applied to the diffraction data set. This analysis enabled the construction of phase distribution diagrams, illustrating both the phases obtained and the compositional zones in which they occur. The synthetic technique presented has significant advantages over other thin film and bulk methodologies, in terms of both the compositional range covered and the nature of the materials produce

CHASSIS : a combined hardware selection and scheduling technique for performance driven synthesis

This report describes a new technique that combines the Hardware Scheduling and Component Selection phases for High Level Synthesis. Our technique simultaneously selects components from a given library while it schedules the operations into different control steps. The algoríthm improves previous work in scheduling because component costs and performance are considered during the scheduling process, enlarging the design search space and resulting in better optimized desígns

Synthetic High-Resolution Line Spectra of Star-Forming Galaxies Below 1200A

We have generated a set of far-ultraviolet stellar libraries using spectra of OB and Wolf-Rayet stars in the Galaxy and the Large and Small Magellanic Cloud. The spectra were collected with the Far Ultraviolet Spectroscopic Explorer and cover a wavelength range from 1003.1 to 1182.7A at a resolution of 0.127A. The libraries extend from the earliest O- to late-O and early-B stars for the Magellanic Cloud and Galactic libraries, respectively. Attention is paid to the complex blending of stellar and interstellar lines, which can be significant, especially in models using Galactic stars. The most severe contamination is due to molecular hydrogen. Using a simple model for the H$_2$ line strength, we were able to remove the molecular hydrogen lines in a subset of Magellanic Cloud stars. Variations of the photospheric and wind features of CIII 1176, OVI 1032, 1038, PV 1118, 1128, and SIV 1063, 1073, 1074 are discussed as a function of temperature and luminosity class. The spectral libraries were implemented into the LavalSB and Starburst99 packages and used to compute a standard set of synthetic spectra of star-forming galaxies. Representative spectra are presented for various initial mass functions and star formation histories. The valid parameter space is confined to the youngest ages of less than 10 Myr for an instantaneous burst, prior to the age when incompleteness of spectral types in the libraries sets in. For a continuous burst at solar metallicity, the parameter space is not limited. The suite of models is useful for interpreting the restframe far-ultraviolet in local and high-redshift galaxies.Comment: 33 pages including 13 figures, accepted for publication in Ap

autoAx: An Automatic Design Space Exploration and Circuit Building Methodology utilizing Libraries of Approximate Components

Approximate computing is an emerging paradigm for developing highly energy-efficient computing systems such as various accelerators. In the literature, many libraries of elementary approximate circuits have already been proposed to simplify the design process of approximate accelerators. Because these libraries contain from tens to thousands of approximate implementations for a single arithmetic operation it is intractable to find an optimal combination of approximate circuits in the library even for an application consisting of a few operations. An open problem is "how to effectively combine circuits from these libraries to construct complex approximate accelerators". This paper proposes a novel methodology for searching, selecting and combining the most suitable approximate circuits from a set of available libraries to generate an approximate accelerator for a given application. To enable fast design space generation and exploration, the methodology utilizes machine learning techniques to create computational models estimating the overall quality of processing and hardware cost without performing full synthesis at the accelerator level. Using the methodology, we construct hundreds of approximate accelerators (for a Sobel edge detector) showing different but relevant tradeoffs between the quality of processing and hardware cost and identify a corresponding Pareto-frontier. Furthermore, when searching for approximate implementations of a generic Gaussian filter consisting of 17 arithmetic operations, the proposed approach allows us to identify approximately $10^3$ highly important implementations from $10^{23}$ possible solutions in a few hours, while the exhaustive search would take four months on a high-end processor.Comment: Accepted for publication at the Design Automation Conference 2019 (DAC'19), Las Vegas, Nevada, US