The Verus language: Representing time efficiently with BDDs

DOI10.1016/S0304-3975(00)00090-6zbMath0954.68098OpenAlexW2650981837MaRDI QIDQ1589589

S. V. A. Campos, Edmund M. Clarke

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00090-6

zbMATH Keywords

symbolic model checkingtimed systemsBDDsverus

Mathematics Subject Classification ID

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

Related Items (1)

Efficient timed model checking for discrete-time systems

Uses Software

• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• A brief history of Timed CSP
• The Esterel synchronous programming language: Design, semantics, implementation
• TIC: a tImed calculus
• Symbolic model checking for real-time systems

This page was built for publication: The Verus language: Representing time efficiently with BDDs