Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics

DOI10.1007/11753728_56MaRDI QIDQ3434722zbMATHOpenAlexFDO

Authors Jan-Willem Roorda, Koen Claessen

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
• A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL
• Symbolic trajectory evaluation
• scientific article; zbMATH DE number 2102706
• Symbolic trajectory evaluation for word-level verification: theory and implementation

Cited in

(8)

• scientific article; zbMATH DE number 1979544 (Why is no real title available?)
• scientific article; zbMATH DE number 2102706 (Why is no real title available?)
• Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation
• Static Analysis
• A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL
• Symbolic trajectory evaluation
• Symbolic trajectory evaluation for word-level verification: theory and implementation
• A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

This page was built for publication: Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics

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