Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

APLAS
2007
ACM

favoriteEmaildiscussreport

83views Programming Languages» more APLAS 2007»

The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification

13 years 8 months ago

The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification

Download www.cs.jhu.edu

Paritosh Shroff, Christian Skalka, Scott F. Smith

Real-time Traffic

APLAS 2007 | Programming Languages |

claim paper

Related Content

» Program Abstraction in a HigherOrder Logic Framework

» Verification of TreeProcessing Programs via HigherOrder Model Checking

» Verification of HigherOrder Computation A GameSemantic Approach

» Typechecking HigherOrder Security Libraries

» A Relational Modal Logic for HigherOrder Stateful ADTs

» HigherOrder Separation Logic in IsabelleHOLCF

» PatternBased Verification for Trees

» Mechanising Hankin and Barendregt using the GordonMelham axioms

» Faulty Logic Reasoning about Fault Tolerant Programs

Post Info
More Details (n/a)

Added	12 Aug 2010
Updated	12 Aug 2010
Type	Conference
Year	2007
Where	APLAS
Authors	Paritosh Shroff, Christian Skalka, Scott F. Smith

Comments (0)