Gérard Berry’s Home Page – 12/12/2015
11 place Marcelin Berthelot
Tel. +33 1 44 27 10 19
English : Personal page at Collège de France
Médaille d'or du CNRS 2014, cf. https://lejournal.cnrs.fr/articles/gerard-berry-medaille-dor-2014-du-cnrs
CNRS Gold Medal 2014, cf. http://www2.cnrs.fr/en/2453.htm
Discours prononcé aux 350 ans de l'Académie des Sciences
cours et séminaires
2015/2016 ont commencé par un cours spécial "L'importance des langages
en informatique" donné à l'Inria Rennes le 4 novembre 2015, suivi du
séminaire de Thomas Jensen, "Intégration de la vérification formelle
dans les langages de programmation".
Les 6 cours et séminaires suivants auront pour thème "Structures de données et algorithmes pour la vérification formelle". Ils auront lieu à Paris les mercredis de 16h à 18h30, du 9 mars au 13 avril.
2014-2015 : courses and seminars on Wednesdays, 16:00-18:30, theme "Proving Programs : Why, When, and How". see http://www.college-de-france.fr/site/en-gerard-berry/.
English dubbed videos and slides of all 2012-2013, 2013-2014, and 2014-2015 courses and seminars are available at the same address.
Ingénieur général des mines, detached to INRIA Sophia Antipolis until August 31st, 2012
Professor at Collège de France, 2009-2010, annual chair Informatique et sciences numériques (Informatics and Digital Sciences)
Professor at Collège de France, 2007-2008, annual chair Innovation technologique Liliane Bettencourt (Liliane Bettencourt Technology Innovation Chair)INRIA Evaluation Committee, until August 31st, 2012
Dubbed videos of the 2012-2016 courses at Collège de France and of the associated seminars.
Videos of the lectures and associated seminars of the series Seven Keys to the Digital Future, Edinburgh, UK, September 23rd- October 6th (inspired from my courses at Collège de France and organized by Michael Fourman, whom I warmly thank).
0. Revealing Informatics (inaugural lecture)
Nombreuses vidéos de conférences récentes, je ne tiens plus la liste, votre moteur de recherche les trouvera !
Vidéos des cours 2007-2008, 2009-2010 et 2012-2016 au Collège de France et des séminaires associés.
Vidéos du cycle de conférences "Et le monde devint numérique", Universcience, la Cité des sciences, Paris, mai-juin 2011
1. Les racines scientifiques du monde numérique (18 mai 2011)
2. La révolution numérique dans les sciences (25 mai 2011)
3. A la chasse aux bugs, la maladie du certain (8 juin 2011)
Hélas disparue, je la recherche : vidéo de la conférence « Les inversions mentales de la révolution numérique » donnée à Sophia-Antipolis le 31 janvier 2011.
Sur le site du Collège de France, les transparents du cours 2009-2010 sont en format pdf sans les animations. Vous trouverez ici les transparents au format pps, qui préservent toutes les animations. Ils sont lisibles sous PowerPoint, OpenOffice, et d’autres lecteurs gratuits téléchargeables sur le Web
My global research revolves around five fields: mathematical models of computation, associated programming and circuit description languages, implementation of compilers to hardware and software, usage of formal verification systems, and industrial applications.Ecole des Mines de Paris and IRIA was about understanding how to revert the order of recursive computations, for instance by transforming the Fibonnacci recursive algorithm into the iterative one. I proved the optimality in time and space of Rice’s algorithms to compute the Ackerman function as defined by its classical program. In this study, I introduced the notion of a stable function that became fundamental for what followed.
With Jean-Jacques Lévy, I then studied minimal and optimal syntactic computations in recursive programs and in the lambda-calculus. Afterwards, I switched to the full abstraction problem specified by Plotkin and Milner: build a semantical model of PCF (typed lambda-calculus + arithmetic) that exactly contains all functions that are definable by syntactic PCF terms. I first established the syntactic properties of stability and sequentiality of the lambda-calculus, which essentially show that it cannot express parallel computation. I then developed the stable model, which preserves stability in the semantics, unlike for the classical Scott Model.
In 1977, I moved to the new Ecole des Mines site at Sophia-Antipolis. With Pierre-Louis Curien, I developed the sequential algorithm model, where functions are replaced by algorithms that can be presented in two ways: pairs of a stable function and a computation strategy, or programs in a simple kernel sequential programming language. We showed that this model forms a cartesian closed category, hence an non-functional model of the lambda-calculus. With M. Devin and F. Montagnac, we then developed the CDS programming language based of this theory. The study of categories as models of the lambda-calculus was also at the root of the categorical abstract machine (CAM) that started the development of CAML.
In 1982, INRIA opened a new site in Sophia-Antipolis. I created a joint project between Ecole des Mines and INRIA with Gérard Boudol. At that time, I switched to automata theory and real-time programming. With Jean-Paul Rigault and Jean-Paul Marmorat, we gave the initial definition of the new Esterel synchronous programming language dedicated to embedded systems. In cooperation with the Lustre teams of Nicolas Halbwachs and Paul Caspi and the Signal team of Albert Benveniste and Paul Le Guernic, we studied the associated synchronous model of concurrency. I essentially focused the theoretical study on the definition and usage of deterministic preemption structures in this model. With Laurent Cosserat, we developed the fisrt Esterel v1 compiler, soon followed by the Esterel v2 compiler developed with Philippe Couronné. Esterel v2 was based on the adpatation of a fast and beautiful algorithm developed by Ravi Sethi (then at Bell Labs) and myself to translate regular expressions into automata. We conducted industrial experiments at Bertin and Dassault Aviation, where we started a fruitful and longstanding cooperation with Emmanuel Ledinot.
In 1986, we started the development of a much more efficient compiler called Esterel v3, based on decisive fundamental research results by Georges Gonthier. This compiler was then industrialized by the companies Cisi Ingéniérie and ILOG and used by several customers.
In 1990, I joined Jean Vuillemin’s group at Digital Equipment as a part-time consultant. The group was developing the Perle FPGA-based machine and using it as a fast co-processor of alpha-based workstations. It was pretty clear how to develop data-flow hardware designs, but much less clear how to develop complex control-intensive designs. EstereI seemed to be a good language to specify them. I created an efficient direct translation from Esterel to circuits, which was readily implemented in the new Esterel v4 compiler. This new approach also had a decisive impact on software applications of Esterel: generating a circuit simulator in C instead of an explicit finite state machine made it possible to scale up to any application size, completely avoiding the potential exponential code size blow-up of Esterel v3. It also lead to major progress in understanding causality issues in Esterel and relating them to constructive logic. With Tom Shiple, we could show that a combinational cyclic circuit is electrically stable for all delays if and only if its Boolean equations can always be solved by using only constructive propositional logic, i.e., by disallowing usage of the excluded middle law X or not X = true. This lead to a new Esterel v5 compiler, soon followed by a modular version Esterel v6. I also collaborated with Jean Vuillemin and François Bourdoncle to define the Jazz circuit design language. A new and more general version of the theorem initially proved by Shiple and myself has been recently developed with Michael Mendler, using a novel continous time / discrete time temporal logic. The corresponding paper is available here.
In 1999, I started cooperating with Michael Kishinevsky at Intel on extensions of Esterel to be able to define any kind of for-real synchronous circuits. This required the definition of deep extensions of the language to be able to support arbitrary data path and bit manipulation structures. We defined the new Esterel v7 language and studied how to compile it. The language is characterized by a smart arithmetic and bitvector type-checker that automatically ensures optimal sizing of intermediate variables in data paths.
In January 2001, I joined the Esterel Technologies company created in2000, as its Chief Scientist. I directed the implementation of the Esterel v7 compiler (with A. Boulan, L. Arditi, M. Buchholtz, M. Perreaut, B. Pagano, and others). We solved many fundamental and technical problems needed for production usage: extending the language to support multiclock design; supporting a ECO-enabled flow (ECOs are late patches necessary when it has become too expensive to recompile, re-place and re-route the circuit); ensuring safe translation to VHDL and Verilog that are not semantically well-defined languages; linking the compiler with the Esterel Studio graphical interface and with the Prover SL formal verification system; insterting of the tools within complete industrial flows, etc. The Esterel Studio complete design and verification environment has been used in production by ST Microelectronics and Texas Instruments and in research by Intel, Philips (which became NxP), ST Microelectronics, and Texas Instruments. It has also been widely distributed in Esterel Technologies’ academic program.
In 2003, Esterel Technologies acquired SCADE, the leading tool for synchronous avionics development, based on the Lustre Technology developed in Verimag, Grenoble, and used by major avionics companies such as Airbus. I participated in the development of the SCADE language and environment, and, in particular, of the new Scade 6 language that integrates the best of Lustre and Esterel. See www.esterel-technologies.com for more information.
In 2007-2008, I have been selected by Collège de France to occupy the yearly Technology Innovation Chair Liliane Bettencourt, sponsored by the Bettencourt-Schueller Foundation. I decided to give a general audience computer science course called Pourquoi et comment le monde devient numérique (How and Why the World Becomes Digital). The inaugural lecture analyzed why the digitization idea and the fantastic expansion of computers changed the world, and how this change will continue. It also explains the scientific background of this revolution. The inaugural lecture was followed by eight 2-hour video-recorded course / seminar sessions (in French), respectively on algorithms, circuits, programming languages, embedded systems, program verification, networks, images, cryptography, and a conclusion. For each subject, I invited experts from research and industry to give the seminars. The inaugural lecture is also available as a book in French. After the course, I organized a Colloquium on Informatics and Bio-Informatics.
In 2009-2010, I was selected again by Collège de France to occupy the first year of the new yearly chair Informatique et sciences numériques (Computer Science and Digital Sciences), created in partnership with Inria. I taught a course called Penser, modéliser et maîtriser le calcul informatique (Thinking about, modeling, and mastering computation), where I discussed how and why to model automatic computation, from the original sequential models to the current models of parallel computation. The inaugural lecture was followed by eight 2-hours video-recorded course / seminar sessions (in French). The course were about a general view of computability, the lambda-calculus and its semantic models, finite automata, models of concurrency, synchronous languages, and model cooperation. The inaugural lecture is also available as a book in French.
In October 2010, under an invitation by Michael Fourman at University of Edinburg( Informatics Forum), I repeated some courses of the 2007-2008 and 2009-2010 years under the name Seven Keys for the Digital Future. Seven new seminars were given on this occasion, mostly by British scientists (videos available).
I now occupy the new permanent
Languages the first permanent chair in Informatics created by
France. During the fisrt 2 years, I was giving a course anout The Informatics of Time and
du temps et des événements), accompanied by seminars (French,
given by academic researchers and industrial engineers. In 2014-2015, I started a course on
program verification using model-checking and proof-checking
techniques for time- and event-related programs and circuits, using
model checking techniques and Coq-
proof-checking techniques. In 2015-2016, my course were about data
structures and algorithms for automatic formal verification.
March 2009, I am a member
of the Indes INRIA
project, which is dedicated to
diffuse programming, i.e., the global programming of the set of
objects we now have at our disposal: computers, telephones, TVs,
appliances, etc. Safe programming of this network of devices will
cooperation between many sequential and parallel programming models. My
work is about understanding which models are needed where and how to
models cooperate. We are currently developing HipHop,
orchestration language embedded into Manuel Serrano’s
system. Hop is a Scheme-based multi-tier language to develop complex
applications with a single source code for the server and client,
migration and client / servercommunication
fully transparent. It has now evolved into Hopjs, a new extension of
a more familiar programming framework. HipHop is used to orchestrate
activities launched by Hop, by providing a synchronous view and control
of them. See the new papers Multi-tier
programming in Hop (Communications
of the ACM, August 2012, see also ACM Queue
preliminary version) and Hop
and HipHop : Multitier Web Orchestration (proc.
conf., Bubhaneswar). HipHop adds the possibility of
orchestrating complex concurrent behaviors from with Hop. Compared to Esterel, it is a much more
dynamic language, whose programs
are Hop values that can be constructed on the fly and run by an
that implements the constructive causality of Esterel.
HipHop can be used both
on the server and client side
for maximal flexibility. The implementation and language reserach is
performed with Colin Vidal, PhD student at Inria Sophia-Antipolis.
performed together by instrumentists and computers interacting in
real-time has become a standard for contemporary composers. Thanks to
the Antescofo project headed by Arshia Cont,
it has become possible to adapt in real-time the tempo of the
electronic part to the way the humans play, instead of the contrary as
was only possible before. Antescofo is snow used in concerts all over
the world. The Antescofo listening machine detects all of (or most of)
the events provoked by the instrumentists, and this detection may
itself trigger electronic parts. With Arshia's team and the composers Philippe Manoury and Gilbert Nouno,
among others, we are interested in defining new languages making it
possible to write complex algorithmic scores for error-recovery and
resyncchronization strategies to recover from human or listening-engine
mistakes and to smoothly deal with human-directed tempo variations. In
his PhD thesis held in 1015, José Echeveste
developed the current Antescofo language, which is inspired from
synchronous languages such as Esterel. José is now post-doc in my lab,
and we work in close contact with IRCAM.
2009 - 2012 : Director of Research at INRIA Sophia Antipolis.
2009 - 2010 : Professor at Collège de France, Chaire informatique et sciences numériques 2009 / 2010
Course: Penser, modéliser et maîtriser le calcul (Thinking about, modeling, and mastering computation). On line videos of the lectures and seminars (in French).2008 : Professor at Collège de France, Chaire d'Innovation technologique 2007 / 2008
Course: Pourquoi et comment le monde devient numérique (Why and How the World Becomes Digital).
2001 - 2009 : Chief Scientist of Esterel Technologies.
1990 - 2001 : Regular consultant at Digital Equipment, Schneider Electric, Synopsys, Cadence Design Systems, and Intel.
1977 - 2001 : Director of Research at Ecole des Mines de Paris, Sophia Antipolis site. Co-head of a joint project with INRIA Sophia Antipolis.
1979 : Docteur d’Etat in Mathematics at Université Paris VII, option Computer Science.
1970 - 1977 : Researcher at Ecole des Mines de Paris, Paris site.
1970 : Entered Corps National des Ingénieurs des Mines.
1967 : Entered Ecole Polytechnique.
2015- : Member of the Council of HCERES (Haut conseil de l'évaluation de la recherche et de l'enseignement supérieur).
2014- : Member of the board of IRCAM (Institut de recherche et coordination acoustique / musique).
2014- : President of the Council of Education and Research of Ecole Polytechnique.
2012 - : President of the Scientific Council of ESIEE.
2011-2013 : Member of the Scientific Council of IRCAM.
2010-2013 : member of the Scientific Council of UPMC (Université Pierre et Marie Curie).
2010-2014 : Member of the board (conseil d’administration) of ANR (Agence Nationale de la Recherche).
2005 - 2009 : Delegate of the Inter-Section of Applications at Académie des sciences.
2014 : Médaille
d'or du CNRS
2012 : Chevalier de l'Ordre de la Légion d'Honneur.
2008 : Chevalier de l'Ordre du mérite.
2005 : Great Prize of the EADS Foundation for applications of sciences to industry.
2005 : Member, Académie des technologies
2002 : Member, Académie des sciences.
2001 : Nominee, World Technology Awards.
1999 : Science and Defense award.
1994 : Chevalier de l'Ordre des palmes académiques.
1993 : Member, Academia Europaea
1990 : Monpetit Prize of Académie des sciences.
1979 : Bronze medal of C.N.R.S.
Invited speaker for Seven Keys to the Digital Future, set of 8 lectures of Collège de France in English at Informatics Forum, University of Edinburgh, and the Royal Society of Edinburgh, October 2010, see Section 1.1. above.
Invited speaker in 39 international conferences or workshops :
ICDCIT'2014 (Bhubaneshwar) WSS'2013 (Montreal), EMSOFT 2011 (Taipei), DCM 2010 (Edinburgh), LOLA 2010 (Edinburgh), Bits&Chips 2007 (Eindhoven), FMICS 2007 (Berlin), Ada Europe 2007 (Geneva), FDL 2006 (Darmstadt), CSR 2006 (St Petersburg), TACAS'2005 (Edinburgh), VLSI'2004 (Mumbai), ICCAD'2003 (San Jose), HLDVT'2002 (Cannes), SAME'2001 (Sophia Antipolis), CHARME'2001 (Edinburgh), FEMSYS'2001 (Munich), FST&TCS'2000 (New Delhi), ASE'2000 (Grenoble), CHARME'99 (Bad Herrenalb), CONCUR'98 (Nice), POPL'98 (San Diego), DSL'97 (Santa Barbara), CAV'97 (Haifa), CHDL'97 (Toledo), TACAS'97 (Twente), AMAST'96 (Munich), ICSC'95, (Bangkok), IWLS'95 (Lake Tahoe), MFPS'94 (Manhattan, Kansas), LICS'94 (Paris), POPL'94 (Portland), FSTTCS'93 (Bombay), REX'93 (Amsterdam), CONPAR'92 (Lyon), ESEC'91 (Milano), TAPSOFT'90 (Brighton), IFIP'89 (San Francisco), and STACS'86 (Paris).
Invited speaker for the Tata Consultancy Services Distinguished Lecture, 2006 (Pune, India).
Keynote speaker for the IBM Programming Languages Day, 2006 (Yorktownheigths, USA).
Invited speaker at the first Milner Lecture, Edinburgh University, 1996.
Invited speaker at several summer schools : Marktoberdorf 1992 and 2008, Laser 2007, ArtistDesign 2008, and several schools in India, Malaysia, Thailand, etc.
Advisor of 17 PhD theses. President of the Jury of 12 PhD or Habilitation theses. Reviewer of 12 Habilitation theses and of 36 PhD theses, including 4 foreign theses. Jury member of 40 other PhD theses, including 4 foreign theses.
G. Berry. Fayard, collection Collège de France, Oct. 2013. Texte intégral à l'adresse http://books.openedition.org/cdf/3300.
G. Berry. Fayard, Collection Collège de France, Nov. 2009.
G. Berry. Fayard, Collection Collège de France, Jan. 2008.
D. Potop, S. Edwards, and G. Berry. Springer, 2007.The Constructive Semantics of Esterel
G. Berry. Current version Esterel v5_91, june 2000.
Modèles complètement adéquats et stables des lambda-calculs typés
G.Berry. Thèse de Doctorat d'Etat, Université Paris VII (1979).
Calculs Ascendants des Programmes Récursifs.
G.Berry. Thèse de Troisième Cycle, Université Paris VII, 1976.
Parler du temps, mais de façon formelle
G. Berry. Dans le livre Produire le temps, éditeur Hugues Vinet, éditions Hermann, 2014.Multi-tier programming in Hop
M. Mendler, T. Shiple and G. Berry. Formal Methods in System Design, Vol.40, No.3, pp. 283-329, Springer (2012). Available ontline at DOI 10.1007/s10703-012-0144-6.
Le temps élargi: horloges multiples, temps discret et temps continu, résumé des cours.
G. Berry. In Cours et travaux du Collège de France, année 2013-2014. Collège de France, 2014.
Le temps et les événements en informatique, résumé des cours.
G. Berry. In Cours et travaux du Collège de France, année 2012-2013. Collège de France, 2013.
Penser, modéliser et maîtriser le calcul informatique, résumé des cours
G. Berry. In Cours et travaux du Collège de France, année 2009-2010. Collège de France, 2010.
Pourquoi et comment le monde devient numérique, résumé des cours.
G. Berry. In Cours et travaux du Collège de France, année 2007-2008. Collège de France, 2008.
Techniques for Hardware and Software Embedded Systems
G. Berry. In NATO Science for Peace and Security Series - D: Information and Communication Security, vol. 22, Manfred Brot, Wassiou Sitou and Tony Hoare, Eds (2008).
G. Berry. In Next Generation Design and Verification of Distributed Embedded Systems, S. Ramesh and P. Sampath Ed., Springer Verlag (2007).
G. Berry, A. Bouali, X. Fornari, E. Ledinot, E. Nassor, R. de Simone. Science of Computer Programming 36 (2000) 5-25.
G. Berry, E. Sentovich. Formal Methods in Systems Design 17(2), October 2000, Kluwer Academic Publisher.
G. Berry. In Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, editors, MIT Press, Foundations of Computing Series, 2000.
G. Berry. Sadhana, Academy Proceedings in Engineering Sciences, Indian Academy of Sciences, vol. 17, part 1 (1992) 95-130.The Synchronous Programming Language ESTEREL: Design, Semantics, Implementation
G. Berry and G. Gonthier. Science of Computer Programming, vol. 19, no. 2 (1993) 87-152
Esterel on Hardware
G. Berry. Philosophical Transactions Royal Society of London A, vol. 339 (1992) 87-104.
G. Berry and G. Boudol. Theoretical Computer Science, vol. 96 (1992) 217-248.
Incremental development of an HDLC entity in Esterel
G. Berry and G. Gonthier. Comp. Networks and ISDN Systems 22, (1991) 35-49.
A. Benveniste and G. Berry. Proceedings of the IEEE, vol. 79, no. 9 (1991) 1270-1282.
Programmation synchrone des systèmes réactifs : le langage Esterel
G. Berry, Philippe Couronné et Georges Gonthier. Techniques et sciences informatiques, vol.6, n. 4 (1987) 305-316.
Synchronous Programming of Reactive Systems: the Esterel Language
G. Berry, Philippe Couronné, and Georges Gonthier. Technology and Science of Informatics, vol.6, n. 7 (1987) 513-523.
From Regular Expressions to Deterministic Automata
G. Berry and R. Sethi. Theoretical Computer Science 48 (1986) 117-126.
G. Berry, P-L. Curien, and J-J. Lévy. In Algebraic Methods in Semantics, Cambridge University Press (1985) 89-132.
G. Berry and P-L. Curien. In Algebraic Methods in Semantics, Cambridge University Press (1985) 35-88.
Sequential Algorithms on Concrete Data Structures
G. Berry and P-L. Curien. Theoretical Computer Science, vol. 20 (1982) 265-321.
Minimal and Optimal Computations of Recursive Programs
Calculs ascendants du programme d'Ackermann : analyse du programme de J. ArsacG. Berry. RAIRO Informatique théorique, vol. 110, n. 2 (1977).
Bottom-up Computations of Recursive Programs
G. Berry. RAIRO Informatique théorique, vol. 10, n. 3 (1976).Hop and HipHop : Multitier Web Orchestration
G. Berry, C. Nicolas, and M. Serrano. Proc. PLASTIC'11 Workshop, Portland 2011.
An Esterel-based Formal Specification Methodology for Power Management Development
G. Dubost, S. Granier, and G. Berry. Proc SAME'07, Sophia-Antipolis, France, 2007.
L. Arditi, G. Berry, M. Kishinevsky, and M. Perreaut. Proc. Designing Correct Circuits DCC'06, Vienna, Austria.
L. Arditi, G. Berry, and M. Kishinevsky. Proc. Formal Methods in Computer Aided Design (FMCAD'04), Austin, Texas, USA.
G. Berry, M. Kishinevsky, and S. Singh. Proc. ICCAD'03, San Jose.
G. Berry, A. Bouali, J. Dormoy, and L. Blanc. Proc. HLDVT'2001, Cannes.
G. Berry, E. Sentovich. Proc. CHARME'2001, Edinburgh, Correct Hardware Design and Verification Methods, Springer-Verlag LNCS 2144.
Data Path Generation for Esterel Programs
A. Girault and G. Berry. Proc. International Symposium on Signals, Circuits, and Systems, Iasi, Roumanie (1999).
G. Berry. In Correct Hardware Design and Verification Methods, Lecture Notes in Computer Science, vol. 1703 (1999)
Efficient Latch Optimization Using Incompatible Sets
E. Sentovich, H. Toma, and G. Berry. International Digital Automation Conference DAC'97, Anaheim, USA, 1997.
H. Toma, E. Sentovich, and G. Berry. Proc. International Conf. on Computer-Aided Design ICCAD'96.
T. Shiple, G. Berry, and H. Touati. Proc. International Design and Testing Conference IDTC'96, Paris, France (1996).
G.Berry. Proc. FSTTCS'93, Springer-Verlag Lecture Notes in Computer Science 761 (1993) 72-93.
G. Berry, S. Ramesh, and R. K. Shyamasundar. Proc. 20th ACM Conf. on Principles of Programming Languages (POPL), Charleston, Virginia (1993).
G. Berry and H. Touati. Proc. Intl. Workshop on Logic Synthesis, Lake Tahoe, USA (1993).
The Chemical Abstract Machine
G. Berry and G. Boudol. Proc Principles of Programming Languages, ACM Press (1990) 81-94.
G. Berry. Information Processing 89, G.X. Ritter (Ed.), Elsevier Science Publishers B.V., North-Holland (1989) 11-18.
Synchronous Programming of Reactive Systems: an Introduction to Esterel
In Programming of Future Generation Computers, K. Fuchi, M. Nivat (Editors), Elsevier (1988) 35-56.
The Synchronous Programming Language ESTEREL and its Mathematical Semantics
G. Berry and L. Cosserat. In Seminar on Concurrency, Springer-Verlag LNCS 197 (1984) 389-448.
ESTEREL: Towards a Synchronous and Semantically Sound High-Level Language for Real-Time Applications
G. Berry, S. Moisan, and J-P. Rigault. Proc. IEEE Real-Time Systems Symposium, Arlington, Virginia, IEEE Catalog 83CH1941-4 (1983) 30-40.
Programming with Concrete Data Structures and Sequential Algorithms
G. Berry. Proc. ACM Conf. on Functional Programming Languages and Computer Architecture, Wentworth-by-the-sea, USA (1981).
On the Definition of Lambda-calculus Models
G. Berry. Proc. Int. Coll. on Formalization of Programming Concepts, Peñiscola, Spain, Lecture Notes in Computer Science 107, Springer-Verlag (1981) 218-230.
A Survey of Some Syntactic Results in the Lambda-calculus
G. Berry and J-J. Lévy. Proc. Ann. Conf. on Mathematical Foundations of Computer Science, Olomouc, Tchecoslovaquia, Lecture Notes in Computer Science 74, Springer-Verlag (1979).
G. Berry. Proc. 5th Coll. on Automata, Languages and Programming (ICALP), Lectures Notes in Computer Science 62, Springer-Verlag (1978) 72-89.
Séquentialité de l'évaluation formelle des Lambda-expressions
G. Berry. In Program Transformations, 3eme Colloque International sur la Programmation, DUNOD, Paris, B. Robinet ed. (1978) 67-80.
Program Equivalence and Canonical Forms in Stable Discrete Interpretations
G. Berry and B. Courcelle. Proc 3rd Coll. on Automata, Languages and Programming (ICALP), Edinburgh University Press (1976).
TIF, File Interrogation and Transfer System
G. Berry and P. Pietri. Proc. TIMS/ORSA Conference, Atlantic City (1972).