Abstract interpretation of recursive logic definitions for efficient runtime assertion checking

DOI10.1007/978-3-031-38828-6_10zbMATH Open1541.68101MaRDI QIDQ6535334

Thibaut Benajmin, Julien Signoles

Publication date: 12 December 2023

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Verified Runtime Assertion Checking for Memory Properties
• Title not available (Why is that?)

Recommendations

• Abstract interpretation based verification of logic programs 👍 👎
• Predicate Abstraction for Program Verification 👍 👎
• Model Checking Recursive Programs with Exact Predicate Abstraction 👍 👎
• Runtime Verification Logics A Language Design Perspective 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Abstract interpretation of recursive logic definitions for efficient runtime assertion checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535334)