Collecting Semantics under Predicate Abstraction in the K Framework

DOI10.1007/978-3-642-16310-4_9zbMATH Open1306.68061OpenAlexW2157449911MaRDI QIDQ4933282FDOQ4933282

Authors: Irina Măriuca Asăvoae, Mihail Asăvoae 

Publication date: 12 October 2010

Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16310-4_9

Recommendations

• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
• Predicate abstraction in a program logic calculus
• Predicate Abstraction in a Program Logic Calculus
• A kripke-kleene semantics for logic programs*
• An overview of the K semantic framework
• On collecting semantics for program analysis
• Predicate abstraction of rewrite theories
• scientific article; zbMATH DE number 549957
• Combining Predicate Abstraction with Fixpoint Approximations

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cited In (3)

• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
• Integrating ADTs in KeY and their application to history-based reasoning about collection
• From rewriting logic, to programming language semantics, to program verification

Uses Software

• K-Maude

This page was built for publication: Collecting Semantics under Predicate Abstraction in the K Framework

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