Application of the trace assertion method to the specification, design, and verification of automaton programs
From MaRDI portal
Publication:840086
DOI10.1134/S036176880901006XzbMATH Open1185.68417OpenAlexW2154141291WikidataQ57758831 ScholiaQ57758831MaRDI QIDQ840086FDOQ840086
Authors: E. V. Kuzmin, V. A. Sokolov, D. Ju. Chalyy 
Publication date: 4 September 2009
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s036176880901006x
Recommendations
- scientific article; zbMATH DE number 2040893
- Modeling, specification, and verification of automaton programs
- TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
- Proving safety with trace automata and bounded model checking
- Verification by augmented abstraction: The automata-theoretic view
- An automata-based approach to trace partitioned abstract interpretation
- scientific article; zbMATH DE number 2102724
- An automatic proving approach to parameterized verification
- The automatic verification using symbolic model-checking
- scientific article; zbMATH DE number 1796136
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SWITCH technology: An automated approach to developing software for reactive systems
- The trace specification of communications protocols
- On a formal semantics of tabular expressions
- Modeling, specification, and verification of automaton programs
Uses Software
This page was built for publication: Application of the trace assertion method to the specification, design, and verification of automaton programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840086)
