Generative program analysis and beyond: the power of domain-specific languages (invited paper)

DOI10.1007/978-3-030-67067-2_3zbMath1472.68042OpenAlexW3120927102MaRDI QIDQ2234057

Bernhard Steffen, Alnis Murtovi

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_3

zbMATH Keywords

program analysisdomain-specific languagesmodal transition systemsbinary decision diagrammeta-modellingmodal refinementgenerative programming(second-order) model checkingcontext-free/procedural transition systemspredicate/property transformers

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Results on the propositional \(\mu\)-calculus
• Generating data flow analysis algorithms from modal specifications
• Inferring Canonical Register Automata
• Quality Engineering: Leveraging Heterogeneous Information
• Characterization of program loops in code optimization
• Global optimization by suppression of partial redundancies
• Handbook of Model Checking
• Property-oriented expansion
• Data flow analysis as model checking
• Bisimulation collapse and the process taxonomy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generative program analysis and beyond: the power of domain-specific languages (invited paper)