Abstract is missing.
- A Game for Linear-time-Branching-time SpectroscopyBenjamin Bisping, Uwe Nestmann. 3-19 [doi]
- On Satisficing in Quantitative GamesSuguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi. 20-37 [doi]
- Quasipolynomial Computation of Nested FixpointsDaniel Hausmann 0001, Lutz Schröder. 38-56 [doi]
- A Flexible Proof Format for SAT Solver-Elaborator CommunicationSeulkee Baek, Mario M. Carneiro, Marijn J. H. Heule. 59-75 [doi]
- Generating Extended Resolution Proofs with a BDD-Based SAT SolverRandal E. Bryant, Marijn J. H. Heule. 76-93 [doi]
- Bounded Model Checking for HyperpropertiesTzu-Han Hsu, César Sánchez, Borzoo Bonakdarpour. 94-112 [doi]
- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of ArraysMakai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, Clark W. Barrett. 113-132 [doi]
- SAT Solving with GPU Accelerated InprocessingMuhammad Osama, Anton Wijs, Armin Biere. 133-151 [doi]
- FOREST: An Interactive Multi-tree Synthesizer for Regular ExpressionsMargarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins. 152-169 [doi]
- Finding Provably Optimal Markov ChainsJip Spel, Sebastian Junges, Joost-Pieter Katoen. 173-190 [doi]
- Inductive Synthesis for Probabilistic Programs Reaches New HorizonsRoman Andriushchenko, Milan Ceska 0002, Sebastian Junges, Joost-Pieter Katoen. 191-209 [doi]
- Analysis of Markov Jump Processes under Terminal ConstraintsMichael Backenköhler, Luca Bortolussi, Gerrit Großmann, Verena Wolf. 210-229 [doi]
- Multi-objective Optimization of Long-run Average and Total RewardsTim Quatmann, Joost-Pieter Katoen. 230-249 [doi]
- Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected SizesFabian Meyer, Marcel Hark, Jürgen Giesl. 250-269 [doi]
- Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky TestsAnjiang Wei, Pu Yi, Tao Xie 0001, Darko Marinov, Wing Lam. 270-287 [doi]
- Timed Automata Relaxation for ReachabilityJaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Cerná. 291-310 [doi]
- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed AutomataÉtienne André, Jaime Arias, Laure Petrucci, Jaco van de Pol. 311-329 [doi]
- Algebraic Quantitative Semantics for Efficient Online Temporal MonitoringKonstantinos Mamouras, Agnishom Chattopadhyay, Zhifu Wang. 330-348 [doi]
- Synthesizing Context-free Grammars from Recurrent Neural NetworksDaniel M. Yellin, Gail Weiss. 351-369 [doi]
- Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical ModelsAndrea Peruffo, Daniele Ahmed, Alessandro Abate. 370-388 [doi]
- Improving Neural Network Verification through Spurious Region Guided RefinementPengfei Yang, Renjue Li, Jianlin Li, Cheng-Chao Huang, Jingyi Wang, Jun Sun, Bai Xue, Lijun Zhang. 389-408 [doi]
- Resilient Capacity-Aware RoutingStefan Schmid 0001, Nicolas Schnepf, Jirí Srba. 411-429 [doi]
- Network Traffic Classification by Program SynthesisLei Shi, YaHui Li, Boon Thau Loo, Rajeev Alur. 430-448 [doi]
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and BeyondRupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche. 449-467 [doi]