Proving invariants of I/O automata with TAME
From MaRDI portal
Publication:1857285
DOI10.1023/A:1016320523091zbMath1034.68572MaRDI QIDQ1857285
Elvinia Riccobene, Constance L. Heitmeyer, Myla M. Archer
Publication date: 17 February 2003
Published in: Automated Software Engineering (Search for Journal in Brave)
verification; theorem proving; formal methods; software engineering; proof checking; software requirements analysis
68Q45: Formal languages and automata
68N15: Theory of programming languages
68U99: Computing methodologies and applications
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
A document driven methodology for developing a high quality parallel mesh generation toolbox, Translation Templates to Support Strategy Development in PVS, Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS