Keynote speakers

Tevfik Bultan (FORTE/FMOODS keynote speaker)

Analyzing Interactions of Asynchronously Communicating Software Components

Tevfik BultanAbstract: Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several application domains, message-based communication is used as the interaction mechanism, and the communication contract among the components of the system is specified semantically as a state machine. In the service-oriented computing domain this type of message-based communication contracts are called “choreography” specifications. A choreography specification identifies allowable ordering of message exchanges in a distributed system. A fundamental question about a choreography specification is determining its realizability, i.e., given a choreography specification, is it possible to build a distributed system that communicates exactly as the choreography specifies? In this talk we will discuss this problem and its application to web service choreographies, Singularity OS channel contracts, and UML collaboration (communication) diagrams.

Bio: Tevfik Bultan is a Professor in the Department of Computer Science at the University of California, Santa Barbara (UCSB). His current research interests are: web software and services, dependability, concurrency, automated verification, static analysis, and software engineering. Tevfik Bultan has more than 100 research publications in the areas of software engineering, automated verification, program analysis and service oriented computing. Tevfik Bultan has served on more than 50 technical program committees. He has served as the vice chair of the Department of Computer Science at UCSB from 2005 to 2009. He developed and taught a Capstone class that is based on industry-sponsored projects, and he established the first Distinction in the Major Program in the College of Engineering at UCSB.

Gian Pietro Picco (COORDINATION keynote speaker)

Of Tuples, Towers, Tunnels, and Wireless Sensor Networks

Gian Pietro PiccoAbstract: Wireless sensor networks (WSNs) have been around for more than a decade. They are distributed systems made of tiny, resource-scarce, often battery-powered devices that cooperate towards distributed monitoring and control. Their small size, autonomy, and flexibility has placed them to the forefront of pervasive computing scenarios. Yet, their programming is still largely carried out by using directly the low-level primitives provided by the operating system. This approach steers the programmer away from the application, hampers reusability and decoupling, and ultimately makes development unnecessarily complex.
In this talk, we report about our research efforts in simplifying WSN programming through the notion of tuple space, embodied in a middleware called TeenyLime. As the name implies, TeenyLime borrows the transiently shared tuple space model introduced by the Lime middleware for mobile ad hoc networks, but also deeply revisits it to match the peculiar characteristics of WSNs, e.g., to deal with the limited resources of WSN nodes and to provide additional visibility and control on the lower levels of the stack. TeenyLime was indeed designed as a thin veneer atop the basic OS communication facilities, to support the development of both the application logic and system tasks such as routing.
TeenyLime and its particular incarnation of the tuple space concept proved successful in developing several real-world applications where the WSN was deployed for a long time, in an operational setting, and most importantly to fulfill the needs of real users. This talk reports about two of these experiences: the structural health monitoring of a medieval tower, and the closed-loop control of adaptive lighting of a road tunnel. Facing real-world challenges forced a redesign of the TeenyLime implementation, but left its original abstractions essentially unaltered. As expected, the higher level of abstraction provided by TeenyLime w.r.t. using directly the OS primitives resulted in a significant reduction of the source code size, hinting at a lower burden on the programmer. Less expected, it also resulted in a smaller binary size, therefore enabling one to pack more functionality on the resource-scarce WSN nodes. Ultimately, these experiences clearly showed that it is possible to simplify the chore of programming WSN applications without sacrificing their performance and efficiency. TeenyLime is available as open source at

Bio: Gian Pietro Picco is a Professor and Head of the Department of Information Engineering and Computer Science (DISI) at the University of Trento, Italy. The goal of his current research is to ease the development of modern distributed systems through the design and implementation of appropriate programming abstractions and of communication protocols efficiently supporting them. His work spans the research fields of software engineering, middleware, and networking, and is oriented in particular towards wireless sensor networks, mobile computing, and large-scale distributed systems. He served as Program Co-chair in COORDINATION 2005. In 2007, at the Int. Conf. on Software Engineering (ICSE’07) he was the recipient of the “Most Influential Paper from ICSE’97″ Award. Other awards include a Best Paper Award at the IPSN conference in 2009 and 2011, and the Mark Weiser Best Paper Award at PerCom in 2012.  He is a member of the editorial board of ACM Trans. on Sensor Networks (TOSN).

Roberto Baldoni (DAIS keynote speaker)

Tracking the past, defending the present and predicting the future: toward a trustworthy cyber space

Roberto BaldoniAbstract: Ensuring the trustworthiness of the cyber space of an organization is a multifacets and multidisciplinary problem, it includes, among the others, the protection of the information and communication assets of an organization from cyber threats and from possible insiders. This protection requires to work on all time axis (present, past and future) analyzing and correlating events occurring inside and outside the organization in order to track the source of an intrusion, to have a current operational picture and to predict new vulnerabilities. The keynote will address this issue by looking at (technical and legal) requirements of such problem, then will analyze computational models necessary for ensuring such protection including big data analysis, cloud and social networks. Examples will be discussed and analyzed.

Bio: Roberto Baldoni is Full Professor at the Department of Computer, Control and Management Engineering “Antonio Ruberti”, Università degli Studi di Roma “La Sapienza”, Italy, and is the Director of the Research Center of Cyber Intelligence and Information Security. Roberto Baldoni conducts research (from theory to practice) in the fields of distributed, pervasive and p2p computing, middleware platforms and information systems infrastructure with a specific emphasis on dependability and security aspects. He is the founder of MIDdleware LABoratory (MIDLAB) and he has been PI of many national and european research projects. Roberto Baldoni has been visiting researcher at INRIA, Cornell Univ. and EPFL. He regularly participates and chairs committees of premiership international conferences and workshops. Recently, he has been General Chair of OPODIS 2012, of ACM DEBS 2008. From Jan. 1st 2013, Roberto Baldoni is Chair of the IEEE committee on Dependable Computing and Fault Tolerance and Chair of the Steering Committee of the International Conference on Dependable Systems and Networks. He is also member of the IFIP WG 10.4, member of the steering committees of ACM DEBS, and member of the editorial boad of IEEE Transactions on Parallel and Distributed Systems.