Verifying of interface assertions for infinite state Mealy machines
From MaRDI portal
Publication:2453549
DOI10.1016/j.jcss.2014.03.002zbMath1410.68218MaRDI QIDQ2453549
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
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
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