21 search results - page 5 / 5 » SAT-Based Verification of LTL Formulas |
136
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...