Tools and Algorithms for the Construction and Analysis of Systems: 16th International Conference, TACAS 2010, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-29, 2010, Proceedings
ETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryandPracticeofSoftware. ETAPSisanannualfederatedconferencethatwas establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual?vesisterconferences(CC, ESOP, FASE, FOSSACS, TACAS), 19 satellite workshops (ACCAT, ARSPA-WITS, Bytecode, CMCS, COCV, DCC, DICE, FBTC, FESCA, FOSS-AMA, GaLoP, GT-VMT, LDTA, MBT, PLACES, QAPL, SafeCert, WGT, and WRLA) and seven invited l- tures (excluding those that were speci?c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers), 130 of which were accepted (10 tool demos), giving an overall acc- tance rateof 26%, with most of the conferencesat around24%. Congratulations thereforetoalltheauthorswhomadeittothe?nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. The events that comprise ETAPS address various aspects of the system - velopmentprocess, including speci?cation, design, implementation, analysisand improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, withaninclinationtowardtheorywithapracticalmotivationonthe one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardwaresystems, and the emphasis on software is not intended to be exclusive. ETAPS is a confederation in which each event retains its own identity, with a separate Programme Committee and proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstraction algorithm analysis antichain applied approach arrival curves automata automaton bit-vector block Boogie Boolean Boolean circuits bound clauses coalgebraic component compute concurrent constraints deﬁned deﬁnition denote diﬀerent domain efﬁcient encoding error example execution exists ﬁnd ﬁnite ﬁrst formula graphs Heidelberg Heidelberg 2010 implementation inﬁnite input integer iteration k-induction leakage Lemma linear linearizability LNCS logic loop macro-state Markov chains method modal modal logic model checking mutual information Nash equilibrium node operations optimization output pair path Petri Nets preemption sealing probabilistic problem procedure proof propagation protocol ranking functions reachability reﬁnement regular expressions relation safety properties satisﬁes scheduler Section semantics sequence simulation SMT solvers solution concept speciﬁcation Springer strategy subset synthesis TACAS techniques termination Theorem thread tool transition transition relation variables veriﬁcation