scientific article; zbMATH DE number 1956578

MaRDI QIDQ4417919zbMATH OpenFDO

Authors Vineet Kahlon, E. Allen Emerson

Publication date 30 July 2003

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

Mathematics Subject Classification ID

Network protocols (68M12) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Exact and efficient verification of parameterized cache coherence protocols
• scientific article; zbMATH DE number 1670768
• Formal Methods in Computer-Aided Design
• Constraint-based verification of parameterized cache coherence protocols
• ParaVerifier: an automatic framework for proving parameterized cache coherence protocols

Cited in

(10)

• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• On one application of computations with oracle
• Constraint-based verification of parameterized cache coherence protocols
• scientific article; zbMATH DE number 1670768 (Why is no real title available?)
• Model checking parameterised multi-token systems via the composition method
• Model checking parameterized systems
• Negotiations and Petri nets
• Verifying Parameterized taDOM+ Lock Managers
• Formal Methods in Computer-Aided Design
• Exact and efficient verification of parameterized cache coherence protocols

Describes a project that uses

Uses Software

• SNOOPY

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 Q4417919)