Static Analysis

DOI10.1007/11547662zbMath1141.68365OpenAlexW4229853237MaRDI QIDQ5897430

Byron Cook, Andreas Podelski, Andrey Rybalchenko

Publication date: 31 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11547662

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

May-Happen-in-Parallel Analysis for Actor-Based Concurrency, Automatically proving termination and memory safety for programs with pointer arithmetic, Summarization for termination: No return!, Program verification with interacting analysis plugins, Reliable social sensing with physical constraints: analytic bounds and performance evaluation, Proving termination of nonlinear command sequences, Loop Summarization and Termination Analysis, Model checking duration calculus: a practical approach, Proving Termination Through Conditional Termination, An intuitionistic version of Ramsey's theorem and its use in program termination, Loop summarization using state and transition invariants, Ranking function synthesis for bit-vector relations, Programs with lists are counter automata, Verification and falsification of programs with loops using predicate abstraction, Explicit Fair Scheduling for Dynamic Control, A new look at the automatic synthesis of linear ranking functions, A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs, A SAT-Based Approach to Size Change Termination with Global Ranking Functions, Decision Procedures for Automating Termination Proofs, Proving mutual termination, Proving Termination of Integer Term Rewriting, Automata-Based Termination Proofs