Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

New for: D1, D2, D3, D4, D5
<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Decidable Verification of Database-powered Business Processes
Speaker:Prof. Alin Deutsch
coming from:University of California, San Diego
Speakers Bio:Alin Deutsch is a professor of computer science at the University of California, San Diego.

His research is motivated by the data management challenges raised by applications that
are powered by underlying databases (viewed in a broad sense that includes traditional database
management systems but also collections of semi- and un-structured data providing a query interface,
however rudimentary).

Alin's education includes a PhD degree from the University of Pennsylvania, an MSc degree from the
Technical University of Darmstadt (Germany) and a BSc degree from the Polytechnic University Bucharest (Romania).
He is the recipient of a Sloan fellowship and an NSF CAREER award, and has served as PC chair of
the ICDT-2012 International Conference on Database Theory, the PLANX-2009 Workshop on
Programming Language Techniques for XML, and the WebDB-2006 International Workshop on the Web and Databases.

Event Type:SWS Distinguished Lecture Series
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Monday, 24 February 2014
Duration:60 Minutes
This talk addresses the static verification problem for data-centric business

processes, using as vehicle the “business artifact” model recently deployed by
IBM in commercial products and consulting services, and studied in an increasing
line of research papers.

Artifacts are records of variables that correspond to business-relevant
objects and are updated by a set of services equipped with pre-and post-conditions
that implement business process tasks. For the purpose of this talk, the verification
problem consists in statically checking whether all runs of an artifact system satisfy
desirable properties expressed in (some first order extension of) a temporal logic.

The talk surveys results that identify various practically significant classes of business artifact
systems with decidable verification problem.
The talk is based on a series of prior and current work conducted jointly with
Elio Damagio, David Lorant, Yuliang Li, Victor Vianu (UCSD), and Richard Hull (IBM TJ Watson).

Name(s):Vera Laubscher
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:YesTo Location:Saarbrücken
To Building:E1 5To Room:029
Meeting ID:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Vera Laubscher, 06/29/2015 10:23 AM
  • Vera Laubscher, 02/20/2014 08:57 AM
  • Vera Laubscher, 02/19/2014 10:36 AM -- Created document.