Abstract is missing.
- Acceleration for Petri NetsJérôme Leroux. 1-4 [doi]
- Automated Verification and Strategy Synthesis for Probabilistic SystemsMarta Z. Kwiatkowska, David Parker. 5-22 [doi]
- SMT-Based Software Model Checking - Explicit Scheduler, Symbolic ThreadsAlessandro Cimatti. 23 [doi]
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-FragmentTomás Babiak, Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek. 24-39 [doi]
- Improved Upper and Lower Bounds for Büchi DisambiguationHrishikesh Karmarkar, Manas Joglekar, Supratik Chakraborty. 40-54 [doi]
- Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed PointsThomas Brihaye, Laurent Doyen 0001, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell. 55-70 [doi]
- An Automatic Technique for Checking the Simulation of Timed SystemsElie Fares, Jean-Paul Bodeveix, Mamoun Filali-Amine, Manuel Garnacho. 71-86 [doi]
- Synthesis of Bounded Integer Parameters for Parametric Timed Reachability GamesAleksandra Jovanovic, Didier Lime, Olivier H. Roux. 87-101 [doi]
- Kleene Algebras and Semimodules for Energy ProblemsZoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas. 102-117 [doi]
- Looking at Mean-Payoff and Total-Payoff through WindowsKrishnendu Chatterjee, Laurent Doyen 0001, Mickael Randour, Jean-François Raskin. 118-132 [doi]
- Weighted SafetySigal Weiner, Matan Hasson, Orna Kupferman, Eyal Pery, Zohar Shevach. 133-147 [doi]
- A Framework for Ranking Vacuity ResultsShoham Ben-David, Orna Kupferman. 148-162 [doi]
- Synthesizing Masking Fault-Tolerant Systems from Deontic SpecificationsRamiro Demasi, Pablo F. Castro, T. S. E. Maibaum, Nazareno Aguirre. 163-177 [doi]
- Verification of a Dynamic Management Protocol for Cloud ApplicationsRim Abid, Gwen Salaün, Francesco Bongiovanni, Noel De Palma. 178-192 [doi]
- Compact Symbolic ExecutionJiri Slaby, Jan Strejcek, Marek Trtík. 193-207 [doi]
- Multi-threaded Explicit State Space Exploration with State ReconstructionSami Evangelista, Lars Michael Kristensen, Laure Petrucci. 208-223 [doi]
- Verification of Heap Manipulating Programs with Ordered Data by Extended Forest AutomataParosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar. 224-239 [doi]
- Integrating Policy Iterations in Abstract InterpretersPierre Roux, Pierre-Loïc Garoche. 240-254 [doi]
- Interpolation Properties and SAT-Based Model CheckingArie Gurfinkel, Simone Fulvio Rollini, Natasha Sharygina. 255-271 [doi]
- Analysis of Message Passing Programs Using SMT-SolversParosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg. 272-286 [doi]
- An Expressive Framework for Verifying Deadlock FreedomDuy-Khanh Le, Wei-Ngan Chin, Yong Meng Teo. 287-302 [doi]
- Expected Termination Time in BPA GamesDominik Wojtczak. 303-318 [doi]
- Precise Cost Analysis via Local ReasoningDiego Esteban Alonso-Blas, Puri Arenas, Samir Genaim. 319-333 [doi]
- Control Flow Refinement and Symbolic Computation of Average Case BoundHong Yi Chen, Supratik Mukhopadhyay, Zheng Lu. 334-348 [doi]
- Termination and Cost Analysis of Loops with Concurrent InterleavingsElvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin. 349-364 [doi]
- Linear Ranking for Linear Lasso ProgramsMatthias Heizmann, Jochen Hoenicke, Jan Leike, Andreas Podelski. 365-380 [doi]
- Merge and Conquer: State Merging in Parametric Timed AutomataÉtienne André, Laurent Fribourg, Romain Soulat. 381-396 [doi]
- An Automata-Theoretic Approach to Reasoning about Parameterized Systems and SpecificationsOrna Grumberg, Orna Kupferman, Sarai Sheinvald. 397-411 [doi]
- Pushdown Systems with Stack ManipulationYuya Uezato, Yasuhiko Minamide. 412-426 [doi]
- Robustness Analysis of String TransducersRoopsha Samanta, Jyotirmoy V. Deshmukh, Swarat Chaudhuri. 427-441 [doi]
- Manipulating LTL Formulas Using Spot 1.0Alexandre Duret-Lutz. 442-445 [doi]
- Rabinizer 2: Small Deterministic Automata for LTL ∖ GUJan Kretínský, Ruslán Ledesma-Garza. 446-450 [doi]
- LTL Model Checking with NecoLukasz Fronc, Alexandre Duret-Lutz. 451-454 [doi]
- Solving Parity Games on the GPUPhilipp Hoffmann, Michael Luttenberger. 455-459 [doi]
- PyEcdar: Towards Open Source Implementation for Timed SystemsAxel Legay, Louis-Marie Traonouez. 460-463 [doi]
- CCMC: A Conditional CSL Model Checker for Continuous-Time Markov ChainsYang Gao, Ernst Moritz Hahn, Naijun Zhan, Lijun Zhang 0001. 464-468 [doi]
- NLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical SystemsRomain Testylier, Thao Dang. 469-473 [doi]
- CELL: A Compositional Verification FrameworkKun Ji, Yang Liu, Shang-Wei Lin, Jun Sun 0001, Jin Song Dong, Truong Khanh Nguyen. 474-477 [doi]
- VCS: A Verifier for Component-Based SystemsFei He, Liangze Yin, Bow-Yaw Wang, Lianyi Zhang, Guanyu Mu, Wenrui Meng. 478-481 [doi]
- SmacC: A Retargetable Symbolic Execution EngineArmin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr. 482-486 [doi]
- MoTraS: A Tool for Modal Transition Systems and Their ExtensionsJan Kretínský, Salomon Sickert. 487-491 [doi]
- Cunf: A Tool for Unfolding and Verifying Petri Nets with Read ArcsCésar Rodríguez, Stefan Schwoon. 492-495 [doi]
- SAT Based Verification of Network Data PlanesShuyuan Zhang, Sharad Malik. 496-505 [doi]
- A Theory for Control-Flow Graph ExplorationStephan Arlt, Philipp Rümmer, Martin Schäf. 506-515 [doi]
- The Quest for Precision: A Layered Approach for Data Race Detection in Static AnalysisJakob Mund, Ralf Huuck, Ansgar Fehnker, Cyrille Artho. 516-525 [doi]