The following pages link to A logic you can count on (Q3452257):
Displaying 9 items.
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Exploiting schemas in data synchronization (Q882445) (← links)
- On regular paths with counting and data tests (Q1744429) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Name-passing in an ambient-like calculus and its proof using spatial logic (Q2491641) (← links)
- Adjuncts elimination in the static ambient logic (Q2847405) (← links)
- Foundations of Software Science and Computation Structures (Q5308445) (← links)