2020 - ACM Fellow For the development of logical methods for design and verification of computational systems
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 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.
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.
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.
Security Policies and Security Models
J. A. Goguen;J. Meseguer.
ieee symposium on security and privacy (1982)
Conditional rewriting logic as a unified model of concurrency
José Meseguer;José Meseguer.
Theoretical Computer Science (1992)
All About Maude - A High-Performance Logical Framework: How to Specify, Program, and Verify Systems in Rewriting Logic
Manuel Clavel;Francisco Durán;Steven Eker;Patrick Lincoln.
(2007)
Maude: specification and programming in rewriting logic
Manuel Clavel;Francisco Durán;Steven Eker;Patrick Lincoln.
Theoretical Computer Science (2002)
Principles of OBJ2
Kokichi Futatsugi;Joseph A. Goguen;Jean-Pierre Jouannaud;José Meseguer.
symposium on principles of programming languages (1985)
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
Joseph A. Goguen;Joseph A. Goguen;José Meseguer;José Meseguer.
Theoretical Computer Science (1992)
Membership algebra as a logical framework for equational specification
José Meseguer.
workshop on recent trends in algebraic development techniques (1997)
Unwinding and Inference Control
Joseph A. Goguen;Jose Meseguer.
ieee symposium on security and privacy (1984)
Petri nets are moniods
José Meseguer;Ugo Montanari.
Information & Computation (1990)
Initiality, induction, and computability
J Meseguer;J A Goguen.
Algebraic methods in semantics (1986)
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:
University of California, San Diego
SRI International
United States Naval Research Laboratory
SRI International
University of Pisa
University of Illinois at Urbana-Champaign
University of Southampton
University of Illinois at Urbana-Champaign
University of Illinois at Urbana-Champaign
Ludwig-Maximilians-Universität München
French Institute for Research in Computer Science and Automation - INRIA
Publications: 45
Rutgers, The State University of New Jersey
Tripura University
Politecnico di Milano
Los Alamos National Laboratory
Alexandria University
Lakehead University
University of Oklahoma
Uppsala University
University of Bari Aldo Moro
University of Reading
German Center for Neurodegenerative Diseases
KU Leuven
Albert Einstein College of Medicine
Dartmouth College
University of Edinburgh
University of Erlangen-Nuremberg