메뉴 건너뛰기




Volumn 4353 LNCS, Issue , 2006, Pages 254-268

Exact XML type checking in polynomial time

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC AUTOMATA; DOCUMENT TRANSFORMATION; NEW APPROACHES; POLYNOMIAL-TIME; TREE TRANSDUCERS; TYPE INFERENCES; TYPECHECKING; WORST-CASE COMPLEXITY;

EID: 84878740286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_18     Document Type: Conference Paper
Times cited : (35)

References (28)
  • 4
    • 0001218274 scopus 로고    scopus 로고
    • Context-free graph grammars
    • G. Rozenberg and A. Salomaa, editors Springer-Verlag, Berlin
    • J. Engelfriet. Context-Free Graph Grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, pages 125-213. Springer-Verlag, Berlin, 1997.
    • (1997) Handbook of Formal Languages , pp. 125-213
    • Engelfriet, J.1
  • 5
    • 0001975506 scopus 로고    scopus 로고
    • Macro tree transducers, attribute grammars, and MSO definable tree translations
    • J. Engelfriet and S. Maneth. Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inform. and Comput., 154(1):34-91, 1999.
    • (1999) Inform. and Comput. , vol.154 , Issue.1 , pp. 34-91
    • Engelfriet, J.1    Maneth, S.2
  • 6
    • 0042283028 scopus 로고    scopus 로고
    • A comparison of pebble tree transducers with macro tree transducers
    • J. Engelfriet and S. Maneth. A Comparison of Pebble Tree Transducers with Macro Tree Transducers. Acta Informatica, 39:613-698, 2003.
    • (2003) Acta Informatica , vol.39 , pp. 613-698
    • Engelfriet, J.1    Maneth, S.2
  • 10
    • 84878740081 scopus 로고    scopus 로고
    • Regular tree language recognition with static information
    • A. Frisch. Regular Tree Language Recognition with Static Information. In PLAN-X, 2004.
    • (2004) PLAN-X
    • Frisch, A.1
  • 11
    • 29144439324 scopus 로고    scopus 로고
    • Parametric polymorphism for XML
    • ACM Press
    • H. Hosoya, A. Frisch, and G. Castagna. Parametric Polymorphism for XML. In POPL, pages 50-62. ACM Press, 2005.
    • (2005) POPL , pp. 50-62
    • Hosoya, H.1    Frisch, A.2    Castagna, G.3
  • 12
    • 0242636425 scopus 로고    scopus 로고
    • Regular expression pattern matching for XML
    • H. Hosoya and B.C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 13(6):961-1004, 2002.
    • (2002) Journal of Functional Programming , vol.13 , Issue.6 , pp. 961-1004
    • Hosoya, H.1    Pierce, B.C.2
  • 13
    • 1442286447 scopus 로고    scopus 로고
    • XDuce: A statically typed XML processing language
    • H. Hosoya and B.C. Pierce. XDuce: A Statically Typed XML Processing Language. ACM Trans. Inter. Tech., 3(2):117-148, 2003.
    • (2003) ACM Trans. Inter. Tech. , vol.3 , Issue.2 , pp. 117-148
    • Hosoya, H.1    Pierce, B.C.2
  • 15
    • 33244476060 scopus 로고    scopus 로고
    • XML type checking with macro tree transducers
    • ACM Press
    • S. Maneth, A. Berlea, T. Perst, and H. Seidl. XML Type Checking with Macro Tree Transducers. In PODS, pages 283-294. ACM Press, 2005.
    • (2005) PODS , pp. 283-294
    • Maneth, S.1    Berlea, A.2    Perst, T.3    Seidl, H.4
  • 16
    • 3142708631 scopus 로고    scopus 로고
    • Frontiers of tractability for typechecking simple XML transformations
    • ACM Press
    • W. Martens and F. Neven. Frontiers of Tractability for Typechecking Simple XML Transformations. In PODS, pages 23-34. ACM Press, 2004.
    • (2004) PODS , pp. 23-34
    • Martens, W.1    Neven, F.2
  • 17
    • 18144400980 scopus 로고    scopus 로고
    • On the complexity of typechecking top-down xml transformations
    • W. Martens and F. Neven. On the complexity of typechecking top-down xml transformations. Theor. Comput. Sci., 336:153-180, 2005.
    • (2005) Theor. Comput. Sci. , vol.336 , pp. 153-180
    • Martens, W.1    Neven, F.2
  • 18
  • 20
    • 77049092342 scopus 로고    scopus 로고
    • The design space of type checkers for XML transformation languages
    • Springer-Verlag
    • A. Møller and M. I. Schwartzbach. The Design Space of Type Checkers for XML Transformation Languages. In ICDT, pages 17-36. Springer-Verlag, 2005.
    • (2005) ICDT , pp. 17-36
    • Møller, A.1    Schwartzbach, M.I.2
  • 21
    • 0038207893 scopus 로고    scopus 로고
    • Taxonomy of XML schema languages using formal language theory
    • M. Murata, D. Lee, and M. Mani. Taxonomy of XML Schema Languages using Formal Language Theory. In Extreme Markup Languages, 2000.
    • (2000) Extreme Markup Languages
    • Murata, M.1    Lee, D.2    Mani, M.3
  • 22
    • 0038180542 scopus 로고    scopus 로고
    • Automata theory for XML researchers
    • F. Neven. Automata Theory for XML Researchers. SIGMOD Record, 31(3):39-46, 2002.
    • (2002) SIGMOD Record , vol.31 , Issue.3 , pp. 39-46
    • Neven, F.1
  • 23
    • 0347985113 scopus 로고    scopus 로고
    • Macro forest transducers
    • T. Perst and H. Seidl. Macro Forest Transducers. Inf. Proc. Letters, 89:141-149, 2004.
    • (2004) Inf. Proc. Letters , vol.89 , pp. 141-149
    • Perst, T.1    Seidl, H.2
  • 24
    • 34250498101 scopus 로고
    • Mappings and grammars on trees
    • W.C. Rounds. Mappings and Grammars on Trees. Math. Systems Theory, 4:257-287, 1970.
    • (1970) Math. Systems Theory , vol.4 , pp. 257-287
    • Rounds, W.C.1
  • 26
    • 0028523063 scopus 로고
    • Haskell overloading is DEXPTIME complete
    • H. Seidl. Haskell Overloading is DEXPTIME Complete. Inf. Proc. Letters, 52:57-60, 1994.
    • (1994) Inf. Proc. Letters , vol.52 , pp. 57-60
    • Seidl, H.1
  • 27
    • 84878680603 scopus 로고
    • Least solutions of equations over N
    • Springer
    • H. Seidl. Least Solutions of Equations over N. In ICALP, pages 400-411. Springer, 1994.
    • (1994) ICALP , pp. 400-411
    • Seidl, H.1
  • 28
    • 0003551091 scopus 로고    scopus 로고
    • second edition, 6 October
    • W3C. Extensible Markup Language (XML) 1.0, second edition, 6 October 2000. Available online http://www.w3.org/TR/2000/REC-xml-20001006.
    • (2000) Extensible Markup Language (XML) 1.0


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.