scientific article; zbMATH DE number 7444022
From MaRDI portal
Publication:5016383
zbMath1483.68243arXiv1907.03998MaRDI QIDQ5016383
Jochen Hoenicke, Andreas Podelski, Alexander Nutz, Daniel Dietsch, Matthias Heizmann
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1907.03998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Logic in computer science (03B70) Computational aspects of satisfiability (68R07)
Related Items (6)
Solving constrained Horn clauses over algebraic data types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning inductive invariants by sampling from frequency distributions ⋮ Unbounded procedure summaries from bounded environments ⋮ TreeAutomizer
Uses Software
Cites Work
- Unnamed Item
- Constraint solving for interpolation
- FM 2015: formal methods. 20th international symposium, Oslo, Norway, June 24--26, 2015. Proceedings
- Generalized Property Directed Reachability
- Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
- Tentative steps toward a development method for interfering programs
- Three Partition Refinement Algorithms
- Tree Automata-Based Refinement with Application to Horn Clause Verification
- Nested interpolants
- Thread modularity at many levels: a pearl in compositional verification
- Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models
This page was built for publication:
