Reasoning about GSTE assertion graphs

DOI10.1007/B93958zbMATH Open1179.68086OpenAlexW219731125MaRDI QIDQ5897066FDOQ5897066

Authors: Alan J. Hu, Jeremy Casas, Jin Yang 

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93958

Recommendations

• A transformation-based approach to implication of GSTE assertion graphs
• Theory and Applications of Models of Computation
• Computer Aided Verification
• Terminal satisfiability in GSTE
• A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Mathematics Subject Classification ID

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

Cited In (7)

• Terminal satisfiability in GSTE
• Assertive graphs
• Computer Aided Verification
• Theory and Applications of Models of Computation
• GSTE is partitioned model checking
• A transformation-based approach to implication of GSTE assertion graphs
• A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

This page was built for publication: Reasoning about GSTE assertion graphs

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