Alain Finkel – författare

This volume contains the proceedings of the conference on Computer-Aided Veric ation (CAV 2001),held in Paris, Palaisde laMutualit e, July 18{22,2001. CAV 2001 was the 13th in a series of conferences dedicated to the advan- ment of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. The CAV conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical veri cation tools and algorithms and techniques needed for their implemen- tion. ProgramCommitteeofCAV 2001 Rajeev Alur (Penn. &Bell labs) Bengt Jonsson (Uppsala) Henrik Reif Andersen (Copenhagen) Robert Kurshan (LucentBellLabs) G erard Berry (EsterelT. ,co-chair) Kim G. Larsen (Aalborg) Randy Bryant (CMU) Ken Mc Millan(Cadence) Jerry Burch (Cadence) Kedar Namjoshi (Belllabs) Ching-Tsun Chou (Intel) Christine Paulin-Mohring (Orsay) Edmund Clarke (CMU) Carl Pixley (Motorola) Hubert Comon (LSV& Stanford, co-chair) Kavita Ravi (Cadence) David Dill (Stanford) Natarajan Shankar (SRI) E. Allen Emerson (Austin) Mary Sheeran (Chalmers &Prover T. ) Alain Finkel (LSV,co-chair) Tom Shiple (Synopsys) Patrice Godefroid (Belllabs) A.

This volume gives the proceedings of the ninth Symposium onTheoretical Aspects of Computer Science (STACS). Thisannual symposium is held alternately in France and Germanyand is organized jointly by the Special Interest Group forFundamental Computer Science of the Association Francaisedes Sciences et Technologies de l'Information et desSyst mes (AFCET) and the Special Interest Group forTheoretical Computer Science of the Gesellschaft f}rInformatik (GI).The volume includes three invited lectures and sections onparallel algorithms, logic and semantics, computationalgeometry, automata and languages, structural complexity,computational geometry and learning theory, complexity andcommunication, distributed systems, complexity, algorithms,cryptography, VLSI, words and rewriting, and systems.

This volume contains the proceedings of the tenth annualSymposium on Theoretical Aspects of Computer Science (STACS'93), held in W}rzburg, February 25-27, 1993.The STACS symposia are held alternately in Germany andFrance, and organized jointly by the Special Interest Groupfor Theoretical Computer Science of the Gesellschaft f}rInformatik (GI) and theSpecial Interest Group for AppliedMathematics of the Association Francaise des Sciences etTechnologies de l'Information et des Syst mes (afcet).The volume includes the three invited talks which opened thethree days of the symposium: "Causal and distributedsemantics for concurrent processes" (I. Castellani),"Parallel architectures: design and efficient use" (B.Monien et al.), and "Transparent proofs" (L. Babai). Theselection of contributed papers is organized into parts on:computational complexity, logic in computer science,efficient algorithms, parallel and distributed computation,language theory, computational geometry, automata theory,semantics and logic of programming languages, automatatheory and logic, circuit complexity, omega-automata,non-classical complexity, learning theory and cryptography,and systems.

This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.