Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
FIRST-ORDER AND TEMPORAL LOGICS FOR NESTED WORDS RAJEEV ALUR, MARCELO ARENAS, PABLO BARCELO, KOUSHA ETESSAMI,
 

Summary: FIRST-ORDER AND TEMPORAL LOGICS FOR NESTED WORDS
RAJEEV ALUR, MARCELO ARENAS, PABLO BARCEL´O, KOUSHA ETESSAMI,
NEIL IMMERMAN, AND LEONID LIBKIN
Department of Computer and Information Science, University of Pennsylvania
e-mail address: alur@cis.upenn.edu
Department of Computer Science, Pontificia Universidad Cat´olica de Chile
e-mail address: marenas@ing.puc.cl
Department of Computer Science, Universidad de Chile
e-mail address: pbarcelo@dcc.uchile.cl
School of Informatics, University of Edinburgh, Edinburgh
e-mail address: kousha@inf.ed.ac.uk
Department of Computer Science,University of Massachusetts
e-mail address: immerman@cs.umass.edu
School of Informatics, University of Edinburgh, Edinburgh
e-mail address: libkin@inf.ed.ac.uk
Abstract. Nested words are a structured model of execution paths in procedural pro-
grams, 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 words, which are natural
extensions of LTL, and prove that these logics are first-order expressively-complete. One

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Massachusetts at Amherst, University of - Architecture and Language Implementation

 

Collections: Computer Technologies and Information Sciences