2023 - Research.com Computer Science in Ireland Leader Award
Matthew Hennessy focuses on Algebra, Bisimulation, Programming language, Theoretical computer science and Operational semantics. His work carried out in the field of Algebra brings together such families of science as Discrete mathematics, Equivalence and Process calculus. The concepts of his Bisimulation study are interwoven with issues in Semantics, Theory of computation and Preorder.
His Programming language research is multidisciplinary, incorporating elements of Fourth-generation programming language and Very high-level programming language. His Theoretical computer science research includes elements of Distributed computing, Construct, Computation and Set. His Denotational semantics study incorporates themes from Algebraic theory and Concurrency.
Matthew Hennessy mainly investigates Theoretical computer science, Process calculus, Programming language, Bisimulation and Algebra. His Theoretical computer science study combines topics in areas such as Algorithm, Relation, Preorder and Asynchronous communication. His studies deal with areas such as Denotational semantics of the Actor model and Calculus as well as Process calculus.
In the subject of general Programming language, his work in Concurrency, Operational semantics, Semantics and Transition system is often linked to Semantic theory of truth, thereby combining diverse domains of study. His work in Bisimulation addresses subjects such as Equivalence, which are connected to disciplines such as Distributed computing and Algebraic number. He works mostly in the field of Algebra, limiting it down to topics relating to Discrete mathematics and, in certain cases, Theory of computation, as a part of the same area of interest.
Matthew Hennessy mostly deals with Theoretical computer science, Preorder, Equivalence, Process calculus and Probabilistic logic. The various areas that Matthew Hennessy examines in his Theoretical computer science study include Algorithm, Equational theory and Logical framework. His studies in Preorder integrate themes in fields like Semantics and Coinduction.
He combines subjects such as Bisimulation, Transition system and Algebra with his study of Equivalence. As part of his studies on Algebra, he frequently links adjacent subjects like Regular expression. His Process calculus study combines topics from a wide range of disciplines, such as Set, Distributed computing, Broadcasting and Protocol.
His primary scientific interests are in Theoretical computer science, Equivalence, Transition system, Extensional definition and Process calculus. The study incorporates disciplines such as Software engineering, Session, Preorder and Database in addition to Theoretical computer science. His Equivalence study is related to the wider topic of Discrete mathematics.
His Transition system research is multidisciplinary, incorporating perspectives in Concurrency, Theory of computation and Conservative extension, Algebra. His study in Process calculus is interdisciplinary in nature, drawing from both Structure and Set. His Bisimulation study is concerned with the larger field of Programming language.
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.
On Observing Nondeterminism and Concurrency
Matthew Hennessy;Robin Milner.
international colloquium on automata, languages and programming (1980)
Algebraic laws for nondeterminism and concurrency
Matthew Hennessy;Robin Milner.
Journal of the ACM (1985)
Testing equivalences for processes
R. De Nicola;M.C.B. Hennessy.
Theoretical Computer Science (1984)
Algebraic theory of processes
M. Hennessy;H. Lin.
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics archive (1995)
Full abstraction for a simple parallel programming language
Matthew Hennessy;Gordon D. Plotkin.
mathematical foundations of computer science (1979)
Resource Access Control in Systems of Mobile Agents
Matthew Hennessy;James Riely.
Information & Computation (2002)
A Process Algebra for Timed Systems
M. Hennessy;T. Regan.
Information & Computation (1995)
The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics
Testing Equivalence for Processes
Rocco De Nicola;Matthew Hennessy.
international colloquium on automata, languages and programming (1983)
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: