scientific article
From MaRDI portal
Publication:2722067
zbMath0966.68580MaRDI QIDQ2722067
Publication date: 11 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Computing methodologies and applications (68U99) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items (21)
A generic framework for heap and value analyses of object-oriented programming languages ⋮ Automatic Inference of Access Permissions ⋮ A logic of reachable patterns in linked data-structures ⋮ Parameterized recursive refinement types for automated program verification ⋮ On the almighty wand ⋮ Verifying Heap-Manipulating Programs in an SMT Framework ⋮ Reasoning about sequences of memory states ⋮ Unnamed Item ⋮ On the Almighty Wand ⋮ Bounded Quantifier Instantiation for Checking Inductive Invariants ⋮ Verify heaps via unified model checking ⋮ Loop summarization using state and transition invariants ⋮ Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs ⋮ On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions ⋮ An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures ⋮ The Spotlight Principle ⋮ Beyond Shapes: Lists with Ordered Data ⋮ TVLA ⋮ A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs ⋮ Local higher-order fixpoint iteration ⋮ Translating Java for multiple model checkers: The Bandera back-end
This page was built for publication:
