Theoretical Aspects of Computing - ICTAC 2009: 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009, Proceedings
Martin Leucker, Charles Carroll Morgan
Springer Science & Business Media, Jul 29, 2009 - Computers - 357 pages
ThisvolumecontainsthepaperspresentedatICTAC2009:the6thInternational Colloquium on Theoretical Aspects of Computing held August 18–20, 2009 in Kuala Lumpur, Malaysia, hosted by Universiti Kebangsaan Malaysia. The ICTAC series was founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). It brings together practitionersandresearchersfromacademia,industryandgovernmenttopresent results and to exchange ideas and experience addressing challenges in both t- oretical aspects of computing and in the exploitation of theory through me- ods and tools for system development. The series also promotes cooperation in research and education between participants and their institutions, from dev- oping and industrial countries, in accordance with the mandate of the United Nations University. The previous ICTAC colloquia were held in Guiyang, China (2004, LNCS 3407), Hanoi, Vietnam (2005, LNCS 3722), Tunis, Tunisia (2006, LNCS 4281), Macao SAR, China (2007, LNCS 4711), and Istanbul, Turkey (2008, LNCS 5160). This year, 81 submissions were received, distributed over 70 full research papers and 11 tool papers. Each submission was reviewed by at least three P- gram Committee members. We thank the members of the Program Committee and the other specialist referees for the e?ort and skill that they invested in the review and selection process, which was managed using EasyChair. The C- mittee decided to accept 20 papers: 17 full research papers and 3 tool papers.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Abstract action algorithm alphabet analysis atomic atomic action automata automaton axioms BCFG behaviour bisimulation branching computation concurrent conﬁguration conﬂict consider constraints construct context context-free context-free grammars context-free language contextual grammars cycle deadlock deﬁned Deﬁnition denoted derivation diﬀerent eﬀect encoding equivalent example execution ﬁnal ﬁnd ﬁnite ﬁring ﬁrst ﬁrst-order formal formula function given graph guarded recursion hairpin completion Heidelberg HO−f ICTAC iﬀ implementation inﬁnite initial input labeled Lemma linear order LNCS method minimal assumptions modal transition systems model checking model programs modulo multiset nodes operations output Petri Petri net PlusCal polynomial problem proof properties quantiﬁers reachability reﬁnement regular expressions regular language relation represented resource result rewrite rules satisﬁes Section selector semantics sequence sequent calculus Software speciﬁcation Springer subset symbols term test set Theorem TLA+ tree variables veriﬁcation words