default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th TACAS 2021: Luxembourg - Part I
- Jan Friso Groote
, Kim Guldstrand Larsen:
Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part I. Lecture Notes in Computer Science 12651, Springer 2021, ISBN 978-3-030-72015-5
Game Theory
- Benjamin Bisping, Uwe Nestmann:
A Game for Linear-time-Branching-time Spectroscopy. 3-19 - Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi:
On Satisficing in Quantitative Games. 20-37 - Daniel Hausmann, Lutz Schröder:
Quasipolynomial Computation of Nested Fixpoints. 38-56
SMT Verification
- Seulkee Baek, Mario Carneiro, Marijn J. H. Heule:
A Flexible Proof Format for SAT Solver-Elaborator Communication. 59-75 - Randal E. Bryant, Marijn J. H. Heule:
Generating Extended Resolution Proofs with a BDD-Based SAT Solver. 76-93 - Tzu-Han Hsu, César Sánchez, Borzoo Bonakdarpour:
Bounded Model Checking for Hyperproperties. 94-112 - Makai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, Clark W. Barrett:
Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays. 113-132 - Muhammad Osama, Anton Wijs, Armin Biere:
SAT Solving with GPU Accelerated Inprocessing. 133-151 - Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins:
FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions. 152-169
Probabilities
- Jip Spel, Sebastian Junges, Joost-Pieter Katoen:
Finding Provably Optimal Markov Chains. 173-190 - Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen:
Inductive Synthesis for Probabilistic Programs Reaches New Horizons. 191-209 - Michael Backenköhler, Luca Bortolussi, Gerrit Großmann, Verena Wolf:
Analysis of Markov Jump Processes under Terminal Constraints. 210-229 - Tim Quatmann, Joost-Pieter Katoen:
Multi-objective Optimization of Long-run Average and Total Rewards. 230-249 - Fabian Meyer, Marcel Hark, Jürgen Giesl:
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes. 250-269 - Anjiang Wei, Pu Yi, Tao Xie, Darko Marinov, Wing Lam:
Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky Tests. 270-287
Timed Systems
- Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Cerná:
Timed Automata Relaxation for Reachability. 291-310 - Étienne André, Jaime Arias, Laure Petrucci, Jaco van de Pol:
Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata. 311-329 - Konstantinos Mamouras, Agnishom Chattopadhyay, Zhifu Wang:
Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring. 330-348
Neural Networks
- Daniel M. Yellin, Gail Weiss:
Synthesizing Context-free Grammars from Recurrent Neural Networks. 351-369 - Andrea Peruffo, Daniele Ahmed, Alessandro Abate:
Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models. 370-388 - Pengfei Yang, Renjue Li, Jianlin Li, Cheng-Chao Huang, Jingyi Wang, Jun Sun, Bai Xue, Lijun Zhang:
Improving Neural Network Verification through Spurious Region Guided Refinement. 389-408
Analysis of Network Communication
- Stefan Schmid, Nicolas Schnepf, Jirí Srba:
Resilient Capacity-Aware Routing. 411-429 - Lei Shi, Yahui Li, Boon Thau Loo, Rajeev Alur:
Network Traffic Classification by Program Synthesis. 430-448 - Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. 449-467
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-10-16 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
