Sciweavers

    5476 search results - page 3 / 1096
    » Resettably Secure Computation
    Sort
    View
    OOPSLA
    2010
    Springer
    107views Security Privacy» more  OOPSLA 2010»
    Patterns and statistical analysis for understanding reduced resource computing
    15 years 1 months ago
    Patterns and statistical analysis for understanding reduced resource computing
    Download  people.csail.mit.edu
    Martin C. Rinard, Henry Hoffmann, Sasa Misailovic,...
    claim paper
    Read More »
    FSTTCS
    2010
    Springer
    193views Software Engineering» more  FSTTCS 2010»
    Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
    15 years 1 months ago
    Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
    Download  www.infsec.cs.uni-saarland.de
    ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
    Michael Backes, Matteo Maffei, Esfandiar Mohammadi
    claim paper
    Read More »
    SP
    2002
    IEEE
    161views Security Privacy» more  SP 2002»
    Improving Computer Security Using Extended Static Checking
    15 years 3 months ago
    Improving Computer Security Using Extended Static Checking
    Download  www.vantuyl.com
    We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
    Brian Chess
    claim paper
    Read More »
    MOC
    2010
    117views Security Privacy» more  MOC 2010»
    Computing a lower bound for the canonical height on elliptic curves over number fields
    14 years 10 months ago
    Computing a lower bound for the canonical height on elliptic curves over number fields
    Download  home.kku.ac.th
    Computing a lower bound for the canonical height is a crucial step in determining a Mordell
    Thotsaphon Thongjunthug
    claim paper
    Read More »
    OOPSLA
    2010
    Springer
    120views Security Privacy» more  OOPSLA 2010»
    What can the GC compute efficiently?: a language for heap assertions at GC time
    15 years 1 months ago
    What can the GC compute efficiently?: a language for heap assertions at GC time
    Download  www.eecs.tufts.edu
    Christoph Reichenbach, Neil Immerman, Yannis Smara...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.