Verifying of interface assertions for infinite state Mealy machines
From MaRDI portal
Publication:2453549
Recommendations
- Computer Science Logic
- Tools and Algorithms for the Construction and Analysis of Systems
- scientific article; zbMATH DE number 2086795
- scientific article; zbMATH DE number 1615252
- Automated Technology for Verification and Analysis
- scientific article; zbMATH DE number 2102702
- scientific article; zbMATH DE number 2102724
- Automatic verification of sequential infinite-state processes
- scientific article; zbMATH DE number 2090119
Cites work
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 3748385 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- A theory of interactive computation
- A theory of system interaction: components, interfaces, and services
- Computability logic: a formal theory of interaction
- Data Types as Lattices
- Interaction and Realizability
- New Computational Paradigms
- Specification and Development of Interactive Systems
- Turing machines, transition systems, and interaction
- Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
Cited in
(2)
This page was built for publication: Verifying of interface assertions for infinite state Mealy machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453549)