First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML. We provide new temporal logics for finite and infinite nested...
Spremljeno u:
| Glavni autori: | , , , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Logical Methods in Computer Science e.V.
2008-11-01
|
| Serija: | Logical Methods in Computer Science |
| Teme: | |
| Online pristup: | https://lmcs.episciences.org/782/pdf |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|