11th International Colloquium on Theoretical Aspects of Computing
17-19 September 2014, Bucharest, Romania

Invited Speakers

Cristian Calude

The University of Auckland
New Zealand

Probabilistic solutions to undecidable problems
There is no algorithm which can be applied to any arbitrary program and input to decide whether the program stops when run with that input. This is the (in)famous algorithmically undecidable halting problem. Undecidability is everywhere: in logic, mathematics, computer science, engineering, physics, etc. The talk describes a probabilistic method to solve undecidable problems.

Bio: Cristian Calude holds a personal chair in computer science and is the founding director of the Centre for Discrete Mathematics and Theoretical Computer Science at the University of Auckland, New Zealand. He published more than 250 papers and 10 books in discrete mathematics, computational complexity, algorithmic information theory and quantum physics. He is a member of the Academia Europaea.

Jin-Song Dong

National University of Singapore

Event Analytics
The process analysis toolkit (PAT) integrates the expressiveness of state, event, time, and probability-based languages with the power of model checking. PAT currently supports various modeling languages with many application domains and has attracted thousands of registered users from hundreds of organizations. In this talk, we will present the PAT system and its vision on "Event Analytics" (EA) which is beyond "Data Analytics". The EA research is based on applying model checking to event planning, scheduling, prediction, strategy analysis and decision making. Various EA research directions will be discussed.

Bio: Jin-Song Dong received Bachelor (1st hon) and PhD degrees in Computing from University of Queensland in 1992 and 1996. From 1995 to 1998, he was research scientist at CSIRO in Australia. Since 1998 he has been in the School of Computing at the National University of Singapore (NUS) where he is currently Associate Professor. He is the deputy director of Singapore-French joint Research lab IPAL. Jin Song is on the editorial board of ACM Transaction on Software Engineering and Methodology and Formal Aspects of Computing. He has been general/program chair for a number of international conferences, including the general chair of 19th FM 2014 in Singapore. Jin Song has been a Visiting Fellow (2006) at Oxford University, UK, and a Visiting Professor (since 2009) at National Institute of Informatics, Japan. Outside of work, he plays competitive tennis and coaches top ranked junior players in Singapore (including his own 3 kids). He also developed Markov Decision Process (MDP) models for tennis strategy analysis in PAT with a special case study on Federer vs Nadal.

Razvan Diaconescu

Institute of Mathematics of Romanian Academy

From universal logic to computer science, and back
Universal logic is a general approach to logic, free of any commitment to particular logical systems, rooted in the works by early logicians such as P. Herz, A. Tarski, etc. It has been coined as a specific research area in logic only over the past decade or so, and today many consider it as a true renaissance of mathematical logic, a feeling which is also reflected by the high dynamics of the UNILOG events and publications. More that three decades ago, computer science has started its own form of universal logic, known as the institution theory of Goguen and Burstall, in response to the explosion in the population of logical systems in logic based computer science, most notably formal specification and declarative programming. In this presentation, we will recall some important ideas that have shaped the success of institution theory in computer science. Moreover, we will show how insights from computer science have led, through institution theory, to sometimes drastic reformation and novel understandings of important logic concepts, to new important results in logic. Far from being only a mere consumer of foundations, computer science is also one of the most original contributors to logic, institution theory being now a major player on the universal logic scene.

Bio: Razvan Diaconescu received his DPhil degree in Mathematical Sciences, Computation, from Oxford in 1994 under the supervision of late Professor Joseph Goguen. Between 1996-2000, he held a research chair at Japan Advanced Institute for Science and Technology, where he worked as designer of the new generation algebraic specification language CafeOBJ. Since 2001, Razvan Diaconescu holds a Research Professor position at Simion Stoilow Institute of Mathematics of the Romanian Academy. Between 2002-2011, he was Director of the Informatics Department of "Școala Normală Superioară București". Razvan Diaconescu has received several international awards, has been invited speaker to various international conferences (most notably at the 2nd Universal Logic Congress at Xi'an in 2007) and is on the editorial board of different international journals and book series, including Studies in Universal Logic at Springer. His research interests navigate around logic and its applications to computing, especially to formal specification, in the tradition of Joseph Goguen.