![]() |
Volumn 9, Issue 3, 2002, Pages 201-232
|
Proving invariants of I/O automata with TAME
|
Author keywords
Formal methods; Proof checking; Software engineering; Software requirements analysis; Theorem proving; Verification
|
Indexed keywords
AUTOMATA THEORY;
COMPUTER HARDWARE DESCRIPTION LANGUAGES;
EXPERT SYSTEMS;
FORMAL LANGUAGES;
FORMAL LOGIC;
THEOREM PROVING;
TIME SHARING PROGRAMS;
USER INTERFACES;
FORMAL METHODS;
INPUT-OUTPUT AUTOMATA;
PROVING INVARIANTS;
TIMED AUTOMATA MODELING ENVIRONMENT;
TREE IDENTIFY PROTOCOL;
SOFTWARE ENGINEERING;
|
EID: 0036684262
PISSN: 09288910
EISSN: None
Source Type: Journal
DOI: 10.1023/A:1016320523091 Document Type: Article |
Times cited : (31)
|
References (35)
|