Regular and context-free nominal traces

DOI10.1007/S00236-016-0261-6zbMATH Open1376.68087OpenAlexW2273583583MaRDI QIDQ530218FDOQ530218

Authors: Pierpaolo Degano, Gian Luigi Ferrari, Gianluca Mezzetti 

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

Recommendations

• Towards nominal context-free model-checking
• Nominal automata for resource usage control
• A class of automata for the verification of infinite, resource-allocating behaviours
• Nominal automata with name binding
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

zbMATH Keywords

verificationautomatacontext-free languagesnominal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• A new approach to abstract syntax with variable binding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite-memory automata
• Context-free languages over infinite alphabets
• Finite-memory automata with non-deterministic reassignment
• Variable automata over infinite alphabets
• Title not available (Why is that?)
• Automata vs. Logics on Data Words
• Types as models: model checking message-passing programs
• Runtime verification based on register automata
• Finite state machines for strings over infinite alphabets
• Fresh-register automata
• Nominal automata for resource usage control
• Automata theory in nominal sets
• On nominal regular languages with binders
• Model checking languages of data words
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Reachability in pushdown register automata
• An automaton over data words that captures EMSO logic
• Title not available (Why is that?)
• A parametrized propositional dynamic logic with application to service synthesis
• Title not available (Why is that?)
• History-register automata
• Walking on data words
• Higher-order pushdown systems with data
• Types and trace effects of higher order programs
• Model checking usage policies
• Types and Effects for Resource Usage Analysis

Cited In (3)

• Towards nominal context-free model-checking
• Nominal automata for resource usage control
• A class of automata for the verification of infinite, resource-allocating behaviours

Uses Software

• PIPER
• LocUsT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530218)