Terminal satisfiability in GSTE

DOI10.1155/2014/725275MaRDI QIDQ2336669zbMATH OpenOpenAlexWikidataFDO

Authors Yongsheng Xu, Zhengwei Chang, Desheng Zheng, Wensheng Guo, Guowu Yang

Publication date 19 November 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/725275

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Reasoning about GSTE assertion graphs
• GSTE is partitioned model checking
• Computer Aided Verification
• scientific article; zbMATH DE number 1979544
• A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Cites work

• Bayesian statistical model checking with application to Simulink/Stateflow verification
• Bounded model checking using satisfiability solving
• Computer Aided Verification
• scientific article; zbMATH DE number 2102706 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Reasoning about GSTE assertion graphs
• Statistical model checking for cyber-physical systems
• Symbolic model checking: \(10^{20}\) states and beyond

Cited in

(5)

• GSTE is partitioned model checking
• A Terminating Evaluation-Driven Variant of G3i
• Computer Aided Verification
• Reasoning about GSTE assertion graphs
• Theory and Applications of Models of Computation

Describes a project that uses

Uses Software

• PVS
• MCK

This page was built for publication: Terminal satisfiability in GSTE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336669)