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)
verificationtheorem provingformal methodssoftware engineeringproof checkingsoftware requirements analysis
Formal languages and automata (68Q45) Theory of programming languages (68N15) Computing methodologies and applications (68U99) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS ⋮ A document driven methodology for developing a high quality parallel mesh generation toolbox ⋮ Translation Templates to Support Strategy Development in PVS
