Skip to Content

ICTERI 2012 Invited Talks and Speakers

ICTERI organizers are pleased to announce our distinguished speakers who will give:

ICTERI Keynote Talk: Formal Foundations for RDF Evolution and Repair

Grigoris Antoniou
Keynote Speaker: Prof. Grigoris Antoniou, University of Huddersfield, United Kingdom

Abstract: There are ongoing efforts to provide declarative formalisms of integrity constraints over RDF data. In this context, addressing the evolution of RDF knowledge bases while respecting associated constraints is a challenging issue, yet to receive a full formal treatment. This problem has become more important with the emerge of Linked Open Data, which is based on RDF. Linked Open Data is becoming a key enabler as it is rapidly being taken up by governments and organisations to make their information available and usable, and is the basis of significant economic activity around an emerging "data economy".
In this talk we describe a theoretical framework for dealing with both schema and data change requests, based on the notion a rational change operator as one that satisfies the belief revision principles of Success, Validity and Minimal Change. The semantics of such an operator is subject to customization, by tuning the propertie that a rational change should adhere to. We prove some interesting theoretical results, as well as algorithmic solututions. We then show how the problem of ontology repair can be addressed with similar techniques. And we conclude with a discussion of challenges that need to be addressed to further advance the state of the art.

ICTERI Invited Talk: Abstraction and Verification of Properties of a Rreal-Time Java

Invited Speaker: Prof. Martin Strecker, IRIT-ACADIE, Paul Sabatier University, Toulouse, France

Abstract: The talk will give an overview of ongoing work on verification of concurrent real-time Java programs. Uncontrolled access to shared objects by concurrently executing threads may lead to data incoherencies. We propose to annotate program sections of Java threads with temporal information indicating their activation times. We map this information to Timed Automata (TA) and can then verify by model checking whether the considered program may display resource access conflicts. In our talk, we will describe this approach and present first steps towards a formal verification of the soundness of this abstraction, by modeling the semantics of the formalisms (Java and TA) in a proof assistant.