What is he best known for?
The fields of study he is best known for:
- Programming language
- Artificial intelligence
- Algorithm
His primary areas of study are Model checking, Theoretical computer science, Programming language, Symbolic trajectory evaluation and Satisfiability modulo theories.
His Model checking research is multidisciplinary, relying on both Bounded function, Nondeterministic algorithm, Mathematical optimization, Binary decision diagram and Finite-state machine.
His Theoretical computer science research incorporates themes from Algorithm, Propositional calculus and Software verification.
His Symbolic trajectory evaluation research is multidisciplinary, incorporating perspectives in Theory of computation and Abstraction model checking.
Alessandro Cimatti has included themes like Floating point, Uninterpreted function, Modulo and Boolean satisfiability problem in his Satisfiability modulo theories study.
His study in Formal verification is interdisciplinary in nature, drawing from both Formal specification and Temporal logic.
His most cited work include:
- Symbolic Model Checking without BDDs (1981 citations)
- NuSMV 2: An OpenSource Tool for Symbolic Model Checking (1328 citations)
- Bounded Model Checking (801 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Model checking, Theoretical computer science, Formal verification, Programming language and Satisfiability.
His Model checking research integrates issues from Correctness, Bounded function and Binary decision diagram.
His biological study spans a wide range of topics, including Finite-state machine and Nondeterministic algorithm.
Theoretical computer science is frequently linked to Hybrid system in his study.
Alessandro Cimatti interconnects Computability, Formal methods, Software and Formal specification in the investigation of issues within Formal verification.
His work deals with themes such as Propositional calculus, Solver and Modulo, Algebra, which intersect with Satisfiability.
He most often published in these fields:
- Model checking (36.10%)
- Theoretical computer science (35.74%)
- Formal verification (23.10%)
What were the highlights of his more recent work (between 2015-2021)?
- Model checking (36.10%)
- Theoretical computer science (35.74%)
- Satisfiability (17.69%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Model checking, Theoretical computer science, Satisfiability, Satisfiability modulo theories and Linearization.
The subject of his Model checking research is within the realm of Programming language.
His work in Theoretical computer science addresses subjects such as Controllability, which are connected to disciplines such as Business process, Data structure, Encoding and Scheduling.
His Satisfiability study integrates concerns from other disciplines, such as Symbolic computation, Modulo and Algebra.
His work in Satisfiability modulo theories tackles topics such as Leverage which are related to areas like Operations research.
Alessandro Cimatti combines subjects such as Real arithmetic and Arithmetic with his study of Linearization.
Between 2015 and 2021, his most popular works were:
- SC2 : Satisfiability Checking Meets Symbolic Computation (36 citations)
- The xSAP Safety Analysis Platform (32 citations)
- Infinite-state invariant checking with IC3 and predicate abstraction (22 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Artificial intelligence
- Algorithm
Alessandro Cimatti focuses on Theoretical computer science, Model checking, Satisfiability, Linearization and Satisfiability modulo theories.
In the subject of general Theoretical computer science, his work in Transition system is often linked to The Symbolic, thereby combining diverse domains of study.
His Model checking research is within the category of Programming language.
The various areas that Alessandro Cimatti examines in his Satisfiability study include Development, Symbolic computation and Modulo.
His Linearization study combines topics from a wide range of disciplines, such as Real arithmetic and Arithmetic.
The concepts of his Formal verification study are interwoven with issues in Verification, Logic simulation and High-level verification.
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.
