We research cyber security and teach future’s experts
to ensure secure technology in everyone’s life.
Optimizations for LTL synthesis
Jobstmann B., Bloem R.
International Conference on Formal Methods in Computer-Aided Design, International Conference on Formal Methods in Computer-Aided Design, ?-?
Diagnosis is Repair
Staber S., Jobstmann B., Bloem R.
16th International Workshop on Principles of Diagnosis, International Workshop on Principles of Diagnosis, 169-174
Program Repair as a Game
Jobstmann B., Griesmayer A., Bloem R.
Computer Aided Verification, International Conference on Computer Aided Verification, 226-238, (LNCS)
Repair of boolean programs using games
Griesmayer A., Bloem R.
Games in Design and Verification, Games in Design and Verification, ?-?
Finding and Fixing Faults
Staber S., Jobstmann B., Bloem R.
Correct Hardware Design and Verification Methods, Advanced Research Working Conference on Correct Hardware Design and Verification Methods, 35-49, (Lecture notes in computer science)
Formal verification of control software: A case study
Griesmayer A., Bloem R., Hautzendorfer M., Wotawa F.
Innovations in Applied Artificial Intelligence, 18th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 783-788, (Lecture Notes in Computer Science ; vol. 3533)
Verification and Fault Localization for VHDL Programs
Bloem R., Wotawa F.
Telematik, Vol. 8(2), 30-33
Analysis of symbolic SCC hull algorithms
Bloem R., Somenzi F., Ravi K.
International Conference on Formal Methods in Computer-Aided Design, International Conference on Formal Methods in Computer-Aided Design, 88-105
Fair simulation minimization
Bloem R., Gurumurthy S., Somenzi F.
International Conference on Computer Aided Verification, Springer, 610-623
Search Techniques and Automata for Symbolic Model Checking
Bloem R.
, Doctoral Thesis
Divide and compose: SCC refinement for language emptiness
Wang C., Bloem R., Hachtel G., Ravi K., Somenzi F.
CONCUR 2001 - Concurrency Theory, International Conference on Concurrency Theory, 456-471, (Lecture notes in computer science)
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Bloem R., Engelfriet J.
Journal of Computer and System Sciences, Vol. 61(1), 1-50
An algorithm for strongly connected component analysis in n log n symbolic steps
Bloem R., Gabow H., Somenzi F.
International Conference on Formal Methods in Computer-Aided Design, International Conference on Formal Methods in Computer-Aided Design, 37-54
A comparative study of symbolic algorithms for the computation of fair cycles
Bloem R., Ravi K., Somenzi F.
International Conference on Formal Methods in Computer-Aided Design, International Conference on Formal Methods in Computer-Aided Design, 143-160
Symbolic guided search for CTL model checking
Bloem R., Ravi K., Somenzi F.
Design Automation Conference, 29-34
Efficient Büchi automata from LTL formulae
Bloem R., Somenzi F.
International Conference on Computer Aided Verification, Springer, 248-263
Approximations for fixpoint computations in symbolic model chec king
Bloem R., Moon I., Ravi K., Somenzi F.
World Multiconference on Systemics, Cybernetics and Informatics, 701-706
Efficient decision procedures for model checking of linear time logic properties
Bloem R., Ravi K., Somenzi F.
International Conference on Computer Aided Verification, International Conference on Computer Aided Verification, 222-235
Monadic second order logic and node relations on graphs and trees
Bloem R., Engelfriet J.
Lecture notes in computer science 1261, Springer, 144-161