Correctly Slicing Extended Finite State Machines

DOI10.1007/978-3-030-41103-9_6zbMath1440.68149OpenAlexW3006017202MaRDI QIDQ3297841

Kelly Androutsopoulos, Torben Amtoft, David Clark

Publication date: 20 July 2020

Published in: From Lambda Calculus to Cybersecurity Through Program Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-41103-9_6

zbMATH Keywords

slicingextended finite state machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Cites Work

• A unifying theory of control dependence and its application to arbitrary program structures
• Slicing for modern program structures: a theory for eliminating irrelevant loops
• Slicing communicating automata specifications: Polynomial algorithms for model reduction
• Reducing NFAs by invariant equivalences.
• Slicing software for model construction
• A vocabulary of program slicing-based techniques
• Program Slicing
• Programming Languages and Systems

This page was built for publication: Correctly Slicing Extended Finite State Machines