- Home
- Best Scientists - Computer Science
- Fabio Somenzi

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
52
Citations
10,369
150
World Ranking
2601
National Ranking
1386

- Algorithm
- Programming language
- Algebra

His main research concerns Algorithm, Theoretical computer science, Model checking, Finite-state machine and Boolean function. The Algorithm study combines topics in areas such as Automaton and Set. The study incorporates disciplines such as And-inverter graph and Boolean algebra in addition to Theoretical computer science.

His Model checking study incorporates themes from Time complexity, Counterexample, Formal verification, Computation and Data structure. His Finite-state machine research incorporates themes from Logic synthesis and Markov chain. His work in the fields of Boolean function, such as Boolean circuit, overlaps with other areas such as Interior algebra and Abstract algebraic logic.

- VIS: A System for Verification and Synthesis (547 citations)
- Algebraic decision diagrams and their applications (533 citations)
- Logic Synthesis and Verification Algorithms (389 citations)

His primary scientific interests are in Algorithm, Theoretical computer science, Model checking, Formal verification and Reachability. His work in Sequential logic, Boolean function, Computation, Finite-state machine and Binary decision diagram is related to Algorithm. His work in Finite-state machine addresses issues such as Tree traversal, which are connected to fields such as State variable.

The various areas that he examines in his Theoretical computer science study include Boolean circuit and State. His Model checking research incorporates elements of Satisfiability, Constraint satisfaction, Bounded function and Büchi automaton. When carried out as part of a general Formal verification research project, his work on Formal equivalence checking and Functional verification is frequently linked to work in High-level verification, therefore connecting diverse disciplines of study.

- Algorithm (56.52%)
- Theoretical computer science (34.30%)
- Model checking (28.50%)

- Theoretical computer science (34.30%)
- Reinforcement learning (5.80%)
- Reachability (13.53%)

Fabio Somenzi mainly investigates Theoretical computer science, Reinforcement learning, Reachability, Algorithm and Automaton. His study connects Graph and Theoretical computer science. His biological study spans a wide range of topics, including Mathematical optimization, Limit and Büchi automaton.

His Reachability research is multidisciplinary, incorporating perspectives in Time complexity and Probability distribution. While working on this project, Fabio Somenzi studies both Algorithm and Strengths and weaknesses. His study in Formal verification is interdisciplinary in nature, drawing from both Assertion and Counterexample.

- Omega-Regular Objectives in Model-Free Reinforcement Learning (45 citations)
- Better generalization in IC3 (42 citations)
- An incremental approach to model checking progress properties (36 citations)

- Programming language
- Algorithm
- Algebra

The scientist’s investigation covers issues in Theoretical computer science, Algorithm, Formal verification, Automaton and Reachability. His work carried out in the field of Theoretical computer science brings together such families of science as Reactive system and Graph. He merges many fields, such as Algorithm and Conflict analysis, in his writings.

His studies in Formal verification integrate themes in fields like Constant, Arithmetic, Control theory and Counterexample. Fabio Somenzi has included themes like Markov decision process and Reinforcement learning in his Automaton study. He interconnects Model checking and Assertion in the investigation of issues within Reachability.

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.

Algebric Decision Diagrams and Their Applications

R. I. Bahar;E. A. Frohm;C. M. Gaona;G. D. Hachtel.

formal methods **(1997)**

1071 Citations

VIS: A System for Verification and Synthesis

Robert K. Brayton;Gary D. Hachtel;Alberto L. Sangiovanni-Vincentelli;Fabio Somenzi.

computer aided verification **(1996)**

941 Citations

Algebraic decision diagrams and their applications

R. Iris Bahar;Erica A. Frohm;Charles M. Gaona;Gary D. Hachtel.

international conference on computer aided design **(1993)**

831 Citations

Logic Synthesis and Verification Algorithms

Gary D. Hachtel;Fabio Somenzi.

**(1996)**

597 Citations

Efficient Büchi Automata from LTL Formulae

Fabio Somenzi;Roderick Bloem.

computer aided verification **(2000)**

460 Citations

High-level power modeling, estimation, and optimization

E. Macii;M. Pedram;F. Somenzi.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems **(1998)**

424 Citations

Who are the variables in your neighbourhood

Shipra Panda;Fabio Somenzi.

international conference on computer aided design **(1995)**

258 Citations

High-density reachability analysis

Kavita Ravi;Fabio Somenzi.

international conference on computer aided design **(1995)**

216 Citations

Symmetry detection and dynamic variable ordering of decision diagrams

Shipra Panda;Fabio Somenzi;Bernard F. Plessier.

international conference on computer aided design **(1994)**

194 Citations

Markovian analysis of large finite state machines

G.D. Hachtel;E. Macii;A. Pardo;F. Somenzi.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems **(1996)**

194 Citations

University of Colorado Boulder

Polytechnic University of Turin

Graz University of Technology

University of South Australia

Polytechnic University of Turin

Chinese Academy of Sciences

University of California, Berkeley

Hasso Plattner Institute

University of Colorado Boulder

University of Southern California

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

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:

Something went wrong. Please try again later.