Abstract is missing.
- Zing: Exploiting Program Structure for Model Checking Concurrent SoftwareTony Andrews, Shaz Qadeer, Sriram K. Rajamani, Yichen Xie. 1-15 [doi]
- A Semantics for Concurrent Separation LogicStephen D. Brookes. 16-34 [doi]
- A Survey of Regular Model CheckingParosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena. 35-48 [doi]
- Resources, Concurrency and Local ReasoningPeter W. O Hearn. 49-67 [doi]
- Resource Control for Synchronous Cooperative ThreadsRoberto M. Amadio, Silvano Dal-Zilio. 68-82 [doi]
- Verifying Finite-State Graph Grammars: An Unfolding-Based ApproachPaolo Baldan, Andrea Corradini, Barbara König. 83-98 [doi]
- The Pros and Cons of NetchartsNicolas Baudru, Rémi Morin. 99-114 [doi]
- Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-CalculiMartin Berger. 115-130 [doi]
- Characterizing EF and EX Tree LogicsMikolaj Bojanczyk, Igor Walukiewicz. 131-145 [doi]
- Message-Passing Automata Are Expressively Equivalent to EMSO LogicBenedikt Bollig, Martin Leucker. 146-160 [doi]
- Symbolic Bisimulation in the Spi CalculusJohannes Borgström, Sébastien Briais, Uwe Nestmann. 161-176 [doi]
- A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract)Liana Bozga, Cristian Ene, Yassine Lakhnech. 177-192 [doi]
- Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic SystemsTomás Brázdil, Antonín Kucera, Oldrich Strazovský. 193-208 [doi]
- µABC: A Minimal Aspect CalculusGlenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely. 209-224 [doi]
- Type Based Discretionary Access ControlMichele Bugliesi, Dario Colazzo, Silvia Crafa. 225-239 [doi]
- Elimination of Quantifiers and Undecidability in Spatial Logics for ConcurrencyLuís Caires, Étienne Lozes. 240-257 [doi]
- Modular Construction of Modal LogicsCorina Cîrstea, Dirk Pattinson. 258-275 [doi]
- Verification by Network DecompositionEdmund M. Clarke, Muralidhar Talupur, Tayssir Touili, Helmut Veith. 276-291 [doi]
- Reversible Communicating SystemsVincent Danos, Jean Krivine. 292-307 [doi]
- Parameterised Boolean Equation Systems (Extended Abstract)Jan Friso Groote, Tim A. C. Willemse. 308-324 [doi]
- An Extensional Spatial Logic for Mobile ProcessesDaniel Hirschkoff. 325-339 [doi]
- Timed vs. Time-Triggered AutomataPavel Krcál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi. 340-354 [doi]
- Extended Process Rewrite Systems: Expressiveness and ReachabilityMojmír Kretínský, Vojtech Rehák, Jan Strejcek. 355-370 [doi]
- A General Approach to Comparing Infinite-State Systems with Their Finite-State SpecificationsAntonín Kucera, Ph. Schnoebelen. 371-386 [doi]
- Model Checking Timed Automata with One or Two ClocksFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. 387-401 [doi]
- On Flatness for 2-Dimensional Vector Addition Systems with StatesJérôme Leroux, Grégoire Sutre. 402-416 [doi]
- Compiling Pattern Matching in Join-PatternsQin Ma, Luc Maranget. 417-431 [doi]
- Model Checking Restricted Sets of Timed PathsNicolas Markey, Jean-François Raskin. 432-447 [doi]
- Asynchronous Games 2: The True Concurrency of InnocencePaul-André Melliès. 448-465 [doi]
- Open Maps, Alternating Simulations and Control SynthesisPaulo Tabuada. 466-480 [doi]
- Probabilistic Event Structures and DomainsDaniele Varacca, Hagen Völzer, Glynn Winskel. 481-496 [doi]
- Session Types for Functional MultithreadingVasco Thudichum Vasconcelos, António Ravara, Simon J. Gay. 497-511 [doi]
- A Higher Order Modal Fixed Point LogicMahesh Viswanathan, Ramesh Viswanathan. 512-528 [doi]