Verifying of interface assertions for infinite state Mealy machines

DOI10.1016/J.JCSS.2014.03.002zbMath1410.68218OpenAlexW2060440861MaRDI QIDQ2453549

Manfred Broy

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.03.002

zbMATH Keywords

verificationinvariantsspecificationinteractive systemsI/O-machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Specification and verification of concurrent systems by causality and realizability ⋮ Refining the Safety-Liveness Classification of Temporal Properties According to Realizability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines, transition systems, and interaction
• Specification and Development of Interactive Systems
• Data Types as Lattices
• Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
• A Theory of System Interaction: Components, Interfaces, and Services
• A Theory of Interactive Computation
• Computability Logic: A Formal Theory of Interaction
• Interaction and Realizability
• New Computational Paradigms

This page was built for publication: Verifying of interface assertions for infinite state Mealy machines