Bounds checking

Results: 12



#Item
1Enhancing Server Availability and Security Through Failure-Oblivious Computing Martin Rinard, Cristian Cadar, Daniel Dumitran, Daniel M. Roy, Tudor Leu, and William S. Beebee, Jr. Computer Science and Artificial Intellig

Enhancing Server Availability and Security Through Failure-Oblivious Computing Martin Rinard, Cristian Cadar, Daniel Dumitran, Daniel M. Roy, Tudor Leu, and William S. Beebee, Jr. Computer Science and Artificial Intellig

Add to Reading List

Source URL: www.doc.ic.ac.uk

Language: English - Date: 2016-03-08 07:04:45
2Baggy Bounds Checking: An Efficient and Backwards-Compatible Defense against Out-of-Bounds Errors Periklis Akritidis,⋆ Manuel Costa,† Miguel Castro,† Steven Hand⋆ ⋆  Computer Laboratory

Baggy Bounds Checking: An Efficient and Backwards-Compatible Defense against Out-of-Bounds Errors Periklis Akritidis,⋆ Manuel Costa,† Miguel Castro,† Steven Hand⋆ ⋆ Computer Laboratory

Add to Reading List

Source URL: css.csail.mit.edu

Language: English - Date: 2016-01-29 11:50:05
    3IEEE TRANSACTIONS ON SOFTWARE ENGINEERING  1 Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined

    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1 Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined

    Add to Reading List

    Source URL: www.comp.nus.edu.sg

    Language: English
      4Light-weight Bounds Checking  ∗ Niranjan Hasabnis, Ashish Misra and R. Sekar Stony Brook University, Stony Brook, NY 11794

      Light-weight Bounds Checking ∗ Niranjan Hasabnis, Ashish Misra and R. Sekar Stony Brook University, Stony Brook, NY 11794

      Add to Reading List

      Source URL: seclab.cs.sunysb.edu

      Language: English - Date: 2014-07-10 01:53:28
        51) Buffer overflows 2) Baggy bounds checking 3) Integer overflows and KINT 4) Privilege separation and OKWS 6) OS Isolation and Capsicum 7) Sandboxing and Native Client

        1) Buffer overflows 2) Baggy bounds checking 3) Integer overflows and KINT 4) Privilege separation and OKWS 6) OS Isolation and Capsicum 7) Sandboxing and Native Client

        Add to Reading List

        Source URL: css.csail.mit.edu

        Language: English - Date: 2014-07-10 13:02:30
        6Bounds Checking: An Instance of Hybrid Analysis Troels Henriksen, Cosmin E. Oancea HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU) [removed], [removed]  Abstract

        Bounds Checking: An Instance of Hybrid Analysis Troels Henriksen, Cosmin E. Oancea HIPERFIT, Department of Computer Science, University of Copenhagen (DIKU) [removed], [removed] Abstract

        Add to Reading List

        Source URL: hiperfit.dk

        Language: English
        7The Design and Implementation of a Certifying Compiler George C. Necula Peter Lee School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213{3891

        The Design and Implementation of a Certifying Compiler George C. Necula Peter Lee School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213{3891

        Add to Reading List

        Source URL: www.cs.berkeley.edu

        Language: English - Date: 2010-10-29 12:59:07
        8SC22 WG14 N1173  Rationale for TR[removed]Extensions to the C Library Part I: Bounds-checking interfaces

        SC22 WG14 N1173 Rationale for TR[removed]Extensions to the C Library Part I: Bounds-checking interfaces

        Add to Reading List

        Source URL: www.open-std.org

        Language: English - Date: 2006-04-29 10:33:28
        9Computer programming / Arrays / Data types / Primitive types / Computer errors / Buffer overflow / Scanf format string / Circular buffer / C / Computing / Software engineering / Software bugs

        Programmer’s Points to Remember: Always do bounds checking on arrays. Always do bounds checking on pointer arithmetic.

        Add to Reading List

        Source URL: nsfsecurity.pr.erau.edu

        Language: English - Date: 2002-07-06 21:20:26
        10Programmer’s Points to Remember: ü Always do bounds checking on arrays. ü Always do bounds checking on pointer arithmetic. ü Before you copy to, format, or send input to a buffer make sure it is big enough to hold w

        Programmer’s Points to Remember: ü Always do bounds checking on arrays. ü Always do bounds checking on pointer arithmetic. ü Before you copy to, format, or send input to a buffer make sure it is big enough to hold w

        Add to Reading List

        Source URL: nsfsecurity.pr.erau.edu

        Language: English - Date: 2002-07-06 21:20:36