Marrying- Words-and- Trees课件.pptVIP

Writing Program Specifications Intuition: Keeping track of context is easy; just skip using a summary edge Finite-state properties of paths, where a path can be a local path, a global path, or a mixture Sample regular properties: If p holds at a call, q should hold at matching return If x is being written, procedure P must be in call stack Within a procedure, an unlock must follow a lock All properties specifiable in standard temporal logics (LTL) * 。 Temporal Logic of Nested Time: CaRet Global paths, Local paths, Caller paths Three versions of every temporal modality Sample CaRet formulas: (if p then local-next q) global-unless r if p then caller-eventually q Global-always (if p then local-eventually q) * 。 So far: Nested words have appealing theoretical properties with possible applications Common framework: linear encoding using brackets/tags Coming up: How do finite nested words compare with ordered trees/hedges? * 。 Linear Encoding of Nested Words Nested word over S is encoded as a word over tagged alphabet S For each symbol a, call a, return a, internal a Two views are isomorphic: every word over S corresponds to a nested word over S Linear view useful for streaming, and word operations such as prefixes Number of nested words of length k: (3 |S|)k a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 * 。 Encoding Ordered Trees/Hedges a b x x y y z z b c c a a x y z b c An ordered tree/hedge over S is encoded as a word over S For a node labeled a, print a, process children in order, print a Same as SAX representation of XML Hedge words: Words over S that correspond to ordered forests 1. Well-matched (no pending calls/returns) 2. No internals 3. Matching calls and returns have same symbol Note: Tree traversals are not closed under prefixes/suffixes * 。 * . . * . . * . . * . . * . . * . . * . . * . . * . . Marrying Words and Trees Rajeev Alur University of Pennsylvania CSR, September 2007 * 。 Sof