Sciweavers

    442 search results - page 3 / 89
    » Proof Abstraction for Imperative Languages
    Sort
    View
    POPL
    2006
    ACM
    131views Programming Languages» more  POPL 2006»
    Small bisimulations for reasoning about higher-order imperative programs
    14 years 6 months ago
    Small bisimulations for reasoning about higher-order imperative programs
    Download  ftp.ccs.neu.edu
    We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
    Vasileios Koutavas, Mitchell Wand
    claim paper
    Read More »
    PLSA
    1994
    123views Programming Languages» more  PLSA 1994»
    Language and Architecture Paradigms as Object Classes
    13 years 10 months ago
    Language and Architecture Paradigms as Object Classes
    Download  pubs.doc.ic.ac.uk
    Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
    Diomidis Spinellis, Sophia Drossopoulou, Susan Eis...
    claim paper
    Read More »
    JAR
    2008
    124views more  JAR 2008»
    Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
    13 years 6 months ago
    Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
    Download  cristal.inria.fr
    This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
    Xavier Leroy, Sandrine Blazy
    claim paper
    Read More »
    ENTCS
    2008
    146views more  ENTCS 2008»
    Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
    13 years 6 months ago
    Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
    Download  lanther.co.uk
    istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
    Michael J. A. Smith
    claim paper
    Read More »
    POPL
    2012
    ACM
    269views Programming Languages» more  POPL 2012»
    Recursive proofs for inductive tree data-structures
    12 years 1 months ago
    Recursive proofs for inductive tree data-structures
    Download  www.cs.uiuc.edu
    We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
    Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.