Abstract is missing.
- Bringing LTL Model Checking to BiologistsZara Ahmed, David Benque, Sergey Berezin, Anna Caroline E. Dahl, Jasmin Fisher, Benjamin A. Hall, Samin Ishtiaq, Jay Nanavati, Nir Piterman, Maik Riechert, Nikita Skoblov. 1-13 [doi]
- Detecting Strict Aliasing Violations in the WildPascal Cuoq, Loïc Runarvot, Alexander Cherepanov. 14-33 [doi]
- Effective Bug Finding in C Programs with Shape and Effect AbstractionsIago Abal, Claus Brabrand, Andrzej Wasowski. 34-54 [doi]
- Synthesizing Non-Vacuous SystemsRoderick Bloem, Hana Chockler, Masoud Ebrahimi, Ofer Strichman. 55-72 [doi]
- Static Analysis of Communicating Processes Using Symbolic TransducersVincent Botbol, Emmanuel Chailloux, Tristan Le Gall. 73-90 [doi]
- Reduction of Workflow Nets for Generalised Soundness VerificationHadrien Bride, Olga Kouchnarenko, Fabien Peureux. 91-111 [doi]
- Structuring Abstract Interpreters Through State and Value AbstractionsSandrine Blazy, David Bühler, Boris Yakobowski. 112-130 [doi]
- Matching Multiplications in Bit-Vector FormulasSupratik Chakraborty, Ashutosh Gupta, Rahul Jain. 131-150 [doi]
- Independence Abstractions and Models of ConcurrencyVijay D'Silva, Daniel Kroening, Marcelo Sousa. 151-168 [doi]
- Complete Abstractions and Subclassical Modal LogicsVijay D'Silva, Marcelo Sousa. 169-186 [doi]
- Using Abstract Interpretation to Correct Synchronization FaultsPietro Ferrara, Omer Tripp, Peng Liu 0010, Eric Koskinen. 187-208 [doi]
- Property Directed Reachability for Proving Absence of Concurrent Modification ErrorsAsya Frumkin, Yotam M. Y. Feldman, Ondrej Lhoták, Oded Padon, Mooly Sagiv, Sharon Shoham. 209-227 [doi]
- Stabilizing Floating-Point Programs Using Provenance AnalysisYijia Gu, Thomas Wahl. 228-245 [doi]
- Dynamic Reductions for Model Checking Concurrent SoftwareHenning Günther, Alfons Laarman, Ana Sokolova, Georg Weissenbacher. 246-265 [doi]
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity GamesErnst Moritz Hahn, Sven Schewe, Andrea Turrini, Lijun Zhang 0001. 266-287 [doi]
- Counterexample Validation and Interpolation-Based Refinement for Forest AutomataLukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar. 288-309 [doi]
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMTJiahong Jiang, Liqian Chen, Xueguang Wu, Ji Wang. 310-329 [doi]
- Solving Nonlinear Integer Arithmetic with MCSATDejan Jovanovic. 330-346 [doi]
- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed AlgorithmsIgor V. Konnov, Josef Widder, Francesco Spegni, Luca Spalazzi. 347-366 [doi]
- Efficient Elimination of Redundancies in Polyhedra by RaytracingAlexandre Maréchal, Michaël Périn. 367-385 [doi]
- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference AbstractionsRaphaël Monat, Antoine Miné. 386-404 [doi]
- Detecting All High-Level Dataraces in an RTOS KernelSuvam Mukherjee, Arun Kumar, Deepak D'Souza. 405-423 [doi]
- Reachability for Dynamic Parametric ProcessesAnca Muscholl, Helmut Seidl, Igor Walukiewicz. 424-441 [doi]
- Conjunctive Abstract Interpretation Using ParamodulationOr Ozeri, Oded Padon, Noam Rinetzky, Mooly Sagiv. 442-461 [doi]
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation LogicAndrew Reynolds, Radu Iosif, Cristina Serban. 462-482 [doi]
- Finding Relevant Templates via the Principal Component AnalysisYassamine Seladji. 483-499 [doi]
- Sound Bit-Precise Numerical DomainsTushar Sharma, Thomas W. Reps. 500-520 [doi]
- IC3 - Flipping the E in ICEYakir Vizel, Arie Gurfinkel, Sharon Shoham, Sharad Malik. 521-538 [doi]
- Partitioned Memory Models for Program AnalysisWei Wang 0062, Clark Barrett, Thomas Wies. 539-558 [doi]