Efficient data structure for fully symbolic verification of real-time software systems

DOI10.1007/3-540-46419-0_12MaRDI QIDQ2729076zbMATH OpenFDO

Authors Farn Wang

Publication date 6 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46419-0_12

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Computing methodologies and applications (68U99) Symbolic computation and algebraic computation (68W30)

Recommendations

• Compact data structures and state-space reduction for model-checking real-time systems
• Efficient verification of timed automata with BDD-like data-structures
• Symbolic verification and analysis of discrete timed systems
• Symbolic model checking for real-time systems
• The automatic verification using symbolic model-checking

Cited in

(2)

• Analysis and verification of real-time systems using quantitative symbolic algorithms
• Data constraints for validation of real-time software

This page was built for publication: Efficient data structure for fully symbolic verification of real-time software systems

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