CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004, ProceedingsPhilippa Gardner, Nobuko Yoshida Springer Science & Business Media, 2004. gada 19. aug. - 528 lappuses This volume contains the proceedings of the 15th International Conference on Concurrency Theory (CONCUR 2004) held in the Royal Society, London, UK, from the 31st August to the 3rd September, 2004. ThepurposeoftheCONCURconferencesistobringtogetherresearchers, - velopersandstudentsinordertoadvancethetheoryofconcurrencyandpromote its applications. Interest in this topic is continually growing, as a consequence of theimportanceandubiquityofconcurrentsystemsandtheirapplications, andof the scienti'c relevance of their foundations. The scope covers all areas of sem- tics, logics, and veri'cation techniques for concurrent systems. Topics include concurrency-related aspects of: models of computation, semantic domains, p- cess algebras, Petri nets, event structures, real-time systems, hybrid systems, - cidability, model-checking, veri'cation techniques, re'nement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, tools and environments for programming and veri'cation. This volume starts with four invited papers from Sriram Rajamani, Steve Brookes, Bengt Jonsson and Peter O'Hearn. The remaining 29 papers were - lected by the program committee from 134 submissions, a record number of submissions to CONCUR. The standard was extremely high and the selection di'cult. Each submission received at least three reports, reviewed by the p- gram committee members or their subreferees. Once the initial reviews were available, we had 16 days for paper selection and con'ict resolution. We would like to thank all members of the CONCUR 2004 Program Committee for their excellent work throughout the intensive selection process, together with many subreferees who assisted us in the evaluation of the submitted papers. |
No grāmatas satura
1.–5. rezultāts no 85.
2. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
3. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
4. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
7. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
9. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Invited Papers | 1 |
A Semantics for Concurrent Separation Logic | 16 |
A Survey of Regular Model Checking | 35 |
Resources Concurrency and Local Reasoning | 49 |
Accepted Papers | 68 |
An UnfoldingBased Approach | 83 |
The Pros and Cons of Netcharts | 99 |
Basic Theory of Reduction Congruence for Two Timed Asynchronous | 115 |
Reversible Communicating Systems | 292 |
Parameterised Boolean Equation Systems | 308 |
An Extensional Spatial Logic for Mobile Processes | 325 |
Timed vs TimeTriggered Automata | 340 |
Expressiveness and Reachability | 355 |
A General Approach to Comparing InfiniteState Systems with Their | 371 |
Model Checking Timed Automata with One or Two Clocks | 387 |
On Flatness for 2Dimensional Vector Addition Systems with States | 402 |
Characterizing EF and EX Tree Logics | 131 |
MessagePassing Automata Are Expressively Equivalent to EMSO Logic | 146 |
Symbolic Bisimulation in the Spi Calculus | 161 |
A Symbolic Decision Procedure for Cryptographic Protocols with Time | 177 |
Deciding Probabilistic Bisimilarity Over InfiniteState Probabilistic | 193 |
A Minimal Aspect Calculus | 209 |
Type Based Discretionary Access Control | 225 |
Elimination of Quantifiers and Undecidability in Spatial Logics | 240 |
Modular Construction of Modal Logics | 258 |
Verification by Network Decomposition | 276 |
Compiling Pattern Matching in JoinPatterns | 417 |
Model Checking Restricted Sets of Timed Paths | 432 |
The True Concurrency of Innocence | 448 |
Open Maps Alternating Simulations and Control Synthesis | 466 |
Probabilistic Event Structures and Domains | 481 |
Session Types for Functional Multithreading | 497 |
A Higher Order Modal Fixed Point Logic | 512 |
529 | |
Citi izdevumi - Skatīt visu
CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK ... Philippa Gardner Ierobežota priekšskatīšana - 2004 |
CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK ... Philippa Gardner,Nobuko Yoshida Ierobežota priekšskatīšana - 2011 |
Bieži izmantoti vārdi un frāzes
abstract action algorithm allows applied assume asynchronous automata basic bisimulation bound called channel clocks closed complete composition Computer Science concurrent configurations consider consists constraints construction contains corresponding decidable defined Definition denote describe environment equation equivalence event event structure example execution exists expressive extended finite first formal formula function given graph holds introduce labelled language Lemma LNCS logic match modal model checking names Note notion observations obtain occur operators pair parallel path pattern possible present probabilistic problem proof properties Proposition prove reachability reduction regular relation represent requires resource respectively restriction rules satisfying semantics sequence specification step structure symbolic syntax Theorem thread trace transition transition systems tree valuation variables VASS verification volume write