We present specification languages that naturally capture exactly the regular and -regular properties that are stutter invariant. Our specification languages are variants of the cl...
Most temporal logics, particularly interval temporal logics, are not expressive enough to capture meanings of natural language constructions, and they are not convenient to represe...
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
: PEWS is a language for the implementation of web service interfaces. PEWS programs can be used for the description of both individual and composed web services. Individual web se...
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...