Symbiotic 8: Parallel and Targeted Test Generation - (Competition Contribution). | 0 | 0.34 | 2021 |
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions. | 0 | 0.34 | 2020 |
Symbiotic 7: Integration of Predator and More - (Competition Contribution). | 0 | 0.34 | 2020 |
Generic Emptiness Check for Fun and Profit. | 0 | 0.34 | 2019 |
ltl3tela - LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata. | 0 | 0.34 | 2019 |
Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes? (Experimental Paper). | 0 | 0.34 | 2018 |
SBT-instrumentation: A Tool for Configurable Instrumentation of LLVM Bitcode. | 0 | 0.34 | 2018 |
SYMBIOTIC 5: Boosted Instrumentation - (Competition Contribution). | 1 | 0.36 | 2018 |
SYMBIOTIC 5: Boosted Instrumentation - (Competition Contribution). | 0 | 0.34 | 2018 |
Symbiotic 4: Beyond Reachability - (Competition Contribution). | 2 | 0.35 | 2017 |
Symbiotic 4: Beyond Reachability - (Competition Contribution). | 0 | 0.34 | 2017 |
Tighter Loop Bound Analysis (Technical report). | 1 | 0.37 | 2016 |
Complementing Semi-deterministic Büchi Automata. | 5 | 0.44 | 2016 |
Tighter Loop Bound Analysis. | 1 | 0.37 | 2016 |
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. | 3 | 0.45 | 2016 |
Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. | 0 | 0.34 | 2016 |
Symbiotic 3: New Slicer and Error-Witness Generation - (Competition Contribution). | 2 | 0.40 | 2016 |
On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoded Bit-Widths. | 0 | 0.34 | 2016 |
On Refinement of Büchi Automata for Explicit Model Checking | 1 | 0.36 | 2015 |
The Hanoi Omega-Automata Format | 13 | 0.55 | 2015 |
Symbiotic 2: More Precise Slicing - (Competition Contribution). | 3 | 0.45 | 2014 |
Is there a best büchi automaton for explicit model checking? | 3 | 0.43 | 2014 |
Symbolic Memory with Pointers. | 4 | 0.41 | 2014 |
Compositional Approach to Suspension and Other Improvements to LTL Translation. | 11 | 0.60 | 2013 |
Comparison of LTL to Deterministic Rabin Automata Translators. | 9 | 0.51 | 2013 |
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment. | 17 | 0.71 | 2013 |
ClabureDB: Classified Bug-Reports Database. | 2 | 0.38 | 2013 |
Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution - (Competition Contribution). | 2 | 0.42 | 2013 |
Checking Properties Described by State Machines: On Synergy of Instrumentation, Slicing, and Symbolic Execution. | 6 | 0.55 | 2012 |
On Synergy of Metal, Slicing, and Symbolic Execution | 0 | 0.34 | 2012 |
Decidable Race Condition and Open Coregions in HMSC | 1 | 0.36 | 2010 |
Refining the Undecidability Border of Weak Bisimilarity | 1 | 0.34 | 2006 |
Reachability of hennessy-milner properties for weakly extended PRS | 6 | 0.41 | 2005 |
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL | 5 | 0.55 | 2002 |