| A Game for Linear-time-Branching-time Spectroscopy
|
2021 |
Bisping, Benjamin |
| Quasipolynomial Computation of Nested Fixpoints
|
2021 |
Hausmann, Daniel |
| Bounded Model Checking for Hyperproperties
|
2021 |
Hsu, Tzu-Han |
| Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
|
2021 |
Mann, Makai |
| Timed Automata Relaxation for Reachability
|
2021 |
Bendík, Jaroslav |
| Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring
|
2021 |
Mamouras, Konstantinos |
| Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata
|
2021 |
André, Étienne |
| Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models
|
2021 |
Peruffo, Andrea |
| Improving Neural Network Verification through Spurious Region Guided Refinement
|
2021 |
Yang, Pengfei |
| Network Traffic Classification by Program Synthesis
|
2021 |
Shi, Lei |
| On Satisficing in Quantitative Games
|
2021 |
Bansal, Suguman |
| Inductive Synthesis for Probabilistic Programs Reaches New Horizons
|
2021 |
Andriushchenko, Roman |
| Analysis of Markov Jump Processes under Terminal Constraints
|
2021 |
Backenköhler, Michael |
| Multi-objective Optimization of Long-run Average and Total Rewards
|
2021 |
Quatmann, Tim |
| Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
|
2021 |
Meyer, Fabian |
| General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
|
2021 |
Majumdar, Rupak |
| Generating Extended Resolution Proofs with a BDD-Based SAT Solver
|
2021 |
Bryant, Randal E. |
| A Flexible Proof Format for SAT Solver-Elaborator Communication
|
2021 |
Baek, Seulkee |
| SAT Solving with GPU Accelerated Inprocessing
|
2021 |
Osama, Muhammad |
| FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions
|
2021 |
Ferreira, Margarida |
Tag hinzufügen