The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification

DOI10.1007/978-3-540-76637-7_2zbMath1137.68357OpenAlexW2137002101MaRDI QIDQ3498430

Christian Skalka, Paritosh Shroff, Scott F. Smith

Publication date: 15 May 2008

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76637-7_2

zbMATH Keywords

program analysishigher-orderprogram verification0CFA

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification

Uses Software

• Unnamed Item
• Unnamed Item

Cites Work

• Isabelle/HOL. A proof assistant for higher-order logic
• Combining programming with theorem proving
• Logic-flow analysis of higher-order programs
• The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
• Grammar Analysis and Parsing by Abstract Interpretation
• Programming Languages and Systems

This page was built for publication: The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification