Planning proofs of equations in CCS

DOI10.1023/A:1008770222354zbMath1034.68646OpenAlexW1559255683MaRDI QIDQ1857269

Alan Bundy, Ian Green, Raúl Monroy

Publication date: 17 February 2003

Published in: Automated Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008770222354

zbMATH Keywords

automated reasoningformal methodsprogram verificationCCStheorem provers

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Related Items (1)

On process equivalence = equation solving in CCS

Uses Software

• Unnamed Item
• Unnamed Item
• CADP
• HOL
• FDR2
• fc2tools
• Oyster

This page was built for publication: Planning proofs of equations in CCS