Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 28-minute conference presentation from POPL 2018 exploring how to combine higher-order refinements and cost monads to create proof systems for both unary and relational cost analysis of programs. Learn how researchers from Vienna University of Technology, IMDEA Software Institute, SUNY Buffalo, and MPI-SWS developed two syntax-directed proof systems (UC and RC) that integrate functional properties with cost analysis capabilities. Discover how these systems can verify nontrivial examples and embed existing frameworks like RelCost and RAML. The presentation delves into formal frameworks that address both the computational cost aspects and functional properties of programs, offering a more comprehensive approach to program analysis through the innovative use of higher-order refinements and cost monads.
