Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(17 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CeTA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sat4j / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMTInterpol / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KITTeL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sugar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CoLoR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Yices / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LLVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CiME / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-016-9388-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2533836568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing redundant arguments automatically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing innermost runtime complexity of term rewriting by dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix interpretations for proving termination of term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination by dependency pairs and inductive theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT solving for termination proofs with recursive path orders and dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey vs. Lexicographic Termination Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Non-looping Non-termination Automatically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Analysis of C Programs Using Compiler Intermediate Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Lower Bounds for Runtime Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Runtime Bounds for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Solving for Termination Analysis with Polynomial Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Techniques for Rational Polynomial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Integer Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing and improving dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination by Bounded Increase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Programs Automatically with AProVE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Abstraction with Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis of Java Bytecode by Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination and Memory Safety for Programs with Pointer Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling finite linear CSP into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Termination Proofs Using CeTA / rank
 
Normal rank
Property / cites work
 
Property / cites work: KBO orientability / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:12, 14 July 2024

scientific article
Language Label Description Also known as
English
Analyzing program termination and complexity automatically with \textsf{AProVE}
scientific article

    Statements

    Analyzing program termination and complexity automatically with \textsf{AProVE} (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2017
    0 references
    termination analysis
    0 references
    complexity analysis
    0 references
    Java programs
    0 references
    C programs
    0 references
    Haskell programs
    0 references
    Prolog programs
    0 references
    term rewriting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers