Regular and context-free nominal traces

DOI10.1007/S00236-016-0261-6MaRDI QIDQ530218zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

verificationautomatacontext-free languagesnominal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

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

Cited in

(3)

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

Describes a project that uses

Uses Software

• LocUsT
• PIPER

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)