LLVM

swMATH4892MaRDI QIDQ17043

No author found.

Related Items (72)

A complete semantics of \(\mathbb{K}\) and its translation to Isabelle ⋮ Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ A Modern Look at GRIN, an Optimizing Functional Language Back End ⋮ Unnamed Item ⋮ Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Symbolic computation via program transformation ⋮ Whale: An Interpolation-Based Algorithm for Inter-procedural Verification ⋮ On the Correctness of the SIMT Execution Model of GPUs ⋮ On the implementation ofGNU Prolog ⋮ Programmable program synthesis ⋮ Checking data-race freedom of GPU kernels, compositionally ⋮ Fast computation of strong control dependencies ⋮ From Under-Approximations to Over-Approximations and Back ⋮ Non-linear Boltzmann equation on hybrid-unstructured non-conforming multi-domains ⋮ A Fast Verified Liveness Analysis in SSA Form ⋮ A compiler for MSVL and its applications ⋮ Lingva: Generating and Proving Program Properties Using Symbol Elimination ⋮ RSSA: A Reversible SSA Form ⋮ Verification of Concurrent Programs on Weak Memory Models ⋮ Hash consed points-to sets ⋮ Backward symbolic execution with loop folding ⋮ A formal semantics of the GraalVM intermediate representation ⋮ Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution ⋮ Computing in Operations Research Using Julia ⋮ LCTD: test-guided proofs for C programs on LLVM ⋮ Complexity and resource bound analysis of imperative programs using difference constraints ⋮ A principled, complete, and efficient representation of C++ ⋮ Formalizing the SAFECode Type System ⋮ Unnamed Item ⋮ Facilitating the design of fault tolerance in transaction level SystemC programs ⋮ Software obfuscation with non-linear mixed Boolean-arithmetic expressions ⋮ Julia: A Fresh Approach to Numerical Computing ⋮ Program synthesis for interactive-security systems ⋮ Sound Bit-Precise Numerical Domains ⋮ Spinsim: a GPU optimized Python package for simulating spin-half and spin-one quantum systems ⋮ Relational program reasoning using compiler IR ⋮ A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation ⋮ A Domain-Specific Language and Editor for Parallel Particle Methods ⋮ Refinement through restraint: bringing down the cost of verification ⋮ Modular Verification of Procedure Equivalence in the Presence of Memory Allocation ⋮ Unnamed Item ⋮ Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software ⋮ A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets ⋮ CasADi: a software framework for nonlinear optimization and optimal control ⋮ Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption ⋮ Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution ⋮ Parallel Assertions for Architectures with Weak Memory Models ⋮ Time-triggered runtime verification ⋮ Memory-centric scheduling for multicore hard real-time systems ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ CScout: a refactoring browser for C ⋮ Quo Vadis Explicit-State Model Checking ⋮ Extracting verified decision procedures: DPLL and Resolution ⋮ Structural Abstraction of Software Verification Conditions ⋮ A matrix-free isogeometric Galerkin method for Karhunen-Loève approximation of random fields using tensor product splines, tensor contraction and interpolation based quadrature ⋮ Julia language in machine learning: algorithms, applications, and open issues ⋮ A profile-based tool for finding pipeline parallelism in sequential programs ⋮ Using Fault Screeners for Software Error Detection ⋮ In search of a program generator to implement generic transformations for high-performance computing ⋮ An Abstract Domain of Uninterpreted Functions ⋮ Speculative parallelization of sequential loops on multicores ⋮ Parallelizing computation of expected values in recombinant binomial trees ⋮ Towards satisfiability modulo parametric bit-vectors ⋮ Towards bit-width-independent proofs in SMT solvers ⋮ A new abstraction framework for affine transformers ⋮ Leveraging compiler intermediate representation for multi- and cross-language verification ⋮ Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constraint-based Diversification of JOP Gadgets ⋮ Enhancing \texttt{R} with advanced compilation tools and methods

This page was built for software: LLVM