scientific article; zbMATH DE number 1953123
From MaRDI portal
Publication:4414525
Recommendations
- Efficient constraint validation for updated XML databases
- Sublinear DTD validity
- Validating XML documents in the streaming model with external memory
- Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)
- Updates, schema updates and validation of XML documents -- using abstract state machines with automata-defined states
Cited in
(30)- Which XML schemas are streaming bounded repairable?
- Sublinear DTD validity
- Environment classifiers
- Bigraphs and transitions
- The M-calculus: a higher-order distributed process calculus
- A generic approach to the static analysis of concurrent programs with procedures
- Discovering affine equalities using random interpretation
- Bitwidth aware global register allocation
- Folklore confirmed
- New results on the computability and complexity of points-to analysis
- Incremental algorithms for dispatching in dynamically typed languages
- From control effects to typed continuation passing
- Coercive subtyping for the calculus of constructions (extended abstract)
- A type theory for memory allocation and data layout
- Static prediction of heap space usage for first-order functional programs
- Ownership types for object encapsulation
- Guarded recursive datatype constructors
- A type system for higher-order modules
- Pure patterns type systems
- Validating XML documents in the streaming model with external memory
- Efficient constraint validation for updated XML databases
- Updates, schema updates and validation of XML documents -- using abstract state machines with automata-defined states
- scientific article; zbMATH DE number 1947748 (Why is no real title available?)
- scientific article; zbMATH DE number 1930138 (Why is no real title available?)
- Validating XML document adaptations via hedge automata transformations
- Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)
- On the complexity of typechecking top-down XML transformations
- Enumeration for FO Queries over Nowhere Dense Graphs
- Efficient algorithms for isomorphisms of simple types
- Frontiers of tractability for typechecking simple XML transformations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414525)
