- Jan Bergstra
Jan A Bergstra is a Dutch computer scientist. His work has focussed on logic and the theoretical foundations of
software engineering, especially on formal methodsfor system design. He is best known as an expert on algebraic methods for the specification of data and computational processes in general.
Jan Bergstra was born in 1951 in
Rotterdam, the son of Tjeerd Bergstra and Johanna Bisschop. He was educated at the Montessori Lyceum Rotterdam (gymnasium beta) and then studied mathematics at Utrecht University, starting in 1969. After an MSc he wrote a PhD thesis, defended in 1976, on recursion theory in higher types, under the supervision of Dirk van Dalen.
Bergstra held posts at the Institute of Applied Mathematics and Computer Science of the University of Leiden (1976-82), and the Centre for Mathematics and Computer Science (CWI) in Amsterdam. In 1985 he was appointed Professor of Programming and Software Engineering at the University of Amsterdam and, at the same time, Professor of Applied Logic at
Utrecht University; such split positions are not uncommon in the Netherlands. These two chairs he continues to hold.
He has been an Advisor of the CWI (1985-2004). In 1989 he worked for a year at Philips Research in Eindhoven as a project leader and, subsequently, continued as a consultant there until 2002. While at Philips he was involved in industrial projects on consumer electronics and medical equipment.
He founded CONCUR, the international conference series in Concurrency Theory, by organising the first two conferences in Amsterdam in 1990 and 1991. He is a member of several editorial boards, and is the managing editor of Science of Computer Programming and the Journal of Logic and Algebraic Programming.
He is honorary Professor of Computer Science at
Swansea Universityand a member of Academia Europaea.
Work on Formal Methods
Jan Bergstra's research on computation has focussed on fundamental concepts, mathematical theories and practical tools.
His main theoretical research programmes are:
* a systematic study of specification methods for abstract data types (starting in 1979, with
John V. Tucker);
* the invention, development and application of process algebras, especially ACP (starting in 1984, with Jan Willem Klop, Jos Baeten and others);
* Module Algebra (starting in 1986, together with Paul Klint and Jan Heering);
* Program Algebra (starting in 1998, with Marijke Loots).
Based in this theoretical research, he has designed various formal methods and tools. In cooperation with Paul Klint and Jan Heering he designed the specification language ASF (in 1984) and the related ToolBus coordination language and system (in 1995). Some of his work has been undertaken in the setting of the
ESPRITprogramme. For example, the software projects FAST and METEOR funded the beginnings of the development of the process algebra ACP, and the telecommunications project SPECS led to the development of the specification language muCRL. All systems are still in daily use for research purposes, while ASF has been extensively used in the Dutch banking industry.
Work in Academia
Through his research and organisational activities, Bergstra has had considerable influence on computer science in the Netherlands. For example, he has supervised the work of over 40 PhD students, many of whom have become academic computer scientists, 12 at professorial level. He set up the new computer science curriculum at Leiden (in 1976), and for cognitive artificial intelligence at Utrecht University (in 1989). In 2000 he became the Director of the Teaching Institute of Information Sciences at the University of Amsterdam. In this role he has been responsible for the redesign of all courses when the bachelor-master system of degrees was introduced into the Netherlands.
A much fuller list of references can be gotten from the link below. The following are a few key publications relevant to the above text.
# J A Bergstra, A Ponse and S A Smolka (Editors), The Handbook of Process Algebra, Elsevier, 2001.
# J A Bergstra and M E Loots, Program Algebra for Component Code, Formal Aspects of Computing 12(1):1-17, 2000.
# J A Bergstra and J V Tucker, Equational specifications, complete term rewriting systems, and computable and semicomputable algebras, Journal of the ACM 42(6):1194-1230, 1995.
# J A Bergstra, J Heering and P Klint, Module Algebra, Journal of the ACM 37(2):335-372, 1990.
# J A Bergstra, J Heering and P Klint (Editors), Algebraic Specification, Addison Wesley, 1989.
* [http://www.science.uva.nl/~janb Home page]
Wikimedia Foundation. 2010.
Look at other dictionaries:
Algebra of Communicating Processes — The Algebra of Communicating Processes (ACP) is an algebraic approach to reasoning about concurrent systems. It is a member of the family of mathematical theories of concurrency known as process algebras or process calculi. ACP was initially… … Wikipedia
John V. Tucker — John Vivian Tucker (born 1952) is a British computer scientist and expert on computability theory, also known as recursion theory. His work has focussed on generalizing the classical theory to deal with all forms of discrete/digital and… … Wikipedia
Process calculus — In computer science, the process calculi (or process algebras) are a diverse family of related approaches to formally modelling concurrent systems. Process calculi provide a tool for the high level description of interactions, communications, and … Wikipedia
Ministry for State Security (Soviet Union) — The Ministry of State Security (MGB) (Russian: Министерство государственной безопасности, Ministerstvo Gosudarstvennoi Bezopasnosti) was the name of Soviet secret police from 1946 to 1953. Contents 1 Origins of the MGB 2 Functions of the MGB 3… … Wikipedia
Mark Burgess (computer scientist) — For other people named Mark Burgess, see Mark Burgess (disambiguation). Mark Burgess (born 19 February 1966) is a researcher and writer at Oslo University College in Norway, who is well known for work in computer science in the field of policy… … Wikipedia
История криптографии — Основная статья: Криптография История криптографии насчитывает около 4 тысяч лет. В качестве основного критерия периодизации криптографии возможно использовать технологические характеристики используемых методов шифрования. Первый период… … Википедия
Export of cryptography in the United States — The export of cryptography in the United States is the transfer from the United States to another country of devices and technology related to cryptography. Since World War II, many governments, including the U.S. and its NATO allies, have… … Wikipedia
Biuro Szyfrów — The Biuro Szyfrów ([ˈbʲurɔ ˈʂɨfruf] ( listen), Polish for Cipher Bureau ) was the interwar Polish General Staff s agency charged with both cryptography (the use of ciphers and codes) and cryptology (the study of ciphers and codes,… … Wikipedia
Cryptanalysis of the Enigma — enabled the western Allies in World War II to read substantial amounts of secret Morse coded radio communications of the Axis powers that had been enciphered using Enigma machines. This yielded military intelligence which, along with that from… … Wikipedia
Interplay Europe — is one of most important festival for young playwrights in Europe.It is organized by Interplay; international, not for profit arts organisation for the furtherance of young playwrights aged 18 to 26. It was founded in Sydney in 1985. Every two… … Wikipedia