Verifying of interface assertions for infinite state Mealy machines
From MaRDI portal
Publication:2453549
DOI10.1016/J.JCSS.2014.03.002zbMATH Open1410.68218OpenAlexW2060440861MaRDI QIDQ2453549FDOQ2453549
Authors: 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
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Data Types as Lattices
- Title not available (Why is that?)
- A theory of interactive computation
- Turing machines, transition systems, and interaction
- Computability logic: a formal theory of interaction
- Specification and Development of Interactive Systems
- Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
- New Computational Paradigms
- Interaction and Realizability
- Title not available (Why is that?)
- A theory of system interaction: components, interfaces, and services
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)
