scientific article; zbMATH DE number 2080057

MaRDI QIDQ4472250zbMATH OpenFDO

Authors Hoonsang Jin, Andreas Kuehlmann, Fabio Somenzi

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2280/22800312.htm

Mathematics Subject Classification ID

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

Recommendations

• Correct Hardware Design and Verification Methods
• A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
• Verifying Concurrent Systems with Symbolic Execution
• Optimal time-bounded reachability analysis for concurrent systems
• Efficient hybrid reachability analysis for asynchronous concurrent systems
• scientific article; zbMATH DE number 1629965
• A symbolic model for timed concurrent constraint programming
• Denotational fixed-point semantics for constructive scheduling of synchronous concurrency

Cited in

(2)

• On symbolic OBDD-based algorithms for the minimum spanning tree problem
• Formal Methods in Computer-Aided Design

This page was built for publication:

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