NEWS
The first female mathematician to receive the prestigious Fields Medal is Maryam Mirzakhani from Stanford University. Mirzakhani said: "I will be happy if it encourages young female scientists and mathematicians. I am sure there will be many more women winning this kind of award in coming years." Mirzakhani was born and raised in Tehran, where as a young girl she dreamed of becoming a writer. By high school, however, her affinity for solving mathematical problems and working on proofs had shifted her sights.
The Kavli Week is celebrating the Kavli Prize with Ceremony Show, Popular science lectures, and academic symposia and lectures by the prize winners. A lot of money are involved, partly sponsored by the Fred Kavli Foundation.
Heidelberg Laureate Forum  Abel, Fields and Turing Laureates Meet the Next Generation. Winners of the prestigious Abel Prize, Fields Medal and Turing Award will meet ambitious young scientists starting with 2327 September 2013.
The Abel Prize in mathematics (with value ~1Mil $) is given this year on 22 May 2012 to Endre Szemeredi, a Hungarian mathematician who worked, among other, in the fields of combinatorics and theoretical computer science.
DEON 2012  11th International Conference on Deontic Logic in Computer Science, is held during 1618 July 2012, at University of Bergen, Norway. Submission deadline is 5 March.
Noam Chomsky in Oslo, two days on 56 September, 2011. Come on 5th from 16:1518 in Sophus Lies auditorium in Blindern campus to hear "The machine, the ghost, and the limits of understanding: Newtons contributions to the study of mind"; and on 6th from 19:00 in
Storsalen (the big room) in Chateau Neuf right near Majorstuen Tstation to hear about "Changing contours of world order".


DEON 2012  11th International Conference on Deontic Logic in Computer Science, is held during 1618 July 2012, at University of Bergen, Norway.
Submission deadline is 5 March.
The Ackermann Award for outstanding dissertation in Logic in Computer Science has started the call for proposals for 2008.
deadline  15 March, 2008.
The DahlNygaardPrize for objectoriented contributions is given at ECOOP'07 to Luca Cardelli and Jonathan Aldrich
T.U.Berlin, Germany
2 August, 2007.
The 19th Nordic Workshop on Programming Theory (NWPT'07)
University
of Oslo, Norway
1012 October, 2007.
1st Workshop on Formal Languages and Analysis of ContractOriented Software.
University
of Oslo, Norway
0910 October 2007.
21st European Conference on ObjectOriented Programming (ECOOP'07)
student volunteer
Berlin, Germany
July 29  August 03, 2007.
2nd Conference on Algebra and Coalgebra in Computer Science (CALCO'07)
CALCO Young Researchers Workshop (CALCOjnr)
Bergen, Norway
2024 August, 2007.


1st Workshop on Formal Languages and Analysis of ContractOriented Software.
Oslo, Norway.
9 October, 2007.
Title: Towards Model Checking Contracts.
Slides
Abstract:
In this paper we present briefly our eforts towards model checking law contracts. Our approach uses the formal actionbased specification language for contracts CL. The actions of the language are well studied and form a algebraic structure for actions found in contracts which are interpreted as guarded rooted trees. The algebra is proven complete with respect to the interpretation as guarded rooted trees. The purpose of the CL language in the model checking process is to restrict the specification of contracts such that to avoid many of the common mistakes and deontic paradoxes. CL is also used to write the properties that one wants to check on the contract. We use a translation of CL into mucalculus in order to obtain the (extended) labeled transition system representing the model of the contract. This is given to the NuSMV tool as input. For now, NuSMV supports only LTLlike properties, so we cannot use our CL to specifiy the properties. The extension of NuSMV in this respect is left for future work. We have used this method on a real contract example between an Internet provider and a client.
2nd Conference on Algebra and Coalgebra in Computer Science
(CALCO’07), Young Researchers Workshop
Bergen, Norway.
20 August, 2007.
Title: An Algebraic Structure for Actions found in Contracts.
Slides
Abstract:
We introduce in this paper an algebra of actions specially tailored to serve as basis of an actionbased formalism for writing electronic contracts. The proposed algebra is based on the work on Kleene algebras but does not consider the Kleene star and introduces a new constructor for modelling concurrent actions. The algebraic structure is resourceaware and incorporates special actions called tests. In order to be in accordance with the intuition behind electronic contracts we consider new properties of the algebraic structure, in particular a conflict relation and a demanding partial order. We also study a canonical form of the actions which, among other things, helps to naturally define a notion of action negation. Our action negation is more general than just negation of atomic actions, but more restricted than the negation involving the universal relation. A standard interpretation of the algebra is given in terms of guarded rooted trees with specially defined operations on them. The algebra is proven to be complete over the standard interpretation.
9th IFIP International Conference on Formal Methods for Open ObjectBased Distributed Systems
(FMOODS’07),
Paphos, Cyprus.
7 June, 2007.
Title: A Formal Language for Electronic Contracts.
Slides
Abstract:
In this paper we propose a formal language for writing electronic contracts, based on the deontic notions of obligation, permission, and prohibition. We take an oughttodo approach, where deontic operators are applied to actions instead of stateofaffairs. We propose an extension of the mucalculus in order to capture the intuitive meaning of the deontic notions and to express concurrent actions. We provide a translation of the contract language into the logic, the semantics of which faithfully captures the meaning of obligation, permission and prohibition. We also show how our language captures most of the intuitive desirable properties of electronic contracts, as well as how it avoids most of the classical paradoxes of deontic logic. We finally show its applicability on a contract example.
Student
sessions on MOdelling and VErifying parallel Processes
(MOVEP’06),
Bordeaux

France,
21
June 2006,
Title: Timed
distributed picalculus.
Slides
Abstract:
We
consider process algebras for modelling distributed systems
with time constraints. For this task we must deal with access to
resources, locations and interaction among processes. We extend the pi
calculus with locations, types and timers. Types are used to restrict
the
access to distributed resources. Timers define both timeouts for
communication
channels and timeouts for capabilities of the communication
channels. We define the operational semantics by using a reduction
relation.
We introduce and study several timed barbed bisimulations.
Dynamics
and structure of biological networks,
MarseilleLuminy,
February
14 
17, 2006,
Title: Modeling
MolNet Systems with Timed Distributed picalculus.
Slides
Abstract:
In
this
work we first present a brief introduction to
the new modeling framework Timed Distributed picalculus (TDpi). It is
based on
the picalculus and combines the resource access restrictions imposed
by a
typing system with time constraints and time coordination aspects. TDpi
is
intended to model distributed systems with time and resource
constraints and
coordination problems. The presentation focuses on the modeling of a
MolNet
system with the new calculus. MolNet is a tool for simulating behavior
of
molecular networks. It has a component based clientserver architecture
with a
mathematical foundation on Dynamic Structure Discrete Event Systems
formalism
in order to simulate the continuous changes in a molecular network. A
MolNet
system is designed as a distributed system with a server coordinating
communications between system components. Discussion about further work
involves the verifier for models described in TDpi and its integration
within
the simulation tool.



LASER Summer School on Software Engineering 2007.
Applied Software Verification  Practical advances towards a Grand Challenge, Directors: Tony Hoare, Bertrand Meyer,
Elba, Italy, 915 September, 2007.

International Summer School Marktoberdorf 2006.
Software
System Reliability and Security. NATO Security Through Science
Committee and Institut fur Informatik, Technische Universitat Munchen,
Germany, 113 August 2006.
 MOdelling and Verifying
parallel Processes (MOVEP’06).
Laboratoire
Bordelais de Recherche enInformatique, Bordeaux, France,
1923 June 2006.
 Course on Security: From Basic
Concepts and Techniques to Formal Models and Methods.
United
Nations University  International Institute for Software Testing
(UNUIIST) and Alexandru I. Cuza University, Iasi, Romania, 48 April
2006.
 Geometry of
Computation 2006 (Geocal06).
The
Geocal06 session consists in an intensive five week series of lectures
and workshops in logic, models and semantics of programming languages,
theory of concurrency... organized by the GEOCAL
group at the CIRM.
One of the main goal of this session is to gather researchers working
in different areas of theoretical science and let them interact,
MarseilleLuminy, Monday January 30  Friday March 3.
 ICCL Summer
School 2005.
Logic
 based Knowledge Representation,Technische Universitat Dresden, 2nd 
17 July, 2005.

