Dual Syntax for XML Languages

Brabrand, Claus; Möller, Anders; Schwartzbach, Michael I.

doi:10.1007/11601524_2

Cited by 26 publications

(21 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This suggest that increasing the working memory might enable exhaustive enumerations of larger sizes. Note that in case of heap arrays of size above 10 (and sorted lists [1]), run times include garbage collection overheads 5 . In those benchmarks we selectively turned off memoization for bigger data structure sizes (by providing an alternative memoization trait to an existing enumerator).…”

Section: Exhaustive Generation Of Data Structuresmentioning

confidence: 99%

“…We present only the case of sorted 5 there are more than 10 8 heaps of size 10, storing just pointers to their roots can thus take more than 4GB of memory Table 4: Performance of generating graph structures. Times are given in seconds; notation is as in Table 3.…”

Section: Feature Breakdownmentioning

confidence: 99%

“…The idea of inverting programs has been explored in the general context [2,36,41] and applied to specific format transformations [5,26,27]. Relation-driven programming [5,27] focuses on bidirectional transformations between different structures given with textual representation. While SciFe can invert enumeration, unlike [26,27,36], it focuses on avoiding unnecessary search with expressiveness of dependent enumeration.…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, its combinators impose a structure that is leveraged to invert a given value deterministically (to a unique index), without backtracking (as in [36]). Ambiguity in SciFe is only allowed explicitly, rather than with ambiguous grammars [5,27]: a dependent enumerator can be parametrized to encode, and thus recognize, different sets of structures.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Programming with enumerable sets of structures

Kuraj

Kunčak

Jackson

2015

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applicatio

View full text Add to dashboard Cite

We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, and memoized enumeration from not only finite but also infinite domains, while providing fine-grained control over the process. Furthermore, the framework efficiently supports the inverse of enumeration (checking whether a structure can be generated and fast-forwarding to this structure to continue the enumeration) and lazy enumeration (achieving exhaustive testing without generating all structures). The foundation of efficient enumeration lies in both direct access to encoded structures, achieved with well-known and new pairing functions, and dependent enumeration, which embeds constraints into the enumeration to avoid backtracking. Our framework defines an algebra of enumerators, with combinators for their composition that preserve exhaustiveness and efficiency. We have implemented our framework as a domain-specific language in Scala. Our experiments demonstrate better performance and shorter specifications by up to a few orders of magnitude compared to existing approaches.

show abstract

Section: Exhaustive Generation Of Data Structuresmentioning

confidence: 99%

Section: Feature Breakdownmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Programming with enumerable sets of structures

Kuraj

Kunčak

Jackson

2015

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applicatio

View full text Add to dashboard Cite

show abstract

“…XSugar [1] provides bi-directional translation between XML documents and alternative syntaxes. Unlike JT, XSugar only preserves information that is present in both representations and otherwise normalizes documents to a canonical form.…”

Section: Bidirectional Translationmentioning

confidence: 99%

Multi-language Synchronization

Ennals

2007

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. We propose multi-language synchronization, a novel approach to the problem of migrating code from a legacy language (such as C) to a new language. We maintain two parallel versions of every source file, one in the legacy language, and one in the new language. Both of these files are fully editable, and the two files are kept automatically in sync so that they have the same semantic meaning and, where possible, have the same comments and layout.We propose non-deterministic language translation as a means to implement multi-language synchronization. If a file is modified in language A, we produce a new version in language B by translating the file into a non-deterministic description of many ways that it could be encoded in language B and then choosing the version that is closest to the old file in language B.To demonstrate the feasibility of this approach, we have implemented a translator that can synchronize files written in a straw-man language, Jekyll, with files written in C. Jekyll is a high level functional programming language that has many of the features found in modern programming languages.

show abstract

A visual XML dataspace approach for satisfying ad hoc information needs

Moilanen

Niemi

Näppilä

et al. 2015

Asso for Info Science & Tech

View full text Add to dashboard Cite

Dataspace systems constitute a recent data management approach that supports better cooperation among autonomous and heterogeneous data sources with which the user is initially unfamiliar. A central idea is to gradually increase the user's knowledge about the contents, structures, and semantics of the data sources in the dataspace. Without this knowledge, the user is not able to make sophisticated queries. The dataspace systems proposed so far are usually application specific. In contrast, our idea in this paper is to develop an application-independent extensible markup language (XML) dataspace system with versatile facilities. Unlike the other proposed dataspace systems, we show that it is possible to build an interface based on conventional visual tools in terms of which the user can satisfy his or her sophisticated information needs. In our system, the user does not need to master programming techniques nor the XML syntax, which provides a good starting point for its declarative use.

show abstract

Dual Syntax for XML Languages

Cited by 26 publications

References 11 publications

Programming with enumerable sets of structures

Programming with enumerable sets of structures

Multi-language Synchronization

A visual XML dataspace approach for satisfying ad hoc information needs

Contact Info

Product

Resources

About