What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Algorithm
José Meseguer spends much of his time researching Programming language, Rewriting, Theoretical computer science, Algebra and Concurrency.
His studies in Rewriting integrate themes in fields like Executable, Formal methods, Semantics, Formal specification and Confluence.
His study looks at the relationship between Theoretical computer science and topics such as Functional logic programming, which overlap with Prolog.
José Meseguer has included themes like Discrete mathematics and Term algebra in his Algebra study.
His research integrates issues of Concurrent object-oriented programming, Process architecture, Petri net and Unified Process in his study of Concurrency.
Within one scientific family, José Meseguer focuses on topics pertaining to Concurrent constraint logic programming under Concurrent object-oriented programming, and may sometimes address concerns connected to Denotational semantics of the Actor model.
His most cited work include:
- Security Policies and Security Models (1857 citations)
- Conditional rewriting logic as a unified model of concurrency (1166 citations)
- Conditional rewriting logic as a unified model of concurrency (1166 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Programming language, Rewriting, Theoretical computer science, Model checking and Discrete mathematics.
His is involved in several facets of Programming language study, as is seen by his studies on Operational semantics, Equational logic, Semantics, Formal specification and Executable.
José Meseguer has researched Rewriting in several fields, including Concurrency, Logical framework, Modulo, Semantics and Confluence.
The Theoretical computer science study combines topics in areas such as Cryptographic protocol and Probabilistic logic.
His Model checking research is multidisciplinary, relying on both Linear temporal logic, Distributed computing, Temporal logic, Symbolic simulation and Correctness.
His biological study spans a wide range of topics, including Axiom, Algebra and Petri net.
He most often published in these fields:
- Programming language (52.53%)
- Rewriting (43.39%)
- Theoretical computer science (31.13%)
What were the highlights of his more recent work (between 2013-2020)?
- Programming language (52.53%)
- Rewriting (43.39%)
- Discrete mathematics (13.81%)
In recent papers he was focusing on the following fields of study:
José Meseguer focuses on Programming language, Rewriting, Discrete mathematics, Model checking and Modulo.
His Programming language research is multidisciplinary, incorporating elements of Theoretical computer science, Reachability and Symbolic computation.
His research in Theoretical computer science intersects with topics in Cryptographic protocol and State.
The various areas that José Meseguer examines in his Rewriting study include Program analysis, Automated theorem proving, Operational semantics, Term and Dependency.
His work deals with themes such as Algorithm and Modular design, which intersect with Discrete mathematics.
His Model checking study combines topics from a wide range of disciplines, such as Distributed computing, Correctness, Consistency, Semantics and Atomicity.
Between 2013 and 2020, his most popular works were:
- Rewriting modulo SMT and open system analysis (33 citations)
- Variant-based satisfiability in initial algebras (30 citations)
- A modular order-sorted equational generalization algorithm (28 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Algorithm
His primary areas of study are Programming language, Rewriting, Model checking, Reachability and Algebra.
In his research, State is intimately related to Theoretical computer science, which falls under the overarching field of Programming language.
His Rewriting research incorporates themes from Term, Dependency, Object, Computation and Confluence.
His studies deal with areas such as Linear temporal logic, Distributed control system, Concurrency, Semantics and Asynchronous communication as well as Model checking.
In his work, Associative property is strongly intertwined with Unification, which is a subfield of Reachability.
José Meseguer combines subjects such as Algorithm and Set with his study of Algebra.
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.
