LLVM

swMATH4892MaRDI QIDQ17043FDOQ17043

Author name not available (Why is that?)

Cited In (72)

• Facilitating the design of fault tolerance in transaction level SystemC programs
• Enhancing \texttt{R} with advanced compilation tools and methods
• A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Memory-centric scheduling for multicore hard real-time systems
• Checking data-race freedom of GPU kernels, compositionally
• Fast computation of strong control dependencies
• CScout: a refactoring browser for C
• Modular verification of procedure equivalence in the presence of memory allocation
• On the implementation of GNU Prolog
• A complete semantics of \(\mathbb{K}\) and its translation to Isabelle
• Symbolic computation via program transformation
• Whale: an interpolation-based algorithm for inter-procedural verification
• A matrix-free isogeometric Galerkin method for Karhunen-Loève approximation of random fields using tensor product splines, tensor contraction and interpolation based quadrature
• Programmable program synthesis
• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• RSSA: A Reversible SSA Form
• Towards satisfiability modulo parametric bit-vectors
• A profile-based tool for finding pipeline parallelism in sequential programs
• An abstract domain of uninterpreted functions
• Non-linear Boltzmann equation on hybrid-unstructured non-conforming multi-domains
• Extracting verified decision procedures: DPLL and resolution
• Refinement through restraint: bringing down the cost of verification
• Julia language in machine learning: algorithms, applications, and open issues
• Complexity and resource bound analysis of imperative programs using difference constraints
• Speculative parallelization of sequential loops on multicores
• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
• Backward symbolic execution with loop folding
• Hash consed points-to sets
• A formal semantics of the GraalVM intermediate representation
• In search of a program generator to implement generic transformations for high-performance computing
• A Modern Look at GRIN, an Optimizing Functional Language Back End
• LCTD: test-guided proofs for C programs on LLVM
• Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software
• Automatically proving termination and memory safety for programs with pointer arithmetic
• Title not available (Why is that?)
• Extending R
• A new abstraction framework for affine transformers
• Software obfuscation with non-linear mixed Boolean-arithmetic expressions
• A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets
• Towards bit-width-independent proofs in SMT solvers
• Title not available (Why is that?)
• Structural Abstraction of Software Verification Conditions
• Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation
• Leveraging compiler intermediate representation for multi- and cross-language verification
• A principled, complete, and efficient representation of C++
• Time-triggered runtime verification
• Program synthesis for interactive-security systems
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Relational program reasoning using compiler IR
• CasADi: a software framework for nonlinear optimization and optimal control
• Sound bit-precise numerical domains
• From under-approximations to over-approximations and back
• Formalizing the SAFECode type system
• Lingva: generating and proving program properties using symbol elimination
• A compiler for MSVL and its applications
• Julia: a fresh approach to numerical computing
• JuMP: a modeling language for mathematical optimization
• Verification of Concurrent Programs on Weak Memory Models
• Computing in operations research using Julia
• Quo vadis explicit-state model checking
• Parallelizing computation of expected values in recombinant binomial trees
• Output-sensitive information flow analysis
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• Constraint-based Diversification of JOP Gadgets
• A domain-specific language and editor for parallel particle methods
• A Fast Verified Liveness Analysis in SSA Form
• Using fault screeners for software error detection
• Parallel assertions for architectures with weak memory models
• Title not available (Why is that?)
• On the correctness of the SIMT execution model of GPUs
• Spinsim: a GPU optimized Python package for simulating spin-half and spin-one quantum systems

This page was built for software: LLVM