Regular and context-free nominal traces

DOI10.1007/s00236-016-0261-6zbMath1376.68087OpenAlexW2273583583MaRDI QIDQ530218

Pierpaolo Degano, Gianluca Mezzetti, Gian-Luigi Ferrari

Publication date: 9 June 2017

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0261-6

zbMATH Keywords

verificationautomatacontext-free languagesnominal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• PIPER
• LocUsT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• Finite-memory automata
• Context-free languages over infinite alphabets
• Automata theory in nominal sets
• On Nominal Regular Languages with Binders
• Model Checking Languages of Data Words
• Nominal Automata for Resource Usage Control
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Reachability in Pushdown Register Automata
• FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
• An Automaton over Data Words That Captures EMSO Logic
• Variable Automata over Infinite Alphabets
• Automata vs. Logics on Data Words
• History-Register Automata
• Walking on Data Words
• Types as models
• Finite state machines for strings over infinite alphabets
• Runtime Verification Based on Register Automata
• Fresh-register automata
• Types and trace effects of higher order programs
• Model checking usage policies
• Types and Effects for Resource Usage Analysis

This page was built for publication: Regular and context-free nominal traces