TRACES: Eighteen Years of Collaboration with Jan Małuszyński and more… February 1rst, 2008.

Slides:



Advertisements
Similar presentations
POWER LIFTING Daniel DANGOUMAU Champion de France Master en – de 90kg
Advertisements

POWER LIFTING Daniel DANGOUMAU Champion de France Master en – de 90kg
Jeremy S. Bradbury, James R. Cordy, Juergen Dingel, Michel Wermelinger
Introduction to Object Orientation System Analysis and Design
1 Knowledge Representation Introduction KR and Logic.
World LP Gas Forum 2009 Brazil Launch 17th December 2008 São Paulo.
POWER LIFTING Daniel DANGOUMAU Champion de France Master en – de 90kg 2007 Pontivy.
Automated Theorem Proving Lecture 1. Program verification is undecidable! Given program P and specification S, does P satisfy S?
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California
Language Technologies Reality and Promise in AKT Yorick Wilks and Fabio Ciravegna Department of Computer Science, University of Sheffield.
Destination Europe Testimonial : « An American in Paris » San Francisco, 6-7 December 2012 CHOICE : geographical mobility as a (belated, and successful.
Origin of the Severance Tax February 2, Origin of the State Severance Tax Gross Sales Tax Law The fairest tax replaced a tax on corporate.
Types and Programming Languages Lecture 7 Simon Gay Department of Computing Science University of Glasgow 2006/07.
A Case Study publication for dissemination and staff development Richard Atfield Assistant Director, BMAF Richard Atfield Assistant Director, BMAF New.
Turning Around 1,000 Schools: The Story of Success for All Kristin Anderson Moore Lecture Child Trends Robert E. Slavin Johns Hopkins University.
Through the years… JUNIATA COLLEGE FIELD HOCKEY. SeasonCoachRecord 1973Unknown Jo Reilly Alexa Fultz Alexa Fultz Nancy Harden-Latimore4-4-1.
Presented By: Sile Corbett Supervisor: Dr. Catriona Murphy Authenticity within Tourism - A case study perspective 1.
From Delft into Almere Prof.dr.ir.Taeke M. de Jong.
Janice S. Dorman, PhD University of Pittsburgh School of Nursing
1 Logic Programming School of Informatics, University of Edinburgh Logic Programming in 50 Minutes The purpose of this lecture is to explain why logic.
COMPUTER B Y : L K. WINDOWS INFORMATION B Y : L K.
Semantics Static semantics Dynamic semantics attribute grammars
1. An Overview of Prolog.
Logic Programming Automated Reasoning in practice.
1 Deransart, Ducassé, Ferrand WLPE Observational Semantics of the Prolog Resolution Box Model Pierre Deransart, Mireille Ducassé, Gérard Ferrand.
Transforming Context-Free Grammars to Chomsky Normal Form 1 Roger L. Costello April 12, 2014.
ISBN Chapter 3 Describing Syntax and Semantics.
CS 355 – Programming Languages
Language Specfication and Implementation - PART II: Semantics of Procedural Programming Languages Lee McCluskey Department of Computing and Mathematical.
The Semantic Web Week 13 Module Website: Lecture: Knowledge Acquisition / Engineering Practical: Getting to know.
Programming Language Semantics Mooly SagivEran Yahav Schrirber 317Open space html://
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 18 Program Correctness To treat programming.
Semantics with Applications Mooly Sagiv Schrirber html:// Textbooks:Winskel The.
CS 330 Programming Languages 09 / 16 / 2008 Instructor: Michael Eckmann.
Formal Aspects of Computer Science – Week 12 RECAP Lee McCluskey, room 2/07
Describing Syntax and Semantics
Slides 00 1 Advanced Logics Part 1: Lambda Calculus and Type Theory Lecturer: Lim Yohanes Stefanus Part 2: Modal Logic Lecturer: Gregory Wheeler.
Writing an “A” Paper.
1. Motivation Knowledge in the Semantic Web must be shared and modularly organised. The semantics of the modular ERDF framework has been defined model.
1 Pierre Deransart WLPE 061 On Using Tracer Driver for External Dynamic Process Observation Pierre Deransart WLPE 2006.
Constructing a Reasoned Argument argument.ppt
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
Introduction to Formal Methods Based on Jeannette M. Wing. A Specifier's Introduction to Formal Methods. IEEE Computer, 23(9):8-24, September,
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
CS 363 Comparative Programming Languages Semantics.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
CMPT 880/890 The Scientific Method. MOTD The scientific method is a valuable tool The SM is not the only way of doing science The SM fits into a larger.
CS4026 Formal Models of Computation Part II The Logic Model Lecture 2 – Prolog: History and Introduction.
1. 2 Preface In the time since the 1986 edition of this book, the world of compiler design has changed significantly 3.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
ISBN Chapter 3 Describing Semantics.
Chapter 3 Part II Describing Syntax and Semantics.
Semantics In Text: Chapter 3.
Formal Specification: a Roadmap Axel van Lamsweerde published on ICSE (International Conference on Software Engineering) Jing Ai 10/28/2003.
Inferring Declarative Requirements Specification from Operational Scenarios IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 24, NO. 12, DECEMBER, 1998.
What’s Ahead for Embedded Software? (Wed) Gilsoo Kim
Invitation to Computer Science, Java Version, Second Edition 1 Logic Programming Logic programming  Various facts are asserted to be true  On the basis.
IFIP TC5 Working Group 5.4 Computer Aided Innovation Objectives: The Working Group will: – Identify the different existing approaches – Share opinions,
CMPB454 ARTIFICIAL INTELLIGENCE (AI) CHAPTER 1.1 Background Information CHAPTER 1.1 Background Information Instructor: Alicia Tang Y. C.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
CSCI 383 Object-Oriented Programming & Design Lecture 15 Martin van Bommel.
Sub-fields of computer science. Sub-fields of computer science.
Matching Logic - A New Program Verification Approach -
Lecture 5 Floyd-Hoare Style Verification
Programming Languages
Programming Languages 2nd edition Tucker and Noonan
Programming Languages 2nd edition Tucker and Noonan
Presentation transcript:

TRACES: Eighteen Years of Collaboration with Jan Małuszyński and more… February 1rst, 2008

TRACES: Eighteen Years of Collaboration with Jan Małuszyński and more…

Pierre Deransart INRIA Rocquencourt (France) A hard work on my own memory …

Mes vieillards vivaient dans un monde virtuel beaucoup plus fou que nimporte quel fou de jeux video. p254

but also …

What is a trace ? An unbounded sequence of trace events of the form (t, a t, S t ) t: timestamp. Time of the event a t : kind of event S t the actual state

TRACES: key events 1982 first encounter at first ICLP, Marseille 1985 Relating LP and Attribute Grammars (JLP) 1988 lauching PLILP conference serie at Orléans 1993 Grammatical View of LP (MIT Press) 1997 Launching DiSCiPl Esprit Project in Paris 2000 CP analysis tools (Springer) 2007 Meeting at Dresden and Munich … traces

TRACES are like this… (1984) ICLP Uppsala (1982) ICLP Marseille (WS 1983)

TRACES are like this… (2000) (1993) (1988) PLILP

TRACES are also like this…

Trace is also a story I will try to remember…

Our story starts for me at Bonas in 1980 (a seminar center located in an old castle restored by Jean-Claude Simon in 1972) International Workshop on Program Construction A.Biermann, G.Guiho, Y.Kodratoff eds, 1980 ( )

A strong debate ?…. Thesis: « Prolog is purely declarative, since one has just to write axioms in FOL (just Horn clauses)… It works like an executable specification language, and there is nothing to prove about it» Surprise: …. « Which kind of miracle is this …. !?!! » Hervé Gallaire Michel Sintzoff

If Prolog is the Answer, what is the Question? or What it Takes to Support AI Programming Paradigms Daniel G. Bobrow, 1985 IEEE Transactions on Software Engineering V11 I11

For me (at this moment) the answer was clear: LP can be used as formal specification language, but to use this paradigm and to take all benefits from the « logical view », a specific methodology has to be invented

1975 Coming back from Brazil, starting to work on AG 1982 First « Séminaire de Programmation en Logique », Perroz-Guirrec 1983 Logical Attribute Grammars. IFIP Congress Paris 1985 Détection d'erreurs en programmation en logique with G. Ferrand, SPLT 1987 Formal Specification of Standard Prolog, with GRichard and C.Moss, SPLT 1988 Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and LP, with B.Courcelle, Inf &Control 1988 Attribute Grammars: Definitions, Systems, and Bibliography (LNCS) 1988 First PLILP, Orléans 1989 Methodological View of LP with Negation, with G. Ferrand 1991 NSTO Programs, with G. Ferrand and M. Téguia, ISLP, San Diego 1992 Proof Method of Partial Correctness and Weak Completeness for Normal LP, with G. Ferrand, JICSLP, Washington, JLP An Operational Formal Definition of Prolog: A specification Method and Its Application, with G. Ferrand, New Generation Computing 1993 Proof Methods of Declarative Properties of Definite Programs, TCS Traces with Gérard

First ICLP, Marseille, Pierre and Jans first encounter 1983 Modeling Data Dependencies in LP by Attribute Schemata, Perroz-Guirrec 1985 Relating Logic Programs and Attribute Grammars, JLP First PLILP, Orléans, with B. Lorho 1988 A Grammatical View of Logic Programming, PLILP 1989 (Lauching WAGA) 1990 Second PLILP, Linköping A Grammatical View of Logic Programming, The MIT Press 1996 Jan spends one sabbatical year at INRIA 1996 Une méthode de preuve pour programmes concurrents avec contraintes sous forme clausale, with Pascal Chambre, JFPLC 2000 Analysis and Visualization Tools for Constraint Programming, Springer Traces with Jan (common actions and publications)

To summarize 1974: Great discovery: use of Definite Clauses for Programming. Write axioms P on relations p and make constructive proofs of p(t) P |= t p(t) and the Robinsons resolution constructs the witness t Our approach focused on this property, trying to keep logic programming practice logical. It was based on these two ideas: the interest of LP lies in the possibility to treat separatly declarative semantics (logic) and operational semantics (control) negation without explicit specification of falsity (non constructive, 3-valued WF semantics)

To summarize Our work was on foundations (relationships with AG), methodology (how to keep logic in LP), non constructive negation (WFS) Present route: AG? Prolog is operational, negation is constructive….

What do we (I) learn from these traces? Main stream publications with GF and JM We never published all three together One sequence, almost with G. Ferrand on methodology for LP based on correctness/completeness proofs first for DCP then for NLP formulated in the framework of LP and based on well-founded models Another sequence, almost with Jan Maluszynski on methodology too, but based on relationships with AG, showing how many aspects of LP (dependencies, proofs, NSTO) could be grounded in AG.

I tried to figure out why? Was Orléans (100 km south from Rocquencourt) too far from Linkoeping? The sole very differences: Publications: « papers » with Gérard, « books » with Jan … Foundations: « Trees » with Gérard, « AG » with Jan Then (after 2000) Jan: « proofs» Pierre: « traces »

TRACES: 18 years, after … Pierre 2000 Book on CP analysis tools (Springer) OADimPPaC French RNTL Project: Generic traces for CP solvers analysis Jan 2000 Book on CP analysis tools (Springer) Rewerse Esprit Project Reasoning on the Web with Rules and Semantics

« Leave traces, not proofs, only traces give dreams » René Char Poet ( )

Some personal thanks To the department, Direction and managment, for the multiple invitations to stay and the very inspiring atmosphere…

Some personal thanks Günter Riedewald and family Bernard Lohro (1975) Wlodzimierz Drabent (Attribute Grammars)

Logic Programming H. Gallaire (2004), J. Cohen, A. Robinson, K. Furukawa (1996) A. Colmerauer (2000) Some personal thanks

JFPLC 97, Orléans, Ferrand Gérard with A.Robinson Some personal thanks John Lloyd WS 83 ICLP 84, Alan Robinson Jan Komorowski (TF 95)

Trégastel 1985 Some personal thanks

Roger Scowen Chris Moss Pascal Chambre Sophie Renault Arnaud Lallouet Alexandre Tessier Michel Tégia Bruno Dumant Michel Bergère AbdelAli Ed-Dbali Roberto and Mariza Bigohna (work on HyperPro) Michel Van Caneghem 1983 LP and specif

Some very personal thanks To my children (1987) Knuth, invited at WAGA (1989) (about inherited attribute example): « Insanity is hereditary, you get it from your kids »

Some very special thanks thanks Jan and Malgosza !