Formula-Based Software Debugging.

The article discusses the use of satisfiability modulo theory solvers in formula-based software debugging as form of computer-assisted debugging. Topics include the use of symbolic techniques to extract candidate specifications, the use of an Address Resolution Protocol (ARP) implementation, and the...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 59; no. 7; pp. 68 - 78
Autores principales: ROYCHOUDHURY, ABHIK, CHANDRA, SATISH
Formato: Artículo
Publicado: Association for Computing Machinery Jul2016
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=116599167&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 116599167
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jul2016
      vid: 59
      iid: 7
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        116599167
        10.1145/2856103
      ppf: 68
      ppct: 10
      formats:
      tig:
        atl: Formula-Based Software Debugging.
      aug:
        au:
          ROYCHOUDHURY, ABHIK
          CHANDRA, SATISH
        affil:
          Professor of computer science in the School of Computing at the National University of Singapore
          Leads the advanced programming tools research team at Samsung Research America, Mountain View, CA
      su:
        Debugging
        Root cause analysis
        Computer software testing
        Satisfiability (Computer science)
        Software engineering
      sug:
        subj:
          Debugging
          Root cause analysis
          Computer software testing
          Satisfiability (Computer science)
          Software engineering
      ab: The article discusses the use of satisfiability modulo theory solvers in formula-based software debugging as form of computer-assisted debugging. Topics include the use of symbolic techniques to extract candidate specifications, the use of an Address Resolution Protocol (ARP) implementation, and the use of interpolants to find error root-causes.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2016
    holdings:
      @attributes:
        islocal: N