- Understanding Analysis - Stephen Abott
- BV Rao's notes on Analysis I
| import requests | |
| import json | |
| # replace the access_token with your own. You can get one at https://developers.facebook.com/tools/explorer/?method=GET&path=cmiconfessionz%2Ffeed&version=v3.0 | |
| starturl = "https://graph.facebook.com/v3.0/cmiconfessionz/feed?access_token=" | |
| cururl = starturl | |
| confessionData = [] |
| module Lib where | |
| import Data.Graph | |
| import Data.Vector | |
| import Data.Map | |
| newtype State = State Int | |
| data Transition = Transition { addV :: [Int], | |
| toState :: State |
| {-# LANGUAGE NoMonomorphismRestriction #-} | |
| {-# LANGUAGE FlexibleContexts #-} | |
| {-# LANGUAGE TypeFamilies #-} | |
| import Diagrams.Prelude | |
| import Diagrams.Backend.SVG.CmdLine | |
| rules :: Diagram B | |
| rules = foldr1 (<>) hands | |
| where |
| import Control.Monad.Random | |
| arbitrarySet :: Monad m => m Bool -> [a] -> m [a] | |
| arbitrarySet getBool = flip foldr (return []) $ \x ls -> do | |
| t <- getBool | |
| l <- ls | |
| if t | |
| then return (x:l) | |
| else return l |
| import AutoGen exposing (..) | |
| import Html exposing (..) | |
| import Html.Attributes exposing (..) | |
| import Html.Events exposing (..) | |
| import Http | |
| import Json.Decode as Decode | |
| import Platform.Cmd | |
| main = |
| module AnalyticPage exposing (..) | |
| import AutoGen exposing (..) | |
| import Navigation | |
| import Http | |
| import Array | |
| import Html exposing (..) | |
| import Html.Attributes exposing (..) | |
| import FileReader | |
| import Json.Decode |
| update : Msg -> Model -> (Model, Cmd Msg, Maybe LoadingCounter) | |
| update = | |
| case msg of | |
| Produce cmd -> (model, cmd, Just Increment) | |
| Consume -> (model, Cmd.none, Just Decrement) | |
| msg -> | |
| let | |
| (newModel, newCmd) = realUpdate msg model | |
| in | |
| (newModel, newCmd, Nothing) |
| import Page exposing (..) | |
| import Http | |
| import Json.Decode as Decode | |
| import Task | |
| import Html | |
| main = | |
| Html.program | |
| { init = init | |
| , view = view |
| Symbolic Analysis Using SMT Solvers (SASS) | |
| Instructor: M.K. SrivasFirst | |
| Meeting: Aug 8 (Wed) 3:30PM, Lec Hall 801 | |
| Satisfiability-Modulo Theory (SMT) solver is a sound algorithmic framework for combining automatic decision procedures for first-order (i.e., quantifier-free) theories of data types, such as propositional logic, un-interpreted functions, bit-vectors, arithmetic, arrays, pointers, etc., that commonly occur in modern programming languages. Advances in SMT solving technology in the recent past have enabled development of tools - interactive theorem provers, model checkers, guided-synthesizers - for practical formal verification and synthesis of sequential and concurrent SW systems. This course covers the theory and practice of SMT solvers providing hands-on exposure to the use of SMT solvers. The topics of the course will be distributed over two not necessarily contiguous parts. The first part will cover the basic principles and theory behind construction of SMT solvers, describing in detail dec |