|
International Conference On Concurrency Theory
The International Conference on Concurrency Theory (CONCUR) is an academic conference in the field of computer science, with focus on the theory of concurrency and its applications. It is the flagship conference for concurrency theory according to the International Federation for Information Processing Working Group on Concurrency Theory ( WP 1.8). The conference is organised annually since 1988. Since 2015, papers presented at CONCUR are published in the LIPIcs–Leibniz International Proceedings in Informatics, a "series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl –Leibniz Center for Informatics". Before, CONCUR papers were published in the series Lecture Notes in Computer Science. * According tCORE Ranking CONCUR has rank A ("excellent conference, and highly respected in a discipline area"). * According tGoogle Scholar Metrics(as of 20 July 2019), CONCUR has H5-index 21 and H5-median 34. Editio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concurrency (computer Science)
In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome. This allows for parallel execution of the concurrent units, which can significantly improve overall speed of the execution in multi-processor and multi-core systems. In more technical terms, concurrency refers to the decomposability of a program, algorithm, or problem into order-independent or partially-ordered components or units of computation. According to Rob Pike, concurrency is the composition of independently executing computations, and concurrency is not parallelism: concurrency is about dealing with lots of things at once but parallelism is about doing lots of things at once. Concurrency is about structure, parallelism is about execution, concurrency provides a way to structure a solution to solve a problem that may (but not necessarily) be parallelizable. A number of mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rajeev Alur
Rajeev Alur is an American professor of computer science at the University of Pennsylvania who has made contributions to formal methods, programming languages, and automata theory, including notably the introduction of timed automata (Alur and Dill, 1994) and nested words (Alur and Madhusudan, 2004). Prof. Alur was born in Pune. He obtained his bachelor's degree in computer science from the Indian Institute of Technology at Kanpur, India, in 1987, and Ph.D. in computer science from Stanford University, California, USA, in 1991. Before joining the University of Pennsylvania in 1997, he was with the Computing Science Research Center at Bell Laboratories. His research has included formal modeling and analysis of reactive systems, hybrid systems, model checking, software verification, design automation for embedded software, and program synthesis. He is a Fellow of the ACM, a Fellow of the IEEE, and has served as the chair of ACM SIGBED (Special Interest Group on Embedded Systems) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Publications In Computer Science
This is a list of important publications in computer science, organized by field. Some reasons why a particular publication might be regarded as important: *Topic creator – A publication that created a new topic *Breakthrough – A publication that changed scientific knowledge significantly *Influence – A publication which has significantly influenced the world or has had a massive impact on the teaching of computer science. Artificial intelligence ''Computing Machinery and Intelligence'' * Alan Turing * Mind, 59:433–460, 1950. Online copy Description: This paper discusses the various arguments on why a machine can not be intelligent and asserts that none of those arguments are convincing. The paper also suggested the Turing test, which it calls "The Imitation Game" as according to Turing it is pointless to ask whether or not a machine can ''think'' intelligently, and checking if it can ''act'' intelligently is sufficient. ''A Proposal for the Dartmouth S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Computer Science Conference Acronyms
This is a list of academic conferences in computer science, ordered by their acronyms or abbreviations. A * AAAI – AAAI Conference on Artificial Intelligence * AAMAS – International Conference on Autonomous Agents and Multiagent Systems * ABZ – International Conference on Abstract State Machines, Alloy, B and Z * ACL – Annual Meeting of the Association for Computational Linguistics * AE - Artificial Evolution Conference * ALGO – ALGO Conference * AMCIS – Americas Conference on Information Systems * ANTS – Algorithmic Number Theory Symposium * ARES – International Conference on Availability, Reliability and Security * ASIACRYPT – International Conference on the Theory and Application of Cryptology and Information Security * ASP-DAC – Asia and South Pacific Design Automation Conference * ASE – IEEE/ACM International Conference on Automated Software Engineering * ASWEC – Australian Software Engineering Conference * ATMOS – Workshop on Algorithmic Approa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Computer Science Conferences
This is a list of academic conferences in computer science. Only conferences with separate articles are included; within each field, the conferences are listed alphabetically by their short names. General * FCRC – Federated Computing Research Conference Algorithms and theory Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational complexity, automata theory and formal languages: * CCC - Computational Complexity Conference * FCT – International Symposium on Fundamentals of Computation Theory * FOCS – IEEE Symposium on Foundations of Computer Science * ICALP – International Colloquium on Automata, Languages and Programming * ISAAC – International Symposium on Algorithms and Computation * MFCS – International Symposium on Mathematical Foundations of Computer Science * STACS – Symposium on Theoretical Aspects of Computer Science * STOC – ACM Symposium on Theory of Computing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Davide Sangiorgi
Davide Sangiorgi is an Italian professor of computer science at the University of Bologna. He has previously held research positions at the University of Edinburgh and at Inria. He has received his PhD from the University of Edinburgh under the supervision of Robin Milner in 1993. He has had visiting positions at Centrum Wiskunde & Informatica (CWI, Amsterdam), University of Cambridge, University of Oxford. His research interests are in the fields of concurrent systems, semantics and verification techniques. He is a member, and past chairman, of IFIP Working Group 2.2 on the formal description of programming concepts, and a member of Academia Europaea. He is the head of the Research Team FOCUS, a joint laboratory between the University of Bologna and INRIA The National Institute for Research in Digital Science and Technology (Inria) () is a French national research institution focusing on computer science and applied mathematics. It was created under the name ''Institut de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nancy Lynch
Nancy Ann Lynch (born January 19, 1948) is a mathematician, a theorist, and a professor at the Massachusetts Institute of Technology. She is the NEC Professor of Software Science and Engineering in the EECS department and heads the "Theory of Distributed Systems" research group at MIT's Computer Science and Artificial Intelligence Laboratory. Education and early life Lynch was born in Brooklyn, and her academic training was in mathematics. She attended Brooklyn College and MIT, where she received her Ph.D. in 1972 under the supervision of Albert R. Meyer. Work She served on the math and computer science faculty at several other universities, including Tufts University, the University of Southern California, Florida International University, and the Georgia Institute of Technology (Georgia Tech), prior to joining the MIT faculty in 1982. Since then, she has been working on applying mathematics to the tasks of understanding and constructing complex distributed systems. Her 1985 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Benjamin C
Benjamin ( he, ''Bīnyāmīn''; "Son of (the) right") blue letter bible: https://www.blueletterbible.org/lexicon/h3225/kjv/wlc/0-1/ H3225 - yāmîn - Strong's Hebrew Lexicon (kjv) was the last of the two sons of Jacob and Rachel (Jacob's thirteenth child and twelfth and youngest son) in Jewish, Christian and Islamic tradition. He was also the progenitor of the Israelite Tribe of Benjamin. Unlike Rachel's first son, Joseph, Benjamin was born in Canaan according to biblical narrative. In the Samaritan Pentateuch, Benjamin's name appears as "Binyamēm" (Samaritan Hebrew: , "son of days"). In the Quran, Benjamin is referred to as a righteous young child, who remained with Jacob when the older brothers plotted against Joseph. Later rabbinic traditions name him as one of four ancient Israelites who died without sin, the other three being Chileab, Jesse and Amram. Name The name is first mentioned in letters from King Sîn-kāšid of Uruk (1801–1771 BC), who called himself “King ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Javier Esparza
Francisco Javier Esparza Estaun (born 27 April 1964 in Pamplona, Spain) is a Spanish computer scientist. He is a professor at the Technische Universität München. Education Javier Esparza Estaun received his Master of Science degree in Theoretical Physics from the University of Zaragoza (1987). He earned his Doctoral degree (PhD) in Computer Science (1990, on free-choice Petri nets) from the same university. He habilitated 1994 at the University of Hildesheim on the subject of Petri net unfoldings. Career During his habilitation and in the period afterwards, Javier Esparza's focus was on concurrency theory and the theory of Petri nets. He made important contributions to Petri net structure theory and to the unfolding approach, initially proposed by Kenneth L. McMillan, and he is the co-author of two books on these subjects. After his habilitation, he was employed as an associate professor at Technische Universität München (1994–2001). He was then successively Chair ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moshe Y
Moses ( el, Μωϋσῆς),from Latin and Greek Moishe ( yi, משה),from Yiddish Moshe ( he, מֹשֶׁה),from Modern Hebrew or Movses (Armenian: Մովսես) from Armenian is a male given name, after the biblical figure Moses. According to the Torah, the name "Moses" comes from the Hebrew verb, meaning "to pull out/draw out" f water and the infant Moses was given this name by Pharaoh's daughter after she rescued him from the Nile (Exodus 2:10) Since the rise of Egyptology and decipherment of hieroglyphs, it was postulated that the name of Moses, with a similar pronunciation as the Hebrew Moshe, is the Egyptian word for Son, with Pharaoh names such as Thutmose and Ramesses roughly translating to "son of Thoth" and "son of Ra," respectively. There are various ways of pronouncing the Hebrew name of Moses, for example in Ashkenazi western European it would be pronounced Mausheh, in Eastern Europe Moysheh, in northern Islamic countries Moussa, and in Yemen Mesha. The nickname ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orna Kupferman
Orna Kupferman is a Professor of Computer Science and former Vice Rector at the Hebrew University of Jerusalem. She was elected to the Academia Europaea in 2016. Early life and education Kupferman served in the Israel Defense Force from 1986 to 1988. She earned her PhD at the Technion in 1995, where she was supervised by Orna Grumberg. In 1996 Kupferman joined the technical staff at Bell Labs. She moved to University of California, Berkeley in 1997, working with Thomas Henzinger. Research and career In 1998 Kupferman was appointed a Senior Lecturer at the Hebrew University of Jerusalem. She acted as Head of Computer Science from 2005 to 2008, and as Head of Engineering between 2008 and 2011. She was made a Full Professor in 2008. In 2012 Kupferman was awarded a European Research Council grant to study high-quality reactive systems. She is developing formal verification and synthesis computer systems for both hardware and software. She uses automata theory approaches to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joost-Pieter Katoen
Joost-Pieter Katoen (born October 6, 1964) is a Dutch theoretical computer scientist based in Germany. He is distinguished professor in Computer Science and head of the Software Modeling and Verification Group at RWTH Aachen University. Furthermore, he is part-time associated to the Formal Methods & Tools group at the University of Twente. Education Katoen received his master's degree with distinction in Computer Science from the University of Twente in 1987. In 1990, he was awarded a Professional Doctorate in Engineering from the Eindhoven University of Technology, and in 1996, he received his Ph.D. in computer science from the University of Twente. Research Katoen's main research interests are formal methods, computer aided verification, in particular model checking, concurrency theory, and semantics, in particular semantics of probabilistic programming languages. His research is largely tool and application oriented. Together with Christel Baier he wrote and published the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
