Kategorie: DDC-Klasse 005.131
89 Titel
-
Analyzing Program Termination and Complexity Automatically with AProVE
-
Solution Validation and Extraction for QBF Preprocessing
-
Counting permutation equivalent degree six binary polynomials invariant under the cyclic group
-
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code
-
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic
-
On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
-
Confluence of Orthogonal Term Rewriting Systems in the Prototype Verification System
-
Soundness and Completeness Proofs by Coinductive Methods
-
Complete Instantiation-Based Interpolation
-
Finding Proofs in Tarskian Geometry
-
Semantically-Guided Goal-Sensitive Reasoning: Inference System and Completeness
-
Semi-intelligible Isar Proofs from Machine-Generated Proofs
-
Secret sharing schemes based on additive codes over GF(4)
-
On the annihilator ideal of an inverse form
-
A construction of several classes of two-weight and three-weight linear codes
-
Abstract Interpretation as Automated Deduction
-
Higher-Order Pattern Anti-Unification in Linear Time
-
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
-
Concatenated structure of cyclic codes over $${\mathbb {Z}}_4$$ Z 4 of length 4n
-
Cyclic codes over $${\mathbb {F}}_{2^m}[u]/\langle u^k\rangle $$ F 2 m [ u ] / ⟨ u k ⟩ of oddly even length