Promptness in w-regular automata
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
The quest for a tight translation of büchi to co-büchi automata
Fields of logic and computation
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
The blow-up in translating LTL to deterministic automata
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
Model Checking is an automatic verification technique for state-transition systems that are finite-state or that have finite-state abstractions. In the early 1980's in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we ...