His primary areas of investigation include Formal specification, Automaton, Theoretical computer science, Algorithm and Programming language. His Formal specification research incorporates elements of Computational complexity theory, Arbiter, Property and Rank. The concepts of his Automaton study are interwoven with issues in Time complexity, Graphical user interface, Word, Mathematical optimization and Finite-state machine.
Roderick Bloem interconnects Scalability and Computer Aided Design in the investigation of issues within Theoretical computer science. His Algorithm research integrates issues from Range, Software and Reference implementation. His work in the fields of Programming language, such as Liveness, Implementation and Requirements analysis, intersects with other areas such as Successor cardinal.
Programming language, Algorithm, Theoretical computer science, Model checking and Automaton are his primary areas of study. The Debugging, Formal specification and Symbolic execution research he does as part of his general Programming language study is frequently linked to other disciplines of science, such as Hardware description language, therefore creating a link between diverse domains of science. In his research on the topic of Algorithm, Deterministic automaton is strongly related with ω-automaton.
His Theoretical computer science study incorporates themes from Reactive system, Construct and Reduction. His work in Reactive system addresses issues such as Temporal logic, which are connected to fields such as Reinforcement learning. As a member of one scientific family, Roderick Bloem mostly works in the field of Model checking, focusing on Computation and, on occasion, State space.
His primary scientific interests are in Temporal logic, Reactive system, Reactive synthesis, Competition and Reinforcement learning. The Temporal logic study combines topics in areas such as Automaton, Distributed computing and Arithmetic. Roderick Bloem conducts interdisciplinary study in the fields of Automaton and Register through his research.
His Reactive system research is multidisciplinary, incorporating elements of Theoretical computer science, Binary decision diagram and Robustness. His research in Theoretical computer science intersects with topics in MQTT, Reduction, Counterexample, Server and Implementation. His research investigates the link between Liveness and topics such as Distributed algorithm that cross with problems in Formal specification.
The scientist’s investigation covers issues in Temporal logic, Reactive synthesis, Competition, Benchmark and Reactive system. The study incorporates disciplines such as Queue, Automaton and Reinforcement learning in addition to Temporal logic. His Reactive system research incorporates elements of Theoretical computer science and Distributed computing.
Roderick Bloem combines subjects such as Graph, Protocol and Server with his study of Theoretical computer science. His Distributed computing research integrates issues from Formal methods, System model and Formal specification. Roderick Bloem interconnects Model checking and Formal verification in the investigation of issues within Robot.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Efficient Büchi Automata from LTL Formulae
Fabio Somenzi;Roderick Bloem.
computer aided verification (2000)
Synthesis of Reactive(1) designs
Roderick Bloem;Barbara Jobstmann;Nir Piterman;Amir Pnueli.
Journal of Computer and System Sciences (2012)
Handbook of Model Checking
Edmund M. Clarke;Thomas A. Henzinger;Helmut Veith;Roderick Bloem.
Program repair as a game
Barbara Jobstmann;Andreas Griesmayer;Roderick Bloem.
computer aided verification (2005)
Safe Reinforcement Learning via Shielding
Mohammed Alshiekh;Roderick Bloem;Rüdiger Ehlers;Bettina Könighofer.
national conference on artificial intelligence (2018)
Better Quality in Synthesis through Quantitative Objectives
Roderick Bloem;Krishnendu Chatterjee;Thomas A. Henzinger;Barbara Jobstmann.
computer aided verification (2009)
Optimizations for LTL Synthesis
B. Jobstmann;R. Bloem.
formal methods in computer-aided design (2006)
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
Roderick Bloem;Harold N. Gabow;Fabio Somenzi.
formal methods (2006)
Specify, Compile, Run: Hardware from PSL
Roderick Bloem;Stefan Galler;Barbara Jobstmann;Nir Piterman.
Electronic Notes in Theoretical Computer Science (2007)
Synthesizing robust systems
Roderick Bloem;Krishnendu Chatterjee;Karin Greimel;Thomas A. Henzinger.
Acta Informatica (2014)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: