C plus plus standards

被引：0
|
作者：
Myers, N
机构：
来源：
DR DOBBS JOURNAL | 1997年 / 22卷 / 11期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：10 / +
页数：2
相关论文
共 50 条
  • [1] C plus plus standards - Response
    Stevens, A
    DR DOBBS JOURNAL, 1997, 22 (11): : 12 - 12
  • [2] Automation and evaluation of mutation testing for the new C plus plus standards
    Angel Alvarez-Garcia, Miguel
    2021 IEEE/ACM 43RD INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING: COMPANION PROCEEDINGS (ICSE-COMPANION 2021), 2021, : 150 - 152
  • [3] C for C plus plus programmers
    Stevens, A
    DR DOBBS JOURNAL, 1997, 22 (07): : 99 - 102
  • [4] C plus plus and Interoperability Between Libraries: The GraphBLAS C plus plus Specification
    Brock, Benjamin
    McMillan, Scott
    Buluc, Aydin
    Mattson, Timothy G.
    Moreira, Jose E.
    2023 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW, 2023, : 207 - 215
  • [5] C plus plus builder
    Brauer, R
    DR DOBBS JOURNAL, 1997, 22 (07): : 12 - 12
  • [6] C plus plus constructors
    Meyers, S
    DR DOBBS JOURNAL, 1997, 22 (05): : 10 - 10
  • [7] C plus plus evolves!
    Naumann, Axel
    20TH INTERNATIONAL CONFERENCE ON COMPUTING IN HIGH ENERGY AND NUCLEAR PHYSICS (CHEP2013), PARTS 1-6, 2014, 513
  • [8] mdspan in C plus plus : A Case Study in the Integration of Performance Portable Features into International Language Standards
    Hollman, David S.
    Lelbach, Bryce Adelstein
    Edwards, H. Carter
    Hoemmen, Mark
    Sunderland, Daniel
    Trott, Christian R.
    PROCEEDINGS OF P3HPC 2019: 2019 IEEE/ACM INTERNATIONAL WORKSHOP ON PERFORMANCE, PORTABILITY AND PRODUCTIVITY IN HPC (P3HPC), 2019, : 60 - 70
  • [9] C plus plus constructors
    Plochan, F
    DR DOBBS JOURNAL, 1997, 22 (08): : 10 - +
  • [10] Synchronising C/C plus plus and POWER
    Sarkar, Susmit
    Memarian, Kayvan
    Owens, Scott
    Batty, Mark
    Sewell, Peter
    Maranget, Luc
    Alglave, Jade
    Williams, Derek
    ACM SIGPLAN NOTICES, 2012, 47 (06) : 311 - 321
12345