A alternate form of the “UNCOL diagram”

Bratman, Harvey

doi:10.1145/366199.366249

Cited by 27 publications

(11 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tombstone diagrams (also called T-diagrams) are a graphical notation for reasoning about translators (compilers), first introduced in [3] and extended with interpreters and machines in [6]. T-diagrams are most commonly used to describe bootstrapping, cross-compilation, and other processes that require executing complex chains of compilers, interpreters, and machines [20].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Bootstrapping domain-specific meta-languages in language workbenches

2016

View full text Add to dashboard Cite

It is common practice to bootstrap compilers of programming languages. By using the compiled language to implement the compiler, compiler developers can code in their own high-level language and gain a large-scale test case. In this paper, we investigate bootstrapping of compiler-compilers as they occur in language workbenches. Language workbenches support the development of compilers through the application of multiple collaborating domain-specific meta-languages for defining a language's syntax, analysis, code generation, and editor support. We analyze the bootstrapping problem of language workbenches in detail, propose a method for sound bootstrapping based on fixpoint compilation, and show how to conduct breaking meta-language changes in a bootstrapped language workbench. We have applied sound bootstrapping to the Spoofax language workbench and report on our experience.

show abstract

Section: Related Workmentioning

confidence: 99%

“…it provides a large-scale test case for detecting defects in the compiler and the compiled language, 3. it shows that the language's coverage is sufficient to implement itself, and 4. compiler improvements such as better static analysis or the generation of faster code applies to all compiled programs, including the compiler itself.…”

Section: Introductionmentioning

confidence: 99%

Bootstrapping domain-specific meta-languages in language workbenches

2016

View full text Add to dashboard Cite

show abstract

“…Consider the sequence of root schemas: root.1.0.xsd, root.2.0.xsd, ... We write a simple temporal bundle for these and invoke the Squash utility, which produces a single temporal document, tv snapshot.xml which is then referenced by multiple <?xml version="1.0" encoding="UTF-8"?> <temporalBundle xmlns="http://www.cs.arizona.edu/tau/tauXSchema/TBSchema" xmlns:tv="http://www.cs.arizona.edu/tau/tauXSchema/TVSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.cs.arizona.edu/tau/tauXSchema/TBSchema"> <format plugin="XMLSchema" granularity="date"/> <bundleSequence defaultTemporalAnnotation="defaultTA.xml" defaultPhysicalAnnotation="defaultPA.xml"> <schemaAnnotation snapshotSchema="root.xsd" temporalAnnotation="temp_anno.xml" physicalAnnotation="phy_anno.xml"> </schemaAnnotation> </bundleSequence> </temporalBundle> This rather involved state of affairs, with time-varying documents and timevarying schemas, is illustrated with a T Diagram in Figure 7. In this notation, first described over forty years ago [4], the input of a translator is given on the left arm of the "T" (for example, for SchemaMapper in the upper right-hand-side of the figure, the input is the logical schema document, bundle.xml), the name of the translator is given at the base of the "T" (here, "Schema Mapper"), and the output of the translator is given on the right arm of the "T" (here, a representational schema, rep.xsd). The name of these diagrams was to the best of our knowledge given by McKeeman, Horning, and Wortman in their classic compiler book [17].…”

Section: Supporting Versioned Schemasmentioning

confidence: 99%

Validating quicksand: Temporal schema versioning in τXSchema

Snodgrass

Dyreson

Currim

et al. 2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

The W3C XML Schema recommendation defines the structure and data types for XML documents, but lacks explicit support for time-varying XML documents or for a time-varying schema. In previous work we introduced τ XSchema which is an infrastructure and suite of tools to support the creation and validation of time-varying documents, without requiring any changes to XML Schema. In this paper we extend τ XSchema to support versioning of the schema itself. We introduce the concept of a bundle, which is an XML document that references a base (non-temporal) schema, temporal annotations describing how the document can change, and physical annotations describing where timestamps are placed. When the schema is versioned, the base schema and temporal and physical schemas can themselves be time-varying documents, each with their own (possibly versioned) schemas. We describe how the validator can be extended to validate documents in this seeming precarious situation of data that changes over time, while its schema and even its representation are also changing.

show abstract

“…The simplest CCA may be viewed as another form of theory of T-diagrams from [5], and implicitly present in [7], which has been further developed in [6]. Similar work appeared in [1].…”

Section: Scope Of Ccamentioning

confidence: 99%

“…Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]. Machine functions describe the operation of a machine at a very abstract level.…”

mentioning

confidence: 99%

Machine Function Based Control Code Algebras

Bergstra

2004

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]. Machine functions describe the operation of a machine at a very abstract level. A theory of hardware and software based on machine functions may be called a machine function theory, or alternatively when focusing on inputs and outputs for machine functions a control code algebra (CCA). In this paper we develop some control code algebras from first principles. Machine function types are designed specifically for various application such as program compilation, assembly, interpretation, managed interpretation and just-in-time compilation. Machine function dependent CCA's are used to formalize the well-known compiler fixed point, the managed execution of JIT compiled text and the concept of a verifying compiler.

show abstract

A alternate form of the “UNCOL diagram”

Cited by 27 publications

References 1 publication

Bootstrapping domain-specific meta-languages in language workbenches

Bootstrapping domain-specific meta-languages in language workbenches

Validating quicksand: Temporal schema versioning in τXSchema

Machine Function Based Control Code Algebras

Contact Info

Product

Resources

About