prof. RNDr. Jan Strejček, Ph.D.
profesor – Katedra teorie programování
kancelář: C414
Botanická 554/68a
602 00 Brno
telefon: | 549 49 6941 |
---|---|
e‑mail: |
sociální a akademické sítě: |
---|
Počet publikací: 86
2019
-
Generic Emptiness Check for Fun and Profit
Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings, rok: 2019
-
LTL to Smaller Self-Loop Alternating Automata and Back
Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31 - November 4, 2019, Proceedings, rok: 2019
-
ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata
Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings, rok: 2019
-
Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors
CAV 2019: Computer Aided Verification, rok: 2019
2018
-
Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers
Theoretical Aspects of Computing – ICTAC 2018, rok: 2018
-
Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes?
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, rok: 2018
-
Joint Forces for Memory Safety Checking
Model Checking Software. SPIN 2018, rok: 2018
-
On the complexity of the quantified bit-vector arithmetic with binary encoding
Information Processing Letters, rok: 2018, ročník: 135, vydání: červenec 2018, DOI
-
Symbiotic 5: Boosted Instrumentation (Competition Contribution)
Tools and Algorithms for the Construction and Analysis of Systems, 24th International Conference, Proceedings, Part II, rok: 2018
2017
-
On Simplification of Formulas with Unconstrained Variables and Quantifiers
Theory and Applications of Satisfiability Testing – SAT 2017, rok: 2017