BibSLEIGH — source code tag

source code

source code
Wikidata

Q128751

Tag #source code

3591 papers:

POPL-2020-AschieriG #concurrent #functional #linear #logic #parallel #proving: Par means parallel: multiplicative linear logic proofs as concurrent functional programs (FA, FAG), p. 28.
POPL-2020-BansalNS #coordination #linear #specification #synthesis: Synthesis of coordination programs from linear temporal specifications (SB, KSN, YS), p. 27.
POPL-2020-BartheHYYZ #proving #quantum #relational: Relational proofs for quantum programs (GB, JH, MY, NY, LZ), p. 29.
POPL-2020-DahlqvistK #higher-order #probability #semantics: Semantics of higher-order probabilistic programs with conditioning (FD, DK), p. 29.
POPL-2020-Jaber #automation #equivalence #higher-order #named: SyTeCi: automating contextual equivalence for higher-order programs with references (GJ), p. 28.
POPL-2020-KavvosMLD #call-by #functional: Recurrence extraction for functional programs through call-by-push-value (GAK, EM, DRL, ND), p. 31.
POPL-2020-LeeYRY #probability #towards: Towards verified stochastic variational inference for probabilistic programs (WL0, HY, XR, HY), p. 33.
POPL-2020-MathurMKMV #memory management #safety: Deciding memory safety for single-pass heap-manipulating programs (UM, AM, PK, PM, MV0), p. 29.
POPL-2020-RaghothamanMZNS #datalog #synthesis: Provenance-guided synthesis of Datalog programs (MR, JM, DZ, MN, BS), p. 27.
POPL-2020-SmolkaFHKKS #algebra #linear #testing #verification: Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (SS, NF, JH, TK, DK, AS0), p. 28.
POPL-2020-WangFCDX #probability #proving #random #termination: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time (PW, HF0, KC, YD, MX), p. 30.
POPL-2020-WestrickYFA: Disentanglement in nested-parallel programs (SW, RY, MF, UAA), p. 32.
POPL-2020-XiaZHHMPZ #coq #interactive #recursion #representation: Interaction trees: representing recursive and impure programs in Coq (LyX, YZ, PH, CKH, GM, BCP, SZ), p. 32.
ASPLOS-2020-0001SWWKK #debugging #detection #memory management #persistent: Cross-Failure Bug Detection in Persistent Memory Programs (SL0, KS, YW, TFW, AK, SK), pp. 1187–1202.
CGO-2020-JoshiFM #approximate #named #reliability #verification: Aloe: verifying reliability of approximate programs in the presence of recovery mechanisms (KJ, VF, SM), pp. 56–67.
CGO-2020-VermaKPR #concurrent #debugging #interactive #memory management #modelling: Interactive debugging of concurrent programs under relaxed memory models (AV, PKK, AP, SR), pp. 68–80.
CSL-2020-Buss0K #branch #complexity #nondeterminism #proving: Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs (SB, AD0, AK), p. 17.
EDM-2019-YahyaMO #data mining #education #effectiveness #mining #novel #using: A Novel Use of Educational Data Mining to Inform Effective Management of Academic Programs (AAY, FAM, AO).
ICPC-2019-FakhouryRHA #readability #theory and practice: Improving source code readability: theory and practice (SF, DR, SAH, VA), pp. 2–12.
ICSME-2019-Guarnera #eye tracking: Enhancing Eye Tracking of Source Code: A Specialized Fixation Filter for Source Code (DTG), pp. 615–618.
ICSME-2019-HataNNKH #android #named: OSAIFU: A Source Code Factorizer on Android Studio (MH, MN, KN, HK, TH), pp. 422–425.
ICSME-2019-JohnsonLYAS #comprehension #empirical #readability: An Empirical Study Assessing Source Code Readability in Comprehension (JJ, SL, NY, JA, BS), pp. 513–523.
ICSME-2019-LevinY #dataset #scalability: Processing Large Datasets of Fined Grained Source Code Changes (SL, AY), pp. 382–385.
ICSME-2019-TufanoWBPWP #how #learning: Learning How to Mutate Source Code from Bug-Fixes (MT, CW, GB, MDP, MW, DP), pp. 301–312.
MSR-2019-AkbarK #named #order #retrieval #semantics: SCOR: source code retrieval with semantics and order (SAA, ACK), pp. 1–12.
MSR-2019-EfstathiouS #identifier #modelling #semantics #using: Semantic source code models using identifier embeddings (VE, DS), pp. 29–33.
MSR-2019-YangC0 #behaviour #development #predict #specification: Predicting co-changes between functionality specifications and source code in behavior driven development (AZHY, DAdC, YZ0), pp. 534–544.
MSR-2019-ZhaiCD #python #test coverage: Test coverage in python programs (HZ, CC, PTD), pp. 116–120.
SANER-2019-PizzolottoFC #android #java #named #obfuscation: OBLIVE: Seamless Code Obfuscation for Java Programs and Android Apps (DP, RF, MC), pp. 629–633.
SANER-2019-QiZ #concurrent #testing: A Splitting Strategy for Testing Concurrent Programs (XQ, HZ), pp. 388–398.
FM-2019-BeringerA #abstraction #c #composition #verification: Abstraction and Subsumption in Modular Verification of C Programs (LB, AWA), pp. 573–590.
FM-2019-PhamLP0 #testing: Concolic Testing Heap-Manipulating Programs (LHP, QLL, QSP, JS0), pp. 442–461.
SEFM-2019-RockaiBMKB #execution: Reproducible Execution of POSIX Programs with DiOS (PR, ZB, JM, KK, JB), pp. 333–349.
SEFM-2019-StillB #c++ #detection #parallel: Local Nontermination Detection for Parallel C++ Programs (VS, JB), pp. 373–390.
Haskell-2019-ChristiansenDB #coq #haskell #verification: Verifying effectful Haskell programs in Coq (JC, SD, NB), pp. 125–138.
Haskell-2019-Finkbeiner0PS #functional: Synthesizing functional reactive programs (BF, FK0, RP, MS), pp. 162–175.
Haskell-2019-MokhovLL #case study #experience #verification: Formal verification of spacecraft control programs (experience report) (AM, GL, JL), pp. 139–145.
Haskell-2019-PickeringWK #multi: Multi-stage programs in context (MP, NW, CK), pp. 71–84.
ICFP-2019-QuG0 #cost analysis #relational: Relational cost analysis for functional-imperative programs (WQ, MG, DG0), p. 29.
ICFP-2019-SmithA: Synthesizing differentially private programs (CS, AA), p. 29.
ICFP-2019-TimanyB #concurrent #continuation #relational #verification: Mechanized relational verification of concurrent programs with continuations (AT, LB), p. 28.
FDG-2019-EgertP #design #development #game studies: Tenure and promotion in the next era of game design and development programs: some thoughts and observations (CAE, AMP), p. 7.
CIKM-2019-LiLXLC #how: How to Find It Better?: Cross-Learning for WeChat Mini Programs (HL, ZL, SX, ZL, XC), pp. 2753–2761.
ICML-2019-CvitkovicSA #learning: Open Vocabulary Learning on Source Code with a Graph-Structured Cache (MC, BS, AA), pp. 1475–1485.
ECOOP-2019-LopezSMBS #debugging #idea #multi #nondeterminism: Multiverse Debugging: Non-Deterministic Debugging for Non-Deterministic Programs (Brave New Idea Paper) (CTL, RGS, SM, EGB, CS), p. 30.
ECOOP-2019-SotiropoulosL #javascript #static analysis: Static Analysis for Asynchronous JavaScript Programs (TS, BL), p. 30.
OOPSLA-2019-CambroneroR #learning #named: AL: autogenerating supervised learning programs (JPC, MCR), p. 28.
OOPSLA-2019-FernandoJM #approximate #canonical #parallel #safety #verification: Verifying safety and accuracy of approximate parallel programs via canonical sequentialization (VF, KJ, SM), p. 29.
OOPSLA-2019-Huang0CG #composition #probability #termination #verification: Modular verification for almost-sure termination of probabilistic programs (MH, HF0, KC, AKG), p. 29.
OOPSLA-2019-MastrangeloHN #empirical #java: Casting about in the dark: an empirical study of cast operations in Java programs (LM, MH, NN), p. 31.
OOPSLA-2019-Nanevski0DF #concurrent #logic #morphism #simulation #specification: Specifying concurrent programs in separation logic: morphisms and simulations (AN, AB0, GAD, IF), p. 30.
OOPSLA-2019-WangCMH #c #data type: Certifying graph-manipulating C programs via localizations within data structures (SW, QC, AM, AH), p. 30.
PADL-2019-Hanus #declarative: Improving Residuation in Declarative Programs (MH), pp. 82–97.
PADL-2019-HippenL #automation #set: Automatic Program Rewriting in Non-Ground Answer Set Programs (NH, YL), pp. 19–36.
PADL-2019-Lierler #equivalence #first-order #logic programming: Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs (YL), pp. 1–18.
PEPM-2019-WatanabeTO0 #higher-order #reduction #verification: Reduction from branching-time property verification of higher-order programs to HFL validity checking (KW, TT, HO, NK0), pp. 22–34.
PLDI-2019-0001DSD #database #refactoring: Synthesizing database programs for schema refactoring (YW0, JD, RS, ID), pp. 286–300.
PLDI-2019-AbdullaAAK #semantics #verification: Verification of programs under the release-acquire semantics (PAA, JA0, MFA, SNK), pp. 1117–1132.
PLDI-2019-HeoRSN #difference #reasoning #using: Continuously reasoning about programs using differential Bayesian inference (KH, MR, XS, MN), pp. 561–575.
PLDI-2019-JiangLXZF #compilation #concurrent #towards: Towards certified separate compilation for concurrent programs (HJ, HL, SX, JZ, XF), pp. 111–125.
PLDI-2019-NguyenGTH #contract #higher-order #termination: Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs (PCN, TG, STH, DVH), pp. 845–859.
PLDI-2019-ScalasYB #behaviour #message passing #verification: Verifying message-passing programs with dependent behavioural types (AS, NY, EB), pp. 502–516.
PLDI-2019-VollmerKRS0N #named: LoCal: a language for programs operating on serialized data (MV0, CK, MR, LS, MK0, RRN), pp. 48–62.
PLDI-2019-Wang0GCQS #cost analysis #nondeterminism #probability: Cost analysis of nondeterministic probabilistic programs (PW, HF0, AKG, KC, XQ, WS), pp. 204–220.
PLDI-2019-ZhangX #incremental #probability: Incremental precision-preserving symbolic inference for probabilistic programs (JZ, JX), pp. 237–252.
POPL-2019-BatzKKMN #logic #pointer #probability #reasoning: Quantitative separation logic: a logic for reasoning about probabilistic pointer programs (KB, BLK, JPK, CM, TN0), p. 29.
POPL-2019-ChenHLRW #string: Decision procedures for path feasibility of string-manipulating programs with complex operations (TC, MH, AWL, PR, ZW), p. 30.
POPL-2019-GleissenthallKB #distributed #verification: Pretend synchrony: synchronous verification of asynchronous distributed programs (KvG, RGK, AB, DS, RJ), p. 30.
POPL-2019-HungHZYHW #analysis #quantum #robust: Quantitative robustness analysis of quantum programs (SHH, KH, SZ, MY, MH0, XW), p. 29.
POPL-2019-MathurMV #decidability #verification: Decidable verification of uninterpreted programs (UM, PM, MV0), p. 29.
POPL-2019-PolikarpovaS #synthesis: Structuring the synthesis of heap-manipulating programs (NP, IS), p. 30.
POPL-2019-SaadCSRM #automation #modelling #probability #synthesis: Bayesian synthesis of probabilistic programs for automatic data modeling (FAS, MFCT, US, MCR, VKM), p. 32.
POPL-2019-SatoABGGH #approximate #convergence #higher-order #optimisation #probability #reasoning #verification: Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization (TS, AA0, GB, MG, DG0, JH), p. 30.
POPL-2019-TassarottiH #concurrent #logic #random: A separation logic for concurrent randomized programs (JT, RH0), p. 30.
QAPL-2019-Kirkeby #analysis #probability #reuse: Probabilistic Output Analyses for Deterministic Programs - Reusing Existing Non-probabilistic Analyses (MHK), pp. 43–57.
SAS-2019-0001NIU #first-order #fixpoint #logic #verification: Temporal Verification of Programs via First-Order Fixpoint Logic (NK0, TN, AI, HU0), pp. 413–436.
SAS-2019-HuSSD #imperative: Direct Manipulation for Imperative Programs (QH, RS, RS, LD), pp. 347–367.
SAS-2019-OkuyamaT0 #functional #higher-order #logic: A Temporal Logic for Higher-Order Functional Programs (YO, TT, NK0), pp. 437–458.
SAS-2019-YinCL0C #testing #verification: Verifying Numerical Programs via Iterative Abstract Testing (BY, LC, JL, JW0, PC), pp. 247–267.
ASE-2019-FischerTP #concurrent #multi #thread: VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq (BF, SLT, GP), pp. 1150–1153.
ASE-2019-LiuHGN #predict: Predicting Licenses for Changed Source Code (XL, LH, JG, VN), pp. 686–697.
ASE-2019-LiuSTWY #c #encryption #verification: Verifying Arithmetic in Cryptographic C Programs (JL, XS, MHT, BYW, BYY), pp. 552–564.
ASE-2019-Lukasczyk #dynamic typing #generative #testing: Generating Tests to Analyse Dynamically-Typed Programs (SL), pp. 1226–1229.
ASE-2019-MaYLYZ #c++ #fault #named #pointer #static analysis: SPrinter: A Static Checker for Finding Smart Pointer Errors in C++ Programs (XM, JY, YL, JY0, JZ), pp. 1122–1125.
ASE-2019-Mudduluru #verification: Verifying Determinism in Sequential Programs (RM), pp. 1271–1273.
ASE-2019-PobeeMC #concurrent #multi #performance #thread #transaction: Efficient Transaction-Based Deterministic Replay for Multi-threaded Programs (EBP, XM, WKC), pp. 760–771.
ASE-2019-SadiqLLAL #contract #java #named: Sip4J: Statically Inferring Access Permission Contracts for Parallelising Sequential Java Programs (AS, LL, YFL, IA, SL), pp. 1098–1101.
ASE-2019-Sharma #adaptation #automation #synthesis #using: Automatically Repairing Binary Programs Using Adapter Synthesis (VS), pp. 1238–1241.
ASE-2019-WanSSXZ0Y #learning #multi #network #retrieval #semantics: Multi-modal Attention Network Learning for Semantic Source Code Retrieval (YW, JS, YS, GX, ZZ, JW0, PSY), pp. 13–25.
ESEC-FSE-2019-He #comprehension #scalability: Understanding source code comments at large-scale (HH), pp. 1217–1219.
ESEC-FSE-2019-PobeeC #concurrent #multi #named #performance #thread: AggrePlay: efficient record and replay of multi-threaded programs (EBP, WKC), pp. 567–577.
ESEC-FSE-2019-Sonnekalb #detection: Machine-learning supported vulnerability detection in source code (TS), pp. 1180–1183.
ESEC-FSE-2019-StahlbauerKF #automation #testing: Testing scratch programs automatically (AS, MK, GF), pp. 165–175.
ESEC-FSE-2019-Wang0LXBXW #approach #automation #documentation #taxonomy: A learning-based approach for automatic construction of domain glossary from source code and documentation (CW, XP0, ML, ZX, XB, BX, TW), pp. 97–108.
ICSE-2019-HataTKI #evolution: 9.6 million links in source code comments: purpose, evolution, and decay (HH, CT, RGK, TI), pp. 1211–1221.
ICSE-2019-JoshiFM #algorithm #approximate #profiling #random #statistics: Statistical algorithmic profiling for randomized approximate programs (KJ, VF, SM), pp. 608–618.
ICSE-2019-WangWSTCS0WZL #algebra #optimisation #probability: Global optimization of numerical programs via prioritized stochastic algebraic transformations (XW, HW, ZS, ET, XC, WS, ZC0, LW, XZ, XL), pp. 1131–1141.
ICSE-2019-ZhangHMBLU #ltl #named #using: AutoTap: synthesizing and repairing trigger-action programs using LTL properties (LZ, WH, JM, NB, SL, BU), pp. 281–291.
ICSE-2019-ZhangWZ0WL #abstract syntax tree #novel #representation #syntax: A novel neural source code representation based on abstract syntax tree (JZ, XW, HZ0, HS0, KW, XL), pp. 783–794.
SLE-2019-RaselimoTF #fault #generative #parsing #syntax: Breaking parsers: mutation-based generation of programs with guaranteed syntax errors (MR, JT, BF0), pp. 83–87.
ASPLOS-2019-0001WZKK #flexibility #framework #memory management #named #performance #persistent #testing: PMTest: A Fast and Flexible Testing Framework for Persistent Memory Programs (SL0, YW, JZ, AK, SMK), pp. 411–425.
CC-2019-KSKP #functional #incremental #slicing: A static slicing method for functional programs and its incremental version (PKK, AS, AK, SP), pp. 53–64.
ESOP-2019-McDermottM #call-by #evaluation #order #reasoning: Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order (DM, AM), pp. 235–262.
ESOP-2019-XiaOW #bidirectional: Composing Bidirectional Programs Monadically (LyX, DO, MW0), pp. 147–175.
FASE-2019-QianZWO #c #modelling #named #verification: KupC: A Formal Tool for Modeling and Verifying Dynamic Updating of C Programs (JQ, MZ0, YW, KO0), pp. 299–305.
CADE-2019-GieslGH #constant #probability: Computing Expected Runtimes for Constant Probability Programs (JG, PG, MH), pp. 269–286.
CAV-2019-DarulovaV #approximate: Sound Approximation of Programs with Elementary Functions (ED, AV), pp. 174–183.
CAV-2019-LiuWL #using #verification: Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers (PL, TW, AL), pp. 386–404.
ICST-2019-HaririSFMM #compilation #mutation testing #representation #testing: Comparing Mutation Testing at the Levels of Source Code and Compiler Intermediate Representation (FH, AS, VF, SM, DM), pp. 114–124.
ICST-2019-TannoI #debugging #interactive #realtime: Suspend-Less Debugging for Interactive and/or Realtime Programs (HT, HI), pp. 194–205.
ICTSS-2019-ErardG #bound #testing: Bounded Exhaustive Testing with Certified and Optimized Data Enumeration Programs (CE, AG), pp. 159–175.
ICTSS-2019-NakajimaC #dataset #generative #machine learning #testing: Generating Biased Dataset for Metamorphic Testing of Machine Learning Programs (SN0, TYC), pp. 56–64.
VMCAI-2019-FuC #nondeterminism #probability #termination: Termination of Nondeterministic Probabilistic Programs (HF0, KC), pp. 468–490.
VMCAI-2019-KarlSBM #fault #robust #verification: Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs (AFK, RS, RB, SM), pp. 183–204.
VMCAI-2019-LuCC0 #bound: Type-Directed Bounding of Collections in Reactive Programs (TL, PC, BYEC, AT0), pp. 275–296.
ICPC-2018-FakhouryMAA #developer #readability: The effect of poor source code lexicon and readability on developers' cognitive load (SF, YM, VA, OOA), pp. 286–296.
ICPC-2018-SchankinBHHRB #comprehension #identifier: Descriptive compound identifier names improve source code comprehension (AS, AB, DVH, JCH, TR, MB), pp. 31–40.
ICPC-2018-SulirP: Augmenting source code lines with sample variable values (MS, JP), pp. 344–347.
ICSME-2018-LiuHLN: Linking Source Code to Untangled Change Intents (XL, LH, CL, VN), pp. 393–403.
ICSME-2018-Sulir #comprehension #runtime: Integrating Runtime Values with Source Code to Facilitate Program Comprehension (MS), pp. 743–748.
MSR-2018-OttAHBL08 #approach #identification #image #learning #video: A deep learning approach to identifying source code in images and video (JO, AA, PH, AB, EL), pp. 376–386.
MSR-2018-PaixaoKHH #code review #named: CROP: linking code reviews to source code changes (MP, JK, DH, MH), pp. 46–49.
MSR-2018-TorreRB08: Imprecisions diagnostic in source code deltas (GDlT, RR, AB), pp. 492–502.
MSR-2018-TufanoWBPWP08 #learning: Deep learning similarities from different representations of source code (MT, CW, GB, MDP, MW, DP), pp. 542–553.
SANER-2018-DantasCMFSLB #automation #empirical #java #program transformation: Reconciling the past and the present: An empirical study on the application of source code transformations to automatically rejuvenate Java programs (RD, AC, DM, LF, US, WL, RB), pp. 497–501.
SANER-2018-MaruyamaHO #fine-grained #named: ChangeMacroRecorder: Recording fine-grained textual changes of source code (KM, SH, TO), pp. 537–541.
SANER-2018-NguyenNPN #network: A deep neural network language model with contexts for source code (ATN0, TDN, HDP, TNN), pp. 323–334.
SCAM-2018-CosentinoDZRG: [Engineering Paper] Graal: The Quest for Source Code Knowledge (VC, SD, AZ, GR, JMGB), pp. 123–128.
SCAM-2018-DiarraMV #optimisation #plugin: [Engineering Paper] RECKA and RPromF: Two Frama-C Plug-ins for Optimizing Registers Usage in CUDA, OpenACC and OpenMP Programs (RD, AM, BV), pp. 187–192.
SCAM-2018-PizzolottoC #bytecode #java #library #obfuscation #research: [Research Paper] Obfuscating Java Programs by Translating Selected Portions of Bytecode to Native Libraries (DP, MC), pp. 40–49.
FM-2018-AlbertGRS0 #modelling #named #verification: SDN-Actors: Modeling and Verification of SDN Programs (EA, MGZ, AR, MS, AS0), pp. 550–567.
FM-2018-ColvinS #memory management #modelling #verification: A Wide-Spectrum Language for Verification of Programs on Weak Memory Models (RJC, GS), pp. 240–257.
FM-2018-KhannaSRP #verification: Dynamic Symbolic Verification of MPI Programs (DK, SS0, CR, RP), pp. 466–484.
FM-2018-Laneve #analysis #concurrent #lightweight #thread: A Lightweight Deadlock Analysis for Programs with Threads and Reentrant Locks (CL), pp. 608–624.
FM-2018-LetanRCH #composition #coq #verification: Modular Verification of Programs with Effects and Effect Handlers in Coq (TL, YRG, PC, GH), pp. 338–354.
FM-2018-ZhangZSLTLS #composition #concurrent #reasoning: Compositional Reasoning for Shared-Variable Concurrent Programs (FZ, YZ, DS, YL0, AT, SWL, JS0), pp. 523–541.
SEFM-2018-Choi #automation #generative #validation: Automated Validation of IoT Device Control Programs Through Domain-Specific Model Generation (YC), pp. 254–268.
SEFM-2018-LuckowPV #monte carlo: Monte Carlo Tree Search for Finding Costly Paths in Programs (KSL, CSP, WV), pp. 123–138.
Haskell-2018-HandleyH #haskell #named #performance: AutoBench: comparing the time performance of Haskell programs (MATH, GH), pp. 26–37.
ICML-2018-GaninKBEV #image #learning #using: Synthesizing Programs for Images using Reinforced Adversarial Learning (YG, TK, IB, SMAE, OV), pp. 1652–1661.
ICML-2018-HoltzenBM #abstraction #composition #probability: Sound Abstraction and Decomposition of Probabilistic Programs (SH, GVdB, TDM), pp. 2004–2013.
ICML-2018-HuWL #analysis #probability #reduction #using: Dissipativity Theory for Accelerating Stochastic Variance Reduction: A Unified Analysis of SVRG and Katyusha Using Semidefinite Programs (BH, SW, LL), pp. 2043–2052.
KDD-2018-SachanX #framework #parsing: Parsing to Programs: A Framework for Situated QA (MS, EPX), pp. 2140–2149.
Onward-2018-RinardSM #learning: Active learning for inference and regeneration of computer programs that store and retrieve data (MCR, JS0, VM), pp. 12–28.
OOPSLA-2018-AlimadadiZMT #javascript: Finding broken promises in asynchronous JavaScript programs (SA, DZ, MM, FT), p. 26.
PLATEAU-2018-HuangM #algorithm #named #quantum #towards: QDB: From Quantum Algorithms Towards Correct Quantum Programs (YH0, MM), p. 14.
LOPSTR-2018-TitoloMFM #float #testing: Eliminating Unstable Tests in Floating-Point Programs (LT, CAM, MAF, MMM), pp. 169–183.
LOPSTR-2018-TroumpoukisC #higher-order #logic programming: Predicate Specialization for Definitional Higher-Order Logic Programs (AT, AC), pp. 132–147.
PADL-2018-BiermannDS #functional #higher-order #spreadsheet: Rewriting High-Level Spreadsheet Structures into Higher-Order Functional Programs (FB, WD, PS), pp. 20–35.
PADL-2018-Crary #code generation #using: Hygienic Source-Code Generation Using Functors - (Extended Abstract) (KC), pp. 53–60.
PEPM-2018-Jay #normalisation #recursion: Recursive programs in normal form (short paper) (BJ), pp. 67–73.
PLDI-2018-Cusumano-Towner18a #incremental #probability: Incremental inference for probabilistic programs (MCT, BB, TG, MTV, VKM), pp. 571–585.
PLDI-2018-LiuW #analysis #bound #concurrent #interprocedural #named: CUBA: interprocedural Context-UnBounded Analysis of concurrent programs (PL, TW), pp. 105–119.
PLDI-2018-NgoC0 #analysis #bound #probability: Bounded expectations: resource analysis for probabilistic programs (VCN, QC, JH0), pp. 496–512.
PLDI-2018-WangHR #algebra #framework #named #probability #static analysis: PMAF: an algebraic framework for static analysis of probabilistic programs (DW, JH0, TWR), pp. 513–528.
POPL-2018-0001ST #higher-order #nondeterminism #refinement #type system #verification: Relatively complete refinement type system for verification of higher-order non-deterministic programs (HU0, YS, TT), p. 29.
POPL-2018-AgrawalC0 #approach #performance #probability #ranking #termination: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (SA, KC, PN0), p. 32.
POPL-2018-BaoKPS #behaviour #modelling: Analytical modeling of cache behavior for affine programs (WB, SK, LNP, PS), p. 26.
POPL-2018-BartheEGHS #probability #proving: Proving expected sensitivity of probabilistic programs (GB, TE, BG, JH, PYS), p. 29.
POPL-2018-LiY #algorithm #analysis #problem #quantum #termination: Algorithmic analysis of termination problems for quantum programs (YL, MY), p. 29.
POPL-2018-MeloRAP #c #semantics: Inference of static semantics for incomplete C programs (LTCM, RGR, MRdA, FMQP), p. 28.
POPL-2018-NguyenGTH #contract #higher-order #verification: Soft contract verification for higher-order stateful programs (PCN, TG, STH, DVH), p. 30.
PPDP-2018-Hanus #declarative #verification: Verifying Fail-Free Declarative Programs (MH), p. 13.
PPDP-2018-KlemenS0MH #performance #runtime: Static Performance Guarantees for Programs with Runtime Checks (MK, NS, PLG0, JFM, MVH), p. 13.
PPDP-2018-SulzmannS #dynamic analysis #message passing: Two-Phase Dynamic Analysis of Message-Passing Go Programs Based on Vector Clocks (MS, KS), p. 13.
SAS-2018-AlurDS #gpu #independence: Block-Size Independence for GPU Programs (RA, JD, NS), pp. 107–126.
SAS-2018-HuckelheimLNSH #verification: Verifying Properties of Differentiable Programs (JH, ZL, SHKN, SFS, PDH), pp. 205–222.
SAS-2018-JournaultMO #c #composition #static analysis #string: Modular Static Analysis of String Manipulations in C Programs (MJ, AM, AO), pp. 243–262.
ASE-2018-ChenZ #framework #retrieval #summary: A neural framework for retrieval and summarization of source code (QC, MZ), pp. 826–831.
ASE-2018-Cosmo: Software heritage: collecting, preserving, and sharing all our source code (keynote) (RDC), pp. 1–2.
ASE-2018-GharibiTL #automation #generative #graph #named #python: Code2graph: automatic generation of static call graphs for Python source code (GG, RT, YL), pp. 880–883.
ASE-2018-HaririS #c #mutation testing #named #representation #testing #tool support: SRCIROR: a toolset for mutation testing of C source code and LLVM intermediate representation (FH, AS), pp. 860–863.
ASE-2018-MonteiroGCF #bound #c++ #framework #model checking #platform: Bounded model checking of C++ programs based on the Qt cross-platform framework (journal-first abstract) (FRM, MAPG, LCC, EBdLF), p. 954.
ASE-2018-OzdemirTEA #lightweight #monitoring: Lightweight source code monitoring with Triggr (AO, AT, HE, RA), pp. 864–867.
ASE-2018-SungLEW #concurrent #difference #scalability #semantics: Datalog-based scalable semantic diffing of concurrent programs (CS, SKL, CE, CW0), pp. 656–666.
ASE-2018-WanZYXY0Y #automation #learning #summary: Improving automatic source code summarization via deep reinforcement learning (YW, ZZ, MY0, GX, HY, JW0, PSY), pp. 397–407.
ESEC-FSE-2018-Chen00M0 #concurrent #parallel #testing #thread: Testing multithreaded programs via thread speed control (DC, YJ0, CX0, XM, JL0), pp. 15–25.
ESEC-FSE-2018-HashimotoMI #automation #debugging #semantics: Automated patch extraction via syntax- and semantics-aware Delta debugging on source code changes (MH, AM, TI), pp. 598–609.
ESEC-FSE-2018-HenkelLLR #comprehension #embedded: Code vectors: understanding programs through embedded abstracted symbolic traces (JH, SKL, BL, TWR), pp. 163–174.
ESEC-FSE-2018-SiLZAKN #datalog #synthesis: Syntax-guided synthesis of Datalog programs (XS, WL, RZ, AA, PK, MN), pp. 515–527.
ICSE-2018-BankenMG #data flow #debugging: Debugging data flows in reactive programs (HB, EM0, GG), pp. 752–763.
ICSE-2018-KimCK #c #precise #testing #using: Precise concolic unit testing of C programs using extended units and symbolic alarm filtering (YK, YC, MK), pp. 315–326.
ICSE-2018-KrugerWFSL #question: Do you remember this source code? (JK, JW, WF, GS, TL), pp. 764–775.
ICSE-2018-SousaOOBGLKMFOL #design #identification #problem: Identifying design problems in the source code: a grounded theory (LdSS, AO, WNO, SDJB, AG, JL, MK, RMdM, BF, RFO, CL, RBdP), pp. 921–931.
GPCE-2018-ChristopheRBM #analysis #distributed #javascript #process: Orchestrating dynamic analyses of distributed processes for full-stack JavaScript programs (LC, CDR, EGB, WDM), pp. 107–118.
GPCE-2018-HatchF #interactive #named #reliability: Rash: from reckless interactions to reliable programs (WGH, MF), pp. 28–39.
ASPLOS-2018-RajaduraiBWA #configuration management #named: Gloss: Seamless Live Reconfiguration and Reoptimization of Stream Programs (SR, JB, WFW, SPA), pp. 98–112.
ASPLOS-2018-RiggerSMGM #c #debugging #execution #fault: Sulong, and Thanks for All the Bugs: Finding Errors in C Programs by Abstracting from the Native Execution Model (MR, RS, RM, MG, HM), pp. 377–391.
CASE-2018-StutzM #automation #design #development #how #object-oriented #process: How object-oriented design principles enhance the development of complex automation programs - A Best Practice Paper on how to develop service-interlaces for process modules as defined in VDI/VDE/NAMUR 2658 (AS, MM), pp. 156–159.
CC-2018-ColinL #composition #termination: Termination checking and task decomposition for task-based intermittent programs (AC, BL), pp. 116–127.
CGO-2018-ToffolaPG #performance: Synthesizing programs that expose performance bottlenecks (LDT, MP, TRG), pp. 314–326.
ESOP-2018-BartheEGGHS #logic #probability: An Assertion-Based Program Logic for Probabilistic Programs (GB, TE, MG, BG, JH, PYS), pp. 117–144.
ESOP-2018-BichselGV #fine-grained #probability #semantics: Fine-Grained Semantics for Probabilistic Programs (BB, TG, MTV), pp. 145–185.
ESOP-2018-EilersMH #composition: Modular Product Programs (ME, PM0, SH), pp. 502–529.
FASE-2018-LandsbergSK #fault #locality #optimisation #specification #using: Optimising Spectrum Based Fault Localisation for Single Fault Programs Using Specifications (DL, YS, DK), pp. 246–263.
CAV-2018-BansalNS #specification #synthesis: Synthesis of Asynchronous Reactive Programs from Temporal Specifications (SB, KSN, YS), pp. 367–385.
CAV-2018-KraglQ #concurrent: Layered Concurrent Programs (BK, SQ), pp. 79–102.
CAV-2018-Satake0 #functional #higher-order #logic: Propositional Dynamic Logic for Higher-Order Functional Programs (YS, HU0), pp. 105–123.
CAV-2018-Yahav #modelling: From Programs to Interpretable Deep Models and Back (EY), pp. 27–37.
CAV-2018-ArndtJKMN #exclamation #graph #java #pointer #verification: Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs (HA, CJ, JPK, CM, TN0), pp. 3–11.
CAV-2018-BouajjaniEJQ #bound #message passing #on the #verification: On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony (AB, CE, KJ, SQ), pp. 372–391.
CAV-2018-BouajjaniEMT #abstraction #reasoning #reduction #using: Reasoning About TSO Programs Using Reduction and Abstraction (AB, CE, SOM, ST), pp. 336–353.
CAV-2018-DohrauSUM0 #array: Permission Inference for Array Programs (JD, AJS, CU, SM, PM0), pp. 55–74.
ICST-2018-KimHKPK #test coverage #testing: Invasive Software Testing: Mutating Target Programs to Diversify Test Exploration for High Test Coverage (YK, SH, BK, DLP, MK), pp. 239–249.
IJCAR-2018-KotelnikovKV #encoding #imperative: A FOOLish Encoding of the Next State Relations of Imperative Programs (EK, LK, AV), pp. 405–421.
IJCAR-2018-ZhanH #complexity #imperative #verification: Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle (BZ, MPLH), pp. 532–548.
VMCAI-2018-BaumannDMHV #abstraction #automation #verification: Automatic Verification of RMA Programs via Abstraction Extrapolation (CB, AMD, YM, TH, MTV), pp. 47–70.
VMCAI-2018-BiondiEHLMQ #approximate #data flow #scalability: Scalable Approximation of Quantitative Information Flow in Programs (FB, MAE, AH, AL, KSM, JQ), pp. 71–93.
VMCAI-2018-TitoloFMM #abstract interpretation #analysis #fault #float #framework: An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs (LT, MAF, MMM, CAM), pp. 516–537.
ICSA-2017-ZhengCA #architecture #consistency #product line #traceability: Mapping Features to Source Code through Product Line Architecture: Traceability and Conformance (YZ, CC, HUA), pp. 225–234.
CSEET-2017-SaiedianLW #how #question #re-engineering: CSEE&T 2017 Panel Proposal How to Enhance Diversity in Software Engineering Programs? (HS, GAL, ABW), pp. 122–123.
CSEET-2017-TaylorGKWVC #re-engineering: Undergraduate Software Engineering Programs (CT, KG, JK, CW, NMV, LC), pp. 180–181.
ICSME-2017-BaumSB #on the #order #overview #perspective: On the Optimal Order of Reading Source Code Changes for Review (TB, KS, AB), pp. 329–340.
ICSME-2017-YiCMJ #automation: Automated Repair of High Inaccuracies in Numerical Programs (XY, LC, XM, TJ), pp. 514–518.
MSR-2017-AivaloglouHMR #dataset: A dataset of scratch programs: scraped, shaped and scored (EA, FH, JML, GR), pp. 511–514.
SANER-2017-BartmanNCM #named #query: srcQL: A syntax-aware query language for source code (BB, CDN, MLC, JIM), pp. 467–471.
SANER-2017-GhafariM #framework #recommendation: A framework for classifying and comparing source code recommendation systems (MG, HM), pp. 555–556.
SANER-2017-NewmanACM #category theory #identifier: Lexical categories for source code identifiers (CDN, RSA, MLC, JIM), pp. 228–239.
SANER-2017-ProkschNAM #fine-grained #process: Enriching in-IDE process information with fine-grained source code history (SP, SN, SA, MM), pp. 250–260.
SANER-2017-SantosPAEMD #recommendation: Recommending source code locations for system specific transformations (GS, KVRP, NA, AE, MdAM, SD), pp. 160–170.
SCAM-2017-NashaatAM #detection #object-oriented #php #security: Detecting Security Vulnerabilities in Object-Oriented PHP Programs (MN, KA0, JM0), pp. 159–164.
SCAM-2017-RuizCM #detection: Working Around Loops for Infeasible Path Detection in Binary Programs (JR, HC, MDM), pp. 1–10.
SCAM-2017-SzalayPK #c #c++ #clustering #towards: Towards Better Symbol Resolution for C/C++ Programs: A Cluster-Based Solution (RS, ZP, DK), pp. 101–110.
FSCD-2017-Gaboardi #higher-order #relational #type system #verification: Type Systems for the Relational Verification of Higher Order Programs (Invited Talk) (MG), p. 1.
ICFP-2017-AguirreBG0S #higher-order #logic #relational: A relational logic for higher-order programs (AA0, GB, MG, DG0, PYS), p. 29.
ICFP-2017-NarayananS #array #probability: Symbolic conditioning of arrays in probabilistic programs (PN, CcS), p. 25.
ICFP-2017-RicciottiSPC #functional #imperative: Imperative functional programs that explain their work (WR, JS, RP, JC), p. 28.
ICML-2017-GauntBKT #library: Differentiable Programs with Neural Libraries (ALG, MB, NK, DT), pp. 1213–1222.
ICML-2017-LevyW #learning: Learning to Align the Source Code to the Compiled Object Code (DL, LW), pp. 2043–2051.
ECOOP-2017-DietrichPJBD #case study #contract #java: Contracts in the Wild: A Study of Java Programs (JD0, DJP, KJ, PB), p. 29.
ECOOP-2017-StievenartNMR #abstraction #static analysis: Mailbox Abstractions for Static Analysis of Actor Programs (QS, JN, WDM, CDR), p. 30.
OOPSLA-2017-BakstGKJ #canonical #distributed #verification: Verifying distributed programs via canonical sequentialization (AB, KvG, RGK, RJ), p. 27.
OOPSLA-2017-CogumbreiroSMSV #concurrent #parallel #why: Deadlock avoidance in parallel programs with futures: why parallel tasks should not wait for strangers (TC, RS, FM, VS, VTV, MG), p. 26.
OOPSLA-2017-LiZ #fault #locality #testing: Transforming programs and tests in tandem for fault localization (XL, LZ), p. 30.
OOPSLA-2017-YuanMJ: Abridging source code (BY, VM, CMJ), p. 26.
LOPSTR-2017-NguyenT #analysis #parallel #thread: CARET Analysis of Multithreaded Programs (HVN, TT), pp. 73–90.
PADL-2017-AntoyH #functional #logic programming #nondeterminism: Eliminating Irrelevant Non-determinism in Functional Logic Programs (SA, MH), pp. 1–18.
PADL-2017-Redl #set: Extending Answer Set Programs with Interpreted Functions as First-Class Citizens (CR), pp. 68–85.
PLDI-2017-EizenbergPPMD #analysis #named #runtime: BARRACUDA: binary-level analysis of runtime RAces in CUDA programs (AE, YP, TP, WM, JD), pp. 126–140.
PLDI-2017-FedyukovichAB #parallel #synthesis: Gradual synthesis for static parallelization of single-pass array-processing programs (GF, MBSA, RB), pp. 572–585.
PLDI-2017-LifflanderK #locality #optimisation #recursion: Cache locality optimization for recursive programs (JL, SK), pp. 1–16.
PLDI-2017-SanthiarK #c# #concurrent #detection: Static deadlock detection for asynchronous C# programs (AS, AK), pp. 292–305.
POPL-2017-BartheGHS #probability #proving: Coupling proofs are probabilistic product programs (GB, BG, JH, PYS), pp. 161–174.
POPL-2017-YingYW #generative #invariant #quantum: Invariants of quantum programs: characterisations and generation (MY, SY, XW), pp. 818–832.
PPDP-2017-Huisman #parallel #verification: A verification technique for deterministic parallel programs (MH), p. 3.
SAS-2017-BouajjaniEL #concurrent #difference #evolution #semantics: Abstract Semantic Diffing of Evolving Concurrent Programs (AB, CE, SKL), pp. 46–65.
SAS-2017-ChakrabortyGU #array #verification: Verifying Array Manipulating Programs by Tiling (SC, AG, DU), pp. 428–449.
SAS-2017-GurfinkelN #c #c++ #memory management #verification: A Context-Sensitive Memory Model for Verification of C/C++ Programs (AG, JAN), pp. 148–168.
SAS-2017-MukherjeePSDR #abstraction #performance #semantics #thread: Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs (SM, OP, SS, DD, NR), pp. 253–276.
SAS-2017-SoO #imperative #static analysis: Synthesizing Imperative Programs from Examples Guided by Static Analysis (SS, HO), pp. 364–381.
SAS-2017-ZhangSX #analysis #incremental #probability: Incremental Analysis for Probabilistic Programs (JZ, YS, JX), pp. 450–472.
ASE-2017-LinZZX #concept #retrieval #using: Improving software text retrieval using conceptual knowledge in source code (ZL, YZ, JZ, BX), pp. 123–134.
ASE-2017-MetzlerSBS #concurrent #scheduling #verification: Quick verification of concurrent programs by iteratively relaxed scheduling (PM, HS, PB, NS), pp. 776–781.
ASE-2017-NguyenS0TP #concurrent #parallel: Parallel bug-finding in concurrent programs via reduced interleaving instances (TLN, PS, BF0, SLT, GP), pp. 753–764.
ESEC-FSE-2017-GopsteinIYDZYC #comprehension: Understanding misunderstandings in source code (DG, JI, YY, LD, YZ, MKCY, JC), pp. 129–139.
ESEC-FSE-2017-HellendoornD #modelling #network #question: Are deep neural networks the best choice for modeling source code? (VJH, PTD), pp. 763–773.
ESEC-FSE-2017-YogaN #parallel #performance #profiling: A fast causal profiler for task parallel programs (AY, SN), pp. 15–26.
ICSE-2017-ChenBHXZX #compilation #learning #testing: Learning to prioritize test programs for compiler testing (JC0, YB, DH, YX, HZ0, BX), pp. 700–711.
ICSE-2017-GopalakrishnanS #architecture #predict #question #topic: Can latent topics in source code predict missing architectural tactics? (RG, PS, MM, MG), pp. 15–26.
SLE-2017-ShenR #robust: Robust programs with filtered iterators (JS, MR), pp. 244–255.
ASPLOS-2017-NguyenP #memory management #scalability #transaction #what: What Scalable Programs Need from Transactional Memory (DN, KP), pp. 105–118.
CC-2017-TownsendKE #data flow #functional #pipes and filters: From functional programs to pipelined dataflow circuits (RT, MAK, SAE), pp. 76–86.
ESOP-2017-0001P #syntax #using: Programs Using Syntax with First-Class Binders (FF0, BP), pp. 504–529.
ESOP-2017-BouajjaniEEOT #concurrent #robust #verification: Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency (AB, ME, CE, BKO, ST), pp. 170–200.
ESOP-2017-CulpepperC #equivalence #probability #random: Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring (RC, AC), pp. 368–392.
ESOP-2017-DArgenioBBFH #analysis #formal method: Is Your Software on Dope? - Formal Analysis of Surreptitiously “enhanced” Programs (PRD, GB, SB, BF, HH), pp. 83–110.
ESOP-2017-Sato0 #composition #functional #higher-order #verification: Modular Verification of Higher-Order Functional Programs (RS, NK0), pp. 831–854.
CADE-2017-SantosGMN #javascript #towards #verification: Towards Logic-Based Verification of JavaScript Programs (JFS, PG, PM, DN), pp. 8–25.
CADE-2017-TellezB #automation #pointer #proving #verification: Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof (GT, JB), pp. 491–508.
CAV-2017-AlbarghouthiDD #nondeterminism: Repairing Decision-Making Programs Under Uncertainty (AA, LD, SD), pp. 181–200.
CAV-2017-AlurDLS #detection #gpu #named: GPUDrano: Detecting Uncoalesced Accesses in GPU Programs (RA, JD, OSNL, NS), pp. 507–525.
CAV-2017-ChasinsP #data-driven #probability #synthesis: Data-Driven Synthesis of Full Probabilistic Programs (SC, PMP), pp. 279–304.
CAV-2017-ChatterjeeFG #analysis #recursion #worst-case: Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
CAV-2017-GrossmanCIRS #equivalence #verification: Verifying Equivalence of Spark Programs (SG, SC, SI, NR, MS), pp. 282–300.
CAV-2017-McClurgHC #network #synthesis: Synchronization Synthesis for Network Programs (JM, HH, PC), pp. 301–321.
ICST-2017-ChanWSPS #analysis #concurrent #fault #invariant #multi #named #thread #using: IPA: Error Propagation Analysis of Multi-Threaded Programs Using Likely Invariants (AC, SW0, HS, KP, NS), pp. 184–195.
ICST-2017-DiasFFLSSV #concurrent #contract #using #verification: Verifying Concurrent Programs Using Contracts (RJD, CF0, JF, JML, AS, DGS, TV), pp. 196–206.
ICST-2017-ZhangYZLCHL #automation #data flow #parallel #testing #thread: Automated Testing of Definition-Use Data Flow for Multithreaded Programs (XZ0, ZY, QZ, PL, JC, YH, TL0), pp. 172–183.
VMCAI-2017-AbalBW #abstraction #c #debugging #effectiveness: Effective Bug Finding in C Programs with Shape and Effect Abstractions (IA, CB, AW), pp. 34–54.
VMCAI-2017-GuW #analysis #float #using: Stabilizing Floating-Point Programs Using Provenance Analysis (YG, TW), pp. 228–245.
VMCAI-2017-MonatM #abstract interpretation #abstraction #concurrent #precise #relational #thread #using: Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (RM, AM), pp. 386–404.
ECSA-2016-AlsharaSTBDS #architecture #component #object-oriented: Materializing Architecture Recovered from Object-Oriented Source Code in Component-Based Languages (ZA, ADS, CT, HLB, CD, AS), pp. 309–325.
ECSA-2016-KaptoEKT #analysis #approach #architecture #detection #evolution: Inferring Architectural Evolution from Source Code Analysis - A Tool-Supported Approach for the Detection of Architectural Tactics (CK, GEB, SK, CT), pp. 149–165.
QoSA-2016-FreibergPE #communication #distributed: Retargetable Communication for Distributed Programs (OF, JP, ME), pp. 21–30.
ICPC-2016-BreckelT #programming: Embedding programming context into source code (AB, MT), pp. 1–4.
ICPC-2016-HermansA #empirical #programming #smell: Do code smells hamper novice programming? A controlled experiment on Scratch programs (FH, EA), pp. 1–10.
ICPC-2016-Kulkarni #reuse #scalability: Comprehending source code of large software system for reuse (AK), pp. 1–4.
ICPC-2016-SunSYL #named #word: WB4SP: A tool to build the word base for specific programs (WS, XS, HY, BL0), pp. 1–3.
ICSME-2016-CollardM #semiparsing: srcML 1.0: Explore, Analyze, and Manipulate Source Code (MLC, JIM), p. 649.
ICSME-2016-CruzMM #component #summary: TraceLab Components for Reproducing Source Code Summarization Experiments (BDC, PWM, CM), p. 610.
ICSME-2016-KirchmayrMNPT #analysis #comprehension #integration #legacy: Integration of Static and Dynamic Code Analysis for Understanding Legacy Source Code (WK, MM, LN, JP, RT), pp. 543–552.
ICSME-2016-LinCMC0X #empirical #fine-grained #python: An Empirical Study on the Characteristics of Python Fine-Grained Source Code Change Types (WL, ZC, WM, LC0, LX0, BX), pp. 188–199.
ICSME-2016-NguyenNN #fine-grained #topic #using: Using Topic Model to Suggest Fine-Grained Source Code Changes (HAN, ATN0, TNN), pp. 200–210.
ICSME-2016-NguyenTN #migration #question #statistics: Do Contexts Help in Phrase-Based, Statistical Source Code Migration? (ATN0, ZT, TNN), pp. 155–165.
ICSME-2016-RahimiC #feature model #matrix #named: Artifact: Cassandra Source Code, Feature Descriptions across 27 Versions, with Starting and Ending Version Trace Matrices (MR, JCH), p. 612.
ICSME-2016-Smith #validation: Resolving Input Validation Vulnerabilities by Retracing Taint Flow Through Source Code (JS0), p. 617.
MSR-2016-DiamantopoulosT #component #named #recommendation #usability: QualBoa: reusability-aware recommendations of source code components (TGD, KT, ALS), pp. 488–491.
SANER-2016-BorckBSHHJSS #named #using: Frankencode: Creating Diverse Programs Using Code Clones (HB, MSB, IJDS, SAH, KH, SJ, AS, MS), pp. 604–608.
SANER-2016-KarasnehCKG #anti #design #modelling: Studying the Relation between Anti-Patterns in Design Models and in Source Code (BK, MRVC, FK, YGG), pp. 36–45.
SANER-2016-MachoMP #category theory #commit #predict: Predicting Build Co-changes with Source Code Change and Commit Categories (CM, SM, MP0), pp. 541–551.
SANER-2016-TengeriHBGG #bytecode #java #test coverage: Negative Effects of Bytecode Instrumentation on Java Source Code Coverage (DT, FH, ÁB, TG, TG), pp. 225–235.
SANER-2016-WeckT #functional #visualisation: Visualizing Data-Flows in Functional Programs (TW, MT), pp. 293–303.
SANER-2016-YeZMYZ #javascript #performance #precise #slicing: Efficient and Precise Dynamic Slicing for Client-Side JavaScript Programs (JY, CZ, LM0, HY0, JZ), pp. 449–459.
SCAM-2016-BlanchardKLL #c #composition #named #parallel #plugin #verification: Conc2Seq: A Frama-C Plugin for Verification of Parallel Compositions of C Programs (AB, NK, ML, FL), pp. 67–72.
SCAM-2016-Ragkhitwetsagul #pervasive #similarity: Similarity of Source Code in the Presence of Pervasive Modifications (CR, JK, DC), pp. 117–126.
SCAM-2016-ViticchieRTBCTT #assessment #obfuscation: Assessment of Source Code Obfuscation Techniques (AV, LR, MT, CB, MC, PT, RT), pp. 11–20.
FM-2016-DjoudiBG: Recovering High-Level Conditions from Binary Programs (AD, SB, ÉG), pp. 235–253.
FM-2016-Flores-Montoya #bound: Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations (AFM), pp. 254–273.
FSCD-2016-BenkeSC #first-order #functional #logic #synthesis: Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic (MB, AS, DWC), p. 16.
IFM-2016-Preoteasa #invariant #logic #pointer #programming #using #verification: Verifying Pointer Programs Using Separation Logic and Invariant Based Programming in Isabelle (VP), pp. 457–473.
SEFM-2016-HenselGFS #execution #proving #symbolic computation #termination: Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution (JH, JG, FF, TS), pp. 234–252.
ICFP-2016-RaghunathanMAB #memory management #parallel: Hierarchical memory management for parallel programs (RR, SKM, UAA, GEB), pp. 392–406.
ICFP-2016-SeidelJW #fault #static typing: Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong) (ELS, RJ, WW), pp. 228–242.
ICFP-2016-UenoO #concurrent #functional #garbage collection #manycore: A fully concurrent garbage collector for functional programs on multicore processors (KU, AO), pp. 421–433.
ICFP-2016-WatanabeST0 #automation #functional #higher-order #termination: Automatically disproving fair termination of higher-order functional programs (KW, RS, TT, NK0), pp. 243–255.
DiGRA-FDG-2016-Willumsen #analysis #formal method: Source Code and Formal Analysis: A Hermeneutic Reading of Passage (ECW).
ICML-2016-AllamanisPS #network #summary: A Convolutional Attention Network for Extreme Summarization of Source Code (MA, HP, CAS), pp. 2091–2100.
SKY-2016-Speicher16a #mining: Mining Source Code Regularities with FCA and Association Rules (DS), pp. 75–77.
ECOOP-2016-Chevalier-Boisvert #analysis #interprocedural #javascript: Interprocedural Type Specialization of JavaScript Programs Without Type Analysis (MCB, MF), p. 24.
ECOOP-2016-WangJLXLZH #api: Transforming Programs between APIs with Many-to-Many Mappings (CW, JJ, JL, YX, XL, LZ0, ZH), p. 26.
Onward-2016-Emerich #how: How are programs found? speculating about language ergonomics with Curry-Howard (JE), pp. 212–223.
Onward-2016-MarterBLH #identifier #lightweight #programming #readability #similarity #using: Lightweight programming experiments without programmers and programs: an example study on the effect of similarity and number of object identifiers on the readability of source code using natural texts (TM, PB, PL, SH), pp. 1–14.
OOPSLA-2016-ColinL #named #reliability: Chain: tasks and channels for reliable intermittent programs (AC, BL), pp. 514–530.
OOPSLA-2016-SteimannHU #attribute grammar #constraints #using: Computing repair alternatives for malformed programs using constraint attribute grammars (FS, JH, BU), pp. 711–730.
LOPSTR-2016-AlpuenteCEM #axiom #equation #order #partial evaluation: Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms (MA, ACO, SE, JM), pp. 3–20.
LOPSTR-2016-FalaschiGOP #concurrent #constraints #slicing: Slicing Concurrent Constraint Programs (MF, MG, CO, CP), pp. 76–93.
LOPSTR-2016-Hanus #named: CurryCheck: Checking Properties of Curry Programs (MH), pp. 222–239.
LOPSTR-2016-JanaKDVC #array #bound #model checking #scalability: Scaling Bounded Model Checking by Transforming Programs with Arrays (AJ, UPK, AD, RV, NC), pp. 275–292.
LOPSTR-2016-MesnardPV #logic programming #on the #testing #unification: On the Completeness of Selective Unification in Concolic Testing of Logic Programs (FM, ÉP, GV), pp. 205–221.
LOPSTR-2016-MorenoPRV #execution #fuzzy #logic programming #symbolic computation: Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs (GM, JP, JAR, GV), pp. 131–147.
PADL-2016-CaretteS #algebra #probability #using: Simplifying Probabilistic Programs Using Computer Algebra (JC, CcS), pp. 135–152.
PLDI-2016-CostanzoSG #assembly #c #data flow #security #verification: End-to-end verification of information-flow security for C and assembly programs (DC, ZS, RG), pp. 648–664.
POPL-2016-BaoKPRS #named #verification: PolyCheck: dynamic verification of iteration space transformations on affine programs (WB, SK, LNP, FR, PS), pp. 539–554.
POPL-2016-ChatterjeeFNH #algorithm #analysis #probability #problem #termination: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (KC, HF0, PN0, RH), pp. 327–342.
POPL-2016-MuraseT0SU #functional #higher-order #verification: Temporal verification of higher-order functional programs (AM, TT, NK0, RS, HU0), pp. 57–68.
POPL-2016-RaychevBVK #learning #semistructured data: Learning programs from noisy data (VR, PB, MTV, AK0), pp. 761–774.
PPDP-2016-Benton0N #concurrent: Effect-dependent transformations for concurrent programs (NB, MH0, VN), pp. 188–201.
SAS-2016-JournaultM #abstract interpretation #correctness #functional #matrix #static analysis: Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Programs (MJ, AM), pp. 257–277.
SAS-2016-MonniauxG #array #horn clause: Cell Morphing: From Array Programs to Array-Free Horn Clauses (DM, LG), pp. 361–382.
ASE-2016-CaiT #distributed #effectiveness #impact analysis #named: DistIA: a cost-effective dynamic impact analysis for distributed programs (HC, DT), pp. 344–355.
ASE-2016-DotzlerP #difference: Move-optimized source code tree differencing (GD, MP), pp. 660–671.
ASE-2016-PeldszusKLS #design #detection #evolution #incremental #multi #object-oriented #pattern matching #using: Continuous detection of design flaws in evolving object-oriented programs using incremental multi-pattern matching (SP, GK, ML, SS), pp. 578–589.
FSE-2016-BraioneDP #java #named: JBSE: a symbolic executor for Java programs with complex heap inputs (PB, GD, MP), pp. 1018–1022.
FSE-2016-Quan #execution #float #symbolic computation: Hotspot symbolic execution of floating-point programs (MQ), pp. 1112–1114.
FSE-2016-YogaNG #concurrent #detection #parallel: Parallel data race detection for task parallel programs with locks (AY, SN, AG), pp. 833–845.
FSE-2016-YoshidaTPGU #c #c++ #fine-grained #generative #incremental #named #testing: FSX: a tool for fine-grained incremental unit test generation for C/C++ programs (HY, ST, MRP, IG, TU), pp. 1052–1056.
ICSE-2016-DhokRS #javascript #testing: Type-aware concolic testing of JavaScript programs (MD, MKR, NS0), pp. 168–179.
ASPLOS-2016-SuiLFP #approximate: Proactive Control of Approximate Programs (XS, AL, DSF, KP), pp. 607–621.
CC-2016-KoukosEZSKJ #compilation #energy #multi: Multiversioned decoupled access-execute: the key to energy-efficient compilation of general-purpose programs (KK, PE, GZ, VS, SK, AJ), pp. 121–131.
CGO-2016-ChakrabortyV #c #c++ #concurrent #optimisation #validation: Validating optimizations of concurrent C/C++ programs (SC, VV), pp. 216–226.
CGO-2016-SuiDX #analysis #parallel #pointer #thread: Sparse flow-sensitive pointer analysis for multithreaded programs (YS, PD, JX), pp. 160–170.
CGO-2016-YogaN #parallel: Atomicity violation checker for task parallel programs (AY, SN), pp. 239–249.
ESOP-2016-KaminskiKMO #probability #reasoning: Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (BLK, JPK, CM, FO), pp. 364–389.
ESOP-2016-MineBR #algorithm #constraints #induction #invariant #theorem proving: An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs (AM, JB, TWR), pp. 560–588.
ESOP-2016-Summers0 #composition #message passing #verification: Actor Services - Modular Verification of Message Passing Programs (AJS, PM0), pp. 699–726.
ESOP-2016-WangN #approach #functional #higher-order #syntax: A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs (YW, GN), pp. 752–779.
FASE-2016-CorrodiHP #concurrent #graph #semantics: A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs (CC, AH, CMP), pp. 31–48.
CAV-2016-ChatterjeeFG #analysis #probability #termination: Termination Analysis of Probabilistic Programs Through Positivstellensatz's (KC, HF0, AKG), pp. 3–22.
CAV-2016-GehrMV #named #probability: PSI: Exact Symbolic Inference for Probabilistic Programs (TG, SM, MTV), pp. 62–83.
CAV-2016-KahsaiRSS #framework #java #named #verification: JayHorn: A Framework for Verifying Java programs (TK, PR, HS, MS), pp. 352–358.
CAV-2016-LeSC #satisfiability: Satisfiability Modulo Heap-Based Programs (QLL, JS0, WNC), pp. 382–404.
CAV-2016-ChistikovMN #product line: Hitting Families of Schedules for Asynchronous Programs (DC, RM, FN), pp. 157–176.
CSL-2016-Berger #concurrent #nondeterminism: Extracting Non-Deterministic Concurrent Programs (UB0), p. 21.
ICST-2016-ChengWXH0 #empirical #evaluation #functional #test coverage: Empirical Evaluation of Test Coverage for Functional Programs (YC, MW0, YX, DH, LZ0), pp. 255–265.
ICST-2016-LiewCD #execution #named #symbolic computation: Symbooglix: A Symbolic Execution Engine for Boogie Programs (DL, CC, AFD), pp. 45–56.
ICST-2016-YuWHH #concurrent #predict #testing: Predicting Testability of Concurrent Programs (TY, WW, XH, JHH), pp. 168–179.
ICTSS-2016-CollavizzaMR #float: Searching Critical Values for Floating-Point Programs (HC, CM, MR), pp. 209–217.
IJCAR-2016-FrohnNHBG #bound #integer #runtime: Lower Runtime Bounds for Integer Programs (FF, MN, JH, MB, JG), pp. 550–567.
IJCAR-2016-HupelK #higher-order #scala: Translating Scala Programs to Isabelle/HOL - System Description (LH, VK), pp. 568–577.
VMCAI-2016-Parizek #analysis #array #hybrid #partial order #reduction: Hybrid Analysis for Partial Order Reduction of Programs with Arrays (PP), pp. 291–310.
CBSE-2015-RuchkinSG #abstraction #architecture #hybrid: Architectural Abstractions for Hybrid Programs (IR, BRS, DG), pp. 65–74.
VLDB-2015-DeutchGM #datalog #query #using: Selective Provenance for Datalog Programs Using Top-K Queries (DD, AG, YM), pp. 1394–1405.
ITiCSE-2015-BergesH #evaluation: Evaluation of Source Code with Item Response Theory (MB, PH), pp. 51–56.
ITiCSE-2015-Harms #community #learning: Department Programs to Encourage and Support Service Learning and Community Engagement (DEH), p. 330.
SIGITE-2015-MacKellarHSS #how #question: Information Technology and Computer Science Programs: How Do We Relate? (BM, GWH, MS, AS), pp. 125–126.
SCAM-J-2013-MarcozziVH15 #database #execution #relational #sql #symbolic computation #testing: Relational symbolic execution of SQL code for unit testing of database programs (MM, WV, JLH), pp. 44–72.
ICPC-2015-JordanRHBB #feature model #industrial: Manually locating features in industrial source code: the search actions of software nomads (HRJ, JR, SH, GB, JB), pp. 174–177.
ICPC-2015-SaeidiHKJ #analysis #interactive #modelling #named #topic: ITMViz: interactive topic modeling for source code analysis (AS, JH, RK, SJ), pp. 295–298.
ICPC-2015-SaiedABS #api #library #question #using: Could we infer unordered API usage patterns only using the library source code? (MAS, HA, OB, HAS), pp. 71–81.
ICSME-2015-SantosAEDV #program transformation: System specific, source code transformations (GS, NA, AE, SD, MTV), pp. 221–230.
MSR-2015-DiamantopoulosS #stack overflow: Employing Source Code Information to Improve Question-Answering in Stack Overflow (TGD, ALS), pp. 454–457.
MSR-2015-JiangA #co-evolution #empirical #framework: Co-evolution of Infrastructure and Source Code — An Empirical Study (YJ, BA), pp. 45–55.
MSR-2015-LabuschagneH #question: Do Onboarding Programs Work? (AL, RH), pp. 381–385.
MSR-2015-SinhaSDPM #detection #repository: Detecting and Mitigating Secret-Key Leaks in Source Code Repositories (VSS, DS, PD, RP, SM), pp. 396–400.
MSR-2015-Zacchiroli #dataset #metadata: The Debsources Dataset: Two Decades of Debian Source Code Metadata (SZ), pp. 466–469.
SANER-2015-HashimotoMI #fine-grained #scalability: A comprehensive and scalable method for analyzing fine-grained source code change patterns (MH, AM, TI), pp. 351–360.
SANER-2015-WongLT #automation #generative #mining #named: CloCom: Mining existing source code for automatic comment generation (EW, TL, LT), pp. 380–389.
SCAM-2015-BaloghSB #eclipse #named: CodeMetropolis: Eclipse over the city of source code (GB, AS, ÁB), pp. 271–276.
SCAM-2015-BrandtnerLG #dependence #integration #testing: Intent, tests, and release dependencies: Pragmatic recipes for source code integration (MB, PL, HCG), pp. 11–20.
SCAM-2015-LawrieB #navigation #word: Navigating source code with words (DL, DB), pp. 71–80.
SCAM-2015-RahmanRK #crowdsourcing #recommendation #using: Recommending insightful comments for source code using crowdsourced knowledge (MMR, CKR, IK), pp. 81–90.
SCAM-2015-SantosEADV #game studies #program transformation: Recording and replaying system specific, source code transformations (GS, AE, NA, SD, MTV), pp. 221–230.
ICALP-v1-2015-BienvenuDS #question #what: What Percentage of Programs Halt? (LB, DD, AS), pp. 219–230.
ICALP-v1-2015-GoldreichGR #branch #context-free grammar #proving #proximity: Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs — (OG, TG, RDR), pp. 666–677.
ICALP-v2-2015-BojanczykMW #bound #clique #datalog #monad: Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
FM-2015-AlbertACGGMPR #analysis #concurrent #distributed: Resource Analysis: From Sequential to Concurrent and Distributed Programs (EA, PA, JC, SG, MGZ, EMM, GP, GRD), pp. 3–17.
FM-2015-FengHTZ #model checking #named #protocol #quantum: QPMC: A Model Checker for Quantum Programs and Protocols (YF, EMH, AT, LZ), pp. 265–272.
SEFM-2015-AmighiDBH #specification #verification: Specification and Verification of Atomic Operations in GPGPU Programs (AA, SD, SB, MH), pp. 69–83.
SEFM-2015-BlomHZ #behaviour #concurrent #functional #verification: History-Based Verification of Functional Behaviour of Concurrent Programs (SB, MH, MZS), pp. 84–98.
SEFM-2015-Muhlberg0DLP #learning #verification: Learning Assertions to Verify Linked-List Programs (JTM, DHW, MD, GL, FP), pp. 37–52.
SEFM-2015-RochaBC #bound #c #generative #memory management #model checking #testing #using: Memory Management Test-Case Generation of C Programs Using Bounded Model Checking (HR, RSB, LCC), pp. 251–267.
CEFP-2015-StutterheimAP #monad #visualisation: Static and Dynamic Visualisations of Monadic Programs (JS, PA, RP), pp. 341–379.
Haskell-2015-FarmerSG #equation #haskell #reasoning #tool support: Reasoning with the HERMIT: tool support for equational reasoning on GHC core programs (AF, NS, AG), pp. 23–34.
ICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order: Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
FDG-2015-CooperL #education #game studies #named: Panel: Game Programs in Higher Education - Connecting Colleges with Corporations (KMLC, CSL).
GCM-2015-Flick #correctness #graph #on the #recursion: On Correctness of Graph Programs Relative to Recursively Nested Conditions (NEF), pp. 97–112.
HIMI-IKC-2015-WatanabeTA #abstraction #development #learning: Development of a Learning Support System for Reading Source Code by Stepwise Abstraction (KW, TT, TA), pp. 387–394.
ICML-2015-AllamanisTGW #modelling #natural language: Bimodal Modelling of Source Code and Natural Language (MA, DT, ADG, YW), pp. 2123–2132.
SEKE-2015-SchreiberMRM #comprehension #named #object-oriented: TAGGINGSENSE: Method Based On Sensemaking For Object-Oriented Source Code Comprehension (DS, ALAM, SSR, AM), pp. 278–283.
SKY-2015-BinunDL: Archiving Programs for the Future (AB, SD, YL), pp. 53–57.
SPLC-2015-FilhoABAB #empirical #java #product line: Assessing product line derivation operators applied to Java source code: an empirical study (JBFF, SA, OB, MA, BB), pp. 36–45.
ECOOP-2015-BostromM #composition #finite #verification: Modular Verification of Finite Blocking in Non-terminating Programs (PB, PM), pp. 639–663.
OOPSLA-2015-LopesO #how #java: How scale affects structure in Java programs (CVL, JO), pp. 675–694.
OOPSLA-2015-LopezMMNSVY #message passing #parallel #verification: Protocol-based verification of message-passing parallel programs (HAL, ERBM, FM, NN, CS, VTV, NY), pp. 280–298.
LOPSTR-2015-Seki #logic programming #on the: On Dual Programs in Co-Logic Programming (HS), pp. 21–35.
PADL-2015-CruzR #compilation #linear #logic programming #on the: On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities (FC, RR), pp. 34–49.
PADL-2015-TamaritVCM #c #haskell #implementation #program transformation #rule-based: A Haskell Implementation of a Rule-Based Program Transformation for C Programs (ST, GV, MC, JM), pp. 105–114.
PEPM-2015-AsadaS0 #first-order #functional #refinement #relational #verification: Verifying Relational Properties of Functional Programs by First-Order Refinement (KA, RS, NK), pp. 61–72.
PEPM-2015-VinayakaraoPN: Structurally Heterogeneous Source Code Examples from Unstructured Knowledge Sources (VV, RP, AVN), pp. 21–26.
PLDI-2015-ChuJT #automation #imperative #induction #proving: Automatic induction proofs of data-structures in imperative programs (DHC, JJ, MTT), pp. 457–466.
PLDI-2015-FaddegonC #algorithm #debugging #dependence #haskell #stack: Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack (MF, OC), pp. 33–42.
PLDI-2015-Huang #concurrent #model checking #reduction: Stateless model checking concurrent programs with maximal causality reduction (JH), pp. 165–174.
PLDI-2015-LalQ #graph: DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs (AL, SQ), pp. 280–290.
PLDI-2015-MehtaY #compilation #optimisation #scalability: Improving compiler scalability: optimizing large programs at small price (SM, PCY), pp. 143–152.
PLDI-2015-NguyenH #higher-order: Relatively complete counterexamples for higher-order programs (PCN, DVH), pp. 446–456.
PLDI-2015-NoriORV #performance #probability #synthesis: Efficient synthesis of probabilistic programs (AVN, SO, SKR, DV), pp. 208–217.
PLDI-2015-PrountzosMP #automation #graph #parallel: Synthesizing parallel graph programs via automated planning (DP, RM, KP), pp. 533–544.
PLDI-2015-RenJKAK #execution #hardware #performance #recursion: Efficient execution of recursive programs on commodity vector hardware (BR, YJ, SK, KA, MK), pp. 509–520.
PLDI-2015-SergeyNB #concurrent #fine-grained #verification: Mechanized verification of fine-grained concurrent programs (IS, AN, AB), pp. 77–87.
PLDI-2015-SharmaBA #gpu #verification: Verification of producer-consumer synchronization in GPU programs (RS, MB, AA), pp. 88–98.
POPL-2015-ElangoRPRS #complexity #data access #on the: On Characterizing the Data Access Complexity of Programs (VE, FR, LNP, JR, PS), pp. 567–580.
POPL-2015-GarciaC: Principal Type Schemes for Gradual Programs (RG, MC), pp. 303–315.
POPL-2015-NgoMMP #black box #policy #runtime #security: Runtime Enforcement of Security Policies on Black Box Reactive Programs (MN, FM, DM, FP), pp. 43–54.
POPL-2015-VeanesMML #string: Data-Parallel String-Manipulating Programs (MV, TM, DM, BL), pp. 139–152.
PPDP-2015-CaballeroGS #constraints #datalog #debugging: Debugging of wrong and missing answers for datalog programs with constraint handling rules (RC, YGR, FSP), pp. 55–66.
PPDP-2015-ChenLJZL #automation #declarative #network #safety #verification: Automated verification of safety properties of declarative networking programs (CC, LKL, LJ, WZ, BTL), pp. 79–90.
PPDP-2015-StievenartNMR #abstract interpretation #concurrent #debugging #detection #higher-order: Detecting concurrency bugs in higher-order programs through abstract interpretation (QS, JN, WDM, CDR), pp. 232–243.
SAS-2015-AlbertGG #analysis #interprocedural: May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization (EA, SG, PG), pp. 72–89.
ASE-2015-AlshanqitiH #contract #java #visual notation: Extracting Visual Contracts from Java Programs (T) (AMA, RH), pp. 104–114.
ASE-2015-FudabaOANHSTN #automation #named #pseudo: Pseudogen: A Tool to Automatically Generate Pseudo-Code from Source Code (HF, YO, KA, GN, HH, SS, TT, SN), pp. 824–829.
ASE-2015-HongLKJKKK #fault #locality #multi: Mutation-Based Fault Localization for Real-World Multilingual Programs (T) (SH, BL, TK, YJ, BK, YK, MK), pp. 464–475.
ASE-2015-KeSGB #code search #semantics: Repairing Programs with Semantic Code Search (T) (YK, KTS, CLG, YB), pp. 295–306.
ASE-2015-MercerAVS #model checking #parallel #using: Model Checking Task Parallel Programs Using Gradual Permissions (N) (EGM, PA, NV, VS), pp. 535–540.
ASE-2015-NguyenNN #approach #divide and conquer #migration #multi #statistics: Divide-and-Conquer Approach for Multi-phase Statistical Migration for Source Code (T) (ATN, TTN, TNN), pp. 585–596.
ASE-2015-OdaFNHSTN #learning #pseudo #statistics #using: Learning to Generate Pseudo-Code from Source Code Using Statistical Machine Translation (T) (YO, HF, GN, HH, SS, TT, SN), pp. 574–584.
ASE-2015-VasquezLVP #database #developer #documentation #how: How do Developers Document Database Usages in Source Code? (N) (MLV, BL, CV, DP), pp. 36–41.
ASE-2015-ZhengRLDS #named #parallel #verification: CIVL: Formal Verification of Parallel Programs (MZ, MSR, ZL, MBD, SFS), pp. 830–835.
ESEC-FSE-2015-BangAB #automation #complexity: Automatically computing path complexity of programs (LB, AA, TB), pp. 61–72.
ESEC-FSE-2015-BraioneDP #execution #symbolic computation: Symbolic execution of programs with heap inputs (PB, GD, MP), pp. 602–613.
ESEC-FSE-2015-CaiC #detection #effectiveness #java #precise: Effective and precise dynamic detection of hidden races for Java programs (YC, LC), pp. 450–461.
ESEC-FSE-2015-DharPDR #named #string: CLOTHO: saving programs from malformed strings and incorrect string-handling (AD, RP, MD, SR), pp. 555–566.
ESEC-FSE-2015-GuoKWYG #execution #parallel #symbolic computation #thread: Assertion guided symbolic execution of multithreaded programs (SG, MK, CW, ZY, AG), pp. 854–865.
ESEC-FSE-2015-KargenS #slicing #using: Turning programs against each other: high coverage fuzz-testing using binary-code mutation and dynamic slicing (UK, NS), pp. 782–792.
ESEC-FSE-2015-Yu #concurrent #named #testing: TACO: test suite augmentation for concurrent programs (TY), pp. 918–921.
ICSE-v1-2015-GaoXMZYZXM #c: Safe Memory-Leak Fixing for C Programs (QG, YX, YM, LZ, WY, ZZ, BX, HM), pp. 459–470.
ICSE-v1-2015-KusanoCW #generative #invariant #parallel #thread: Dynamic Generation of Likely Invariants for Multithreaded Programs (MK, AC, CW), pp. 835–846.
ICSE-v1-2015-TerragniCZ #concurrent #effectiveness #named #testing: RECONTEST: Effective Regression Testing of Concurrent Programs (VT, SCC, CZ), pp. 246–256.
ICSE-v2-2015-MaleticC #analysis #semiparsing #using: Exploration, Analysis, and Manipulation of Source Code Using srcML (JIM, MLC), pp. 951–952.
ICSE-v2-2015-McBurney #automation #documentation #generative #summary: Automatic Documentation Generation via Source Code Summarization (PWM), pp. 903–906.
ICSE-v2-2015-SanchezW #stack overflow: Source Code Curation on StackOverflow: The Vesperin System (HS, JW), pp. 661–664.
ICSE-v2-2015-Schwartz-Narbonne #c #named: VERMEER: A Tool for Tracing and Explaining Faulty C Programs (DSN, CO, MS, TW), pp. 737–740.
SAC-2015-JakobsW #analysis #data flow #proving: Programs from proofs of predicated dataflow analyses (MCJ, HW), pp. 1729–1736.
SAC-2015-ManhaesCZ #automation #performance #predict #student #towards: Towards automatic prediction of student performance in STEM undergraduate degree programs (LMBM, SMSdC, GZ), pp. 247–253.
SAC-2015-MilewiczVTQP #c #runtime: Runtime checking C programs (RM, RV, JT, DQ, PP), pp. 2107–2114.
SAC-2015-RighiVRRCFA #parallel: Rescheduling and checkpointing as strategies to run synchronous parallel programs on P2P desktop grids (RdRR, AV, VFR, GR, CAdC, KF, AMA), pp. 501–504.
SAC-2015-SakuraiM #debugging #object-oriented: The omission finder for debugging what-should-have-happened bugs in object-oriented programs (KS, HM), pp. 1962–1969.
GPCE-2015-FoustJP #constraints #data flow #generative #multi #user interface #visual notation: Generating reactive programs for graphical user interfaces from multi-way dataflow constraint systems (GF, JJ, SP), pp. 121–130.
ASPLOS-2015-RingenburgSACG #approximate #debugging #monitoring #quality: Monitoring and Debugging the Quality of Results in Approximate Programs (MFR, AS, IA, LC, DG), pp. 399–411.
CASE-2015-KouiderHOO #approach #graph #integer #linear #scheduling: Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling (AK, HAH, SO, AO), pp. 1177–1181.
CGO-2015-LuciaC #concurrent: Data provenance tracking for concurrent programs (BL, LC), pp. 146–156.
DATE-2015-RiefertCSRB #automation #generative #on the: On the automatic generation of SBST test programs for in-field test (AR, RC, MS, MSR, BB), pp. 1186–1191.
DATE-2015-TouatiBDGVBR #functional #power management #testing: Exploring the impact of functional test programs re-used for power-aware testing (AT, AB, LD, PG, AV, PB, MSR), pp. 1277–1280.
PDP-2015-OstroumovBW #modelling #parallel: Derivation of Parallel and Resilient Programs from Simulink Models (SO, PB, MAW), pp. 416–420.
PPoPP-2015-ChabbiLJSMI #parallel: Barrier elision for production parallel programs (MC, WL, WdJ, KS, JMMC, CI), pp. 109–119.
PPoPP-2015-McPhersonNSC #detection #legacy: Fence placement for legacy data-race-free programs via synchronization read detection (AJM, VN, SS, MC), pp. 249–250.
SOSP-2015-FangNXDL #memory management #scalability: Interruptible tasks: treating memory pressure as interrupts for highly scalable data-parallel programs (LF, KN, G(X, BD, SL), pp. 394–409.
ESOP-2015-0002S #automation #cost analysis #parallel: Automatic Static Cost Analysis for Parallel Programs (JH, ZS), pp. 132–157.
ESOP-2015-CoxCR #abstraction #multi: Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages (AC, BYEC, XR), pp. 483–509.
ESOP-2015-DavidKL #strict #termination: Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (CD, DK, ML), pp. 183–204.
ESOP-2015-DavidKL15a #reasoning #safety #termination: Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs (CD, DK, ML), pp. 661–684.
ESOP-2015-EmmiGMR #analysis: Analysis of Asynchronous Programs with Event-Based Synchronization (ME, PG, RM, FRV), pp. 535–559.
ESOP-2015-GordonRSBRGT #probability #query #spreadsheet: Probabilistic Programs as Spreadsheet Queries (ADG, CVR, MS, JB, NR, TG, DT), pp. 1–25.
ESOP-2015-Penninckx0P #behaviour #composition #verification: Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs (WP, BJ, FP), pp. 158–182.
ESOP-2015-TorontoMH #probability: Running Probabilistic Programs Backwards (NT, JM, DVH), pp. 53–79.
STOC-2015-CanettiH0V #obfuscation #ram: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (RC, JH, AJ, VV), pp. 429–437.
TACAS-2015-BloemCJK #concurrent #synthesis: Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information (RB, KC, SJ, RK), pp. 517–532.
TACAS-2015-ChenHTWW #contest #named #program transformation #recursion #text-to-text #verification: CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation — (Competition Contribution) (YFC, CH, MHT, BYW, FW), pp. 426–428.
TACAS-2015-ChistikovDM #approximate #estimation #probability #smt: Approximate Counting in SMT and Value Estimation for Probabilistic Programs (DVC, RD, RM), pp. 320–334.
TACAS-2015-DanglLW #contest #float #recursion: CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic — (Competition Contribution) (MD, SL, PW), pp. 423–425.
TACAS-2015-DemasiCRMA #fault tolerance #named #specification: syntMaskFT: A Tool for Synthesizing Masking Fault-Tolerant Programs from Deontic Specifications (RD, PFC, NR, TSEM, NA), pp. 188–193.
TACAS-2015-GurfinkelKN #c #contest #framework #named #verification: SeaHorn: A Framework for Verifying C Programs (Competition Contribution) (AG, TK, JAN), pp. 447–450.
TACAS-2015-Nguyen0TP #bound #c #contest #lazy evaluation: Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches — (Competition Contribution) (TLN, BF, SLT, GP), pp. 461–463.
TACAS-2015-StroderAFHG #c #contest #memory management #named #safety #termination: AProVE: Termination and Memory Safety of C Programs — (Competition Contribution) (TS, CA, FF, JH, JG), pp. 417–419.
TACAS-2015-TomascoI0TP15a #concurrent #memory management #verification: Verifying Concurrent Programs by Memory Unwinding (ET, OI, BF, SLT, GP), pp. 551–565.
TACAS-2015-TschannenFNP #functional #named #object-oriented #verification: AutoProof: Auto-Active Functional Verification of Object-Oriented Programs (JT, CAF, MN, NP), pp. 566–580.
CAV-2015-MajumdarW #bound #model checking #named: Bbs: A Phase-Bounded Model Checker for Asynchronous Programs (RM, ZW), pp. 496–503.
CAV-2015-HawblitzelPQT #automation #composition #concurrent #reasoning #refinement: Automated and Modular Refinement Reasoning for Concurrent Programs (CH, EP, SQ, ST), pp. 449–465.
CAV-2015-KuwaharaSU0 #abstraction #functional #higher-order #termination: Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs (TK, RS, HU, NK), pp. 287–303.
CSL-2015-SalvatiW #behaviour #higher-order: A Model for Behavioural Properties of Higher-order Programs (SS, IW), pp. 229–243.
CSL-2015-SchwentickVZ #static analysis: Static Analysis for Logic-based Dynamic Programs (TS, NV, TZ), pp. 308–324.
ICLP-2015-CruzRG #data-driven #logic programming #parallel #thread: Thread-Aware Logic Programming for Data-Driven Parallel Programs (FC, RR, SCG), pp. 191–203.
ICLP-2015-DamasioMA #debugging: Unifying Justifications and Debugging for Answer-Set Programs (CVD, JM, AA), pp. 260–273.
ICLP-2015-KieslST #analysis #on the: On Structural Analysis of Non-Ground Answer-Set Programs (BK, PS, HT), pp. 221–234.
ICLP-2015-YangSZ #bottom-up #evaluation #logic programming #manycore #parallel: Parallel Bottom-Up Evaluation of Logic Programs: DeALS on Shared-Memory Multicore Machines (MY, AS, CZ), pp. 6–17.
ICLP-2015-Zaniolo #algorithm #logic programming: Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs (CZ), pp. 287–300.
ICLP-J-2015-AngelisFPP #correctness #horn clause #imperative #proving: Proving correctness of imperative programs by linearizing constrained Horn clauses (EDA, FF, AP, MP), pp. 635–650.
ICLP-J-2015-BogaertsB #approximate #compilation #fixpoint #logic programming #using: Knowledge compilation of logic programs using approximation fixpoint theory (BB, GVdB), pp. 464–480.
ICLP-J-2015-FichteTW #logic programming: Dual-normal logic programs — the forgotten class (JKF, MT, SW), pp. 495–510.
LICS-2015-HackettH #exclamation: Programs for Cheap! (JH, GH), pp. 115–126.
VMCAI-2015-AdjeG #automation #invariant #linear #polynomial #synthesis: Automatic Synthesis of Piecewise Linear Quadratic Invariants for Programs (AA, PLG), pp. 99–116.
SIGMOD-2014-0001SW #data flow #named: BabbleFlow: a translator for analytic data flow programs (PJ, AS, KW), pp. 713–716.
EDM-2014-PeroH #detection #how #programming #question #student: How patterns in source codes of students can help in detection of their programming skills? (SP, TH), pp. 371–372.
ITiCSE-2014-DadicGR #automation #evaluation #student: Automatic evaluation of students’ programs (TD, VG, MR), p. 328.
SIGITE-2014-VihavainenLI #analysis: Analysis of source code snapshot granularity levels (AV, ML, PI), pp. 21–26.
CSMR-WCRE-2014-DietrichJB #empirical #evolution #java #library #problem: Broken promises: An empirical study into evolution problems in Java programs caused by library upgrades (JD, KJ, PB), pp. 64–73.
CSMR-WCRE-2014-OliveiraVL #metric: Extracting relative thresholds for source code metrics (PO, MTV, FPL), pp. 254–263.
ICPC-2014-BinkleyHLO #analysis #comprehension: Understanding LDA in source code analysis (DB, DH, DJL, JO), pp. 26–36.
ICPC-2014-HossenKP #maintenance: Amalgamating source code authors, maintainers, and change proneness to triage change requests (KH, HHK, DP), pp. 130–141.
ICPC-2014-McBurneyLMW #summary #topic: Improving topic model source code summarization (PWM, CL, CM, TW), pp. 291–294.
ICPC-2014-McBurneyM #automation #documentation #generative #summary: Automatic documentation generation via source code summarization of method context (PWM, CM), pp. 279–290.
ICPC-2014-NoughiMMC #behaviour #comprehension #database: Understanding the database manipulation behavior of programs (NN, MM, LM, AC), pp. 64–67.
ICPC-2014-VassalloPPC #developer #mining #named: CODES: mining source code descriptions from developers discussions (CV, SP, MDP, GC), pp. 106–109.
ICPC-2014-ZapalowskiNN #architecture: Revealing the relationship between architectural elements and source code characteristics (VZ, IN, DJN), pp. 14–25.
ICSME-2014-EddyK #code search #query #using: Using Structured Queries for Source Code Search (BPE, NAK), pp. 431–435.
ICSME-2014-HallKWM #automation #tool support: Establishing the Source Code Disruption Caused by Automated Remodularisation Tools (MH, MAK, NW, PM), pp. 466–470.
ICSME-2014-Kumar #collaboration #detection: Detecting Collaborative Patterns in Programs (KK), p. 664.
ICSME-2014-OliveiraLVS #metric #named: RTTool: A Tool for Extracting Relative Thresholds for Source Code Metrics (PO, FPL, MTV, AS), pp. 629–632.
ICSME-2014-SahaLKP #c #debugging #effectiveness #information retrieval #locality #on the: On the Effectiveness of Information Retrieval Based Bug Localization for C Programs (RKS, JL, SK, DEP), pp. 161–170.
ICSME-2014-TaoQ #analysis #concurrent #java #refactoring: Refactoring Java Concurrent Programs Based on Synchronization Requirement Analysis (BT, JQ), pp. 361–370.
MSR-2014-AkerblomSTW #python: Tracing dynamic features in python programs (BÅ, JS, MT, TW), pp. 292–295.
MSR-2014-KevicF #taxonomy: A dictionary to translate change tasks to source code (KK, TF), pp. 320–323.
MSR-2014-SteidlHJ #analysis #incremental: Incremental origin analysis of source code files (DS, BH, EJ), pp. 42–51.
MSR-2014-ZanjaniSK #commit #impact analysis #interactive: Impact analysis of change requests on source code based on interaction and commit histories (MBZ, GS, HHK), pp. 162–171.
SCAM-2014-Cortes-CoyVAP #automation #commit #generative #on the #summary: On Automatically Generating Commit Messages via Summarization of Source Code Changes (LFCC, MLV, JA, DP), pp. 275–284.
SCAM-2014-KawamitsuIKKRI #identification #repository #reuse #similarity #using: Identifying Source Code Reuse across Repositories Using LCS-Based Source Code Similarity (NK, TI, TK, RGK, CDR, KI), pp. 305–314.
SCAM-2014-PetiotBJKS #c #generative #testing: Instrumentation of Annotated C Programs for Test Generation (GP, BB, JJ, NK, JS), pp. 105–114.
SCAM-2014-YoshidaH #c #semiparsing #syntax: A Pattern Search Method for Unpreprocessed C Programs Based on Tokenized Syntax Trees (AY, YH), pp. 295–304.
ICALP-v1-2014-HsuRRU #linear: Privately Solving Linear Programs (JH, AR, TR, JU), pp. 612–624.
ICALP-v2-2014-ChistikovM #automaton: Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.
FM-2014-BlomH #concurrent #verification: The VerCors Tool for Verification of Concurrent Programs (SB, MH), pp. 127–131.
FM-2014-ForejtKNS #analysis #communication #precise #predict: Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs (VF, DK, GN, SS), pp. 263–278.
SFM-2014-GiachinoL #concurrent #detection #linear #recursion: Deadlock Detection in Linear Recursive Programs (EG, CL), pp. 26–64.
GRAPHITE-2014-ManskyGG #optimisation #parallel #specification: Specifying and Executing Optimizations for Parallel Programs (WM, DG, ELG), pp. 58–70.
ICGT-2014-JansenGN #execution #generative #induction #pointer #symbolic computation: Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs (CJ, FG, TN), pp. 65–80.
ICGT-2014-JansenN #generative #graph #pointer #summary: Generating Abstract Graph-Based Procedure Summaries for Pointer Programs (CJ, TN), pp. 49–64.
ICGT-2014-PoskittP #graph #higher-order #monad #verification: Verifying Monadic Second-Order Properties of Graph Programs (CMP, DP), pp. 33–48.
HCI-TMT-2014-HankiewiczB #performance #quality #using #word: Efficiency in Performing Basic Tasks Using Word Processing Programs by the Elderly as a Measure of the Ergonomic Quality of Software (KH, MB), pp. 481–488.
HCI-TMT-2014-RodriguesTN14a #heuristic #interactive: Heuristics for Assessing Emotional Response of Viewers during the Interaction with TV Programs (KRdHR, CACT, VPdAN), pp. 577–588.
HIMI-AS-2014-AraiKTKA #comprehension #development #learning: Development of a Learning Support System for Source Code Reading Comprehension (TA, HK, TT, YK, TA), pp. 12–19.
ICEIS-v2-2014-DingTZ #automation #c #c++: Automatic Removal of Buffer Overflow Vulnerabilities in C/C++ Programs (SD, HBKT, HZ), pp. 49–59.
ICML-c2-2014-MaddisonT #generative #modelling: Structured Generative Models of Natural Source Code (CJM, DT), pp. 649–657.
KDD-2014-ShakarianSPB #network #social: Reducing gang violence through network influence based targeting of social programs (PS, JS, WP, JB), pp. 1829–1836.
KR-2014-AsuncionZZ #first-order #logic programming #semantics: Logic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness (VA, YZ, HZ).
KR-2014-Lin #first-order #formal method #linear #logic: A Formalization of Programs in First-Order Logic with a Discrete Linear Order (FL).
KR-2014-Potyka #consistency #linear #logic #nondeterminism #probability: Linear Programs for Measuring Inconsistency in Probabilistic Logics (NP).
KR-2014-ShenZ #canonical #logic programming: Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (YS, XZ).
MLDM-2014-KhasnabishSDS #detection #learning #programming language #using: Detecting Programming Language from Source Code Using Bayesian Learning Techniques (JNK, MS, JD, GS), pp. 513–522.
SEKE-2014-Al-MsiedeenSHUV #implementation #object-oriented: Documenting the Mined Feature Implementations from the Object-oriented Source Code of a Collection of Software Product Variants (RAM, AS, MH, CU, SV), pp. 138–143.
SEKE-2014-JiangCKZD #model transformation #testing #using: Testing Model Transformation Programs using Metamorphic Testing (MJ, TYC, FCK, ZZ, ZD), pp. 94–99.
SEKE-2014-OliveiraMGND #framework #testing: An Extensible Framework to Implement Test Oracle for Non-Testable Programs (RAPO, AMM, VNG, FLSN, MED), pp. 199–204.
SEKE-2014-SantosBSC #game studies #learning #programming #semantics: A Semantic Analyzer for Simple Games Source Codes to Programming Learning (ECOdS, GBB, VHVdS, EC), pp. 522–527.
ECOOP-2014-AliRLDT #graph #scala: Constructing Call Graphs of Scala Programs (KA, MR, OL, JD, FT), pp. 54–79.
ECOOP-2014-LiT #analysis #fault #python: Finding Reference-Counting Errors in Python/C Programs with Affine Analysis (SL, GT), pp. 80–104.
OOPSLA-2014-BartensteinL: Rate types for stream programs (TB, YDL), pp. 213–232.
OOPSLA-2014-BerganGC #execution #parallel #symbolic computation #thread: Symbolic execution of multithreaded programs from arbitrary program contexts (TB, DG, LC), pp. 491–506.
OOPSLA-2014-Desai0M #proving #reduction #using: Natural proofs for asynchronous programs using almost-synchronous reductions (AD, PG, PM), pp. 709–725.
OOPSLA-2014-XiaoGZZZYWLCZ #named #reduction: Cybertron: pushing the limit on I/O reduction in data-parallel programs (TX, ZG, HZ, JZ, XZ, CY, XW, WL, WC, LZ), pp. 895–908.
AdaEurope-2014-BurgstallerB #ada #algebra #static analysis: Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects (BB, JB), pp. 27–42.
HILT-2014-RathjeR #framework #java #model checking #network: A framework for model checking UDP network programs with Java pathfinder (WR, BR), pp. 81–86.
LOPSTR-2014-ChowdhuryLCKY #approximate #case study #logic programming #polynomial #semantics: Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies (MSC, FL, WC, AK, JHY), pp. 279–296.
LOPSTR-2014-CornishGNSSS #array #program transformation: Analyzing Array Manipulating Programs by Program Transformation (JRMC, GG, JAN, PS, HS, PJS), pp. 3–20.
LOPSTR-2014-Drabent #logic programming #on the: On Completeness of Logic Programs (WD), pp. 261–278.
PADL-2014-AreiasR #correctness #logic programming #on the #performance: On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
PADL-2014-SonPL #multi #prolog: Two Applications of the ASP-Prolog System: Decomposable Programs and Multi-context Systems (TCS, EP, TL), pp. 87–103.
PEPM-2014-HanusS #analysis #composition #functional #logic programming: A modular and generic analysis server system for functional logic programs (MH, FS), pp. 181–188.
PLDI-2014-BallBGIKSSV #named #network #towards #verification: VeriCon: towards verifying controller programs in software-defined networks (TB, NB, AG, SI, AK, MS, MS, AV), p. 31.
PLDI-2014-Carbonneaux0RS #bound #c #verification: End-to-end verification of stack-space bounds for C programs (QC, JH, TR, ZS), p. 30.
PLDI-2014-GuptaSS #execution #parallel: Globally precise-restartable execution of parallel programs (GG, SS, GSS), p. 22.
PLDI-2014-HurNRS #probability #slicing: Slicing probabilistic programs (CKH, AVN, SKR, SS), p. 16.
PLDI-2014-Schkufza0A #float #optimisation #precise #probability: Stochastic optimization of floating-point programs with tunable precision (ES, RS, AA), p. 9.
PLDI-2014-SridharanGS #adaptation #execution #parallel #performance: Adaptive, efficient, parallel execution of parallel programs (SS, GG, GSS), p. 21.
PLDI-2014-SurendranRCMS #parallel #testing: Test-driven repair of data races in structured parallel programs (RS, RR, SC, JMMC, VS), p. 3.
POPL-2014-Birkedal #composition #concurrent #higher-order #imperative #reasoning: Modular reasoning about concurrent higher-order imperative programs (LB), pp. 1–2.
POPL-2014-CasinghinoSW #proving: Combining proofs and programs in a dependently typed language (CC, VS, SW), pp. 33–46.
POPL-2014-ChaudhuriFK #analysis #consistency: Consistency analysis of decision-making programs (SC, AF, ZK), pp. 555–568.
POPL-2014-LagoSA #functional #higher-order #induction #on the #probability: On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.
PPDP-2014-CruzRG #design #implementation #linear #logic programming #parallel #thread #virtual machine: Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs (FC, RR, SCG), pp. 43–54.
PPDP-2014-FerreiraP #bidirectional: Bidirectional Elaboration of Dependently Typed Programs (FF, BP), pp. 161–174.
PPDP-2014-Giacobazzi: Unveiling and Veiling Information in Programs (RG), pp. 211–212.
PPDP-2014-LucasM #declarative #logic #proving #termination: Proving Operational Termination of Declarative Programs in General Logics (SL, JM), pp. 111–122.
PPDP-2014-Schopp #low level #using: Organising Low-Level Programs using Higher Types (US), pp. 199–210.
PPDP-2014-StulovaMH #debugging #higher-order: Assertion-based Debugging of Higher-Order (C)LP Programs (NS, JFM, MVH), pp. 225–235.
SAS-2014-ChenHTWW #recursion #using #verification: Verifying Recursive Programs Using Intraprocedural Analyzers (YFC, CH, MHT, BYW, FW), pp. 118–133.
SAS-2014-CoxCR #analysis #automation: Automatic Analysis of Open Objects in Dynamic Language Programs (AC, BYEC, XR), pp. 134–150.
ASE-2014-FalleriMBMM #difference #fine-grained: Fine-grained and accurate source code differencing (JRF, FM, XB, MM, MM), pp. 313–324.
ASE-2014-HigoK #consistency #named #nondeterminism: MPAnalyzer: a tool for finding unintended inconsistencies in program source code (YH, SK), pp. 843–846.
ASE-2014-LuckowPDFV #approximate #execution #nondeterminism #probability #symbolic computation: Exact and approximate probabilistic symbolic execution for nondeterministic programs (KSL, CSP, MBD, AF, WV), pp. 575–586.
ASE-2014-TarvoR #analysis #automation #modelling #parallel #performance #thread: Automated analysis of multithreaded programs for performance modeling (AT, SPR), pp. 7–18.
FSE-2014-AllamanisS #mining: Mining idioms from source code (MA, CAS), pp. 472–483.
FSE-2014-BaltesSD #diagrams #sketching: Linking sketches and diagrams to source code artifacts (SB, PS, SD), pp. 743–746.
FSE-2014-EslamimehrP #concurrent #detection #named #scalability: Sherlock: scalable deadlock detection for concurrent programs (ME, JP), pp. 353–365.
FSE-2014-HigoK #case study #functional #how #java: How should we measure functional sameness from program source code? an exploratory study on Java methods (YH, SK), pp. 294–305.
ICSE-2014-CachoCFSCSGBG #c# #empirical #evolution #maintenance #robust: Trading robustness for maintainability: an empirical study of evolving c# programs (NC, TC, TF, ES, AC, RS, IG, EAB, AG), pp. 584–595.
ICSE-2014-CaiWC #approach #constraints #dynamic analysis #named #parallel #thread: ConLock: a constraint-based approach to dynamic checking on deadlocks in multithreaded programs (YC, SW, WKC), pp. 491–502.
ICSE-2014-JiangGXML #concurrent #java #named: CARE: cache guided deterministic replay for concurrent Java programs (YJ, TG, CX, XM, JL), pp. 457–467.
ICSE-2014-RodegheroMMBD #automation #summary: Improving automated source code summarization via an eye-tracking study of programmers (PR, CM, PWM, NB, SKD), pp. 390–401.
ICSE-2014-SiegmundKAPBLSB #comprehension #functional: Understanding understanding source code with functional magnetic resonance imaging (JS, CK, SA, CP, AB, TL, GS, AB), pp. 378–389.
SAC-2014-PereiraS #complexity #deduction: Complexity checking of ARM programs, by deduction (MP, SMdS), pp. 1309–1314.
SAC-2014-RiveraC #java: Translating event-B to JML-specified Java programs (VR, NC), pp. 1264–1271.
CC-2014-FeautrierVK #performance: Improving the Performance of X10 Programs by Clock Removal (PF, EV, AK), pp. 113–132.
CGO-2014-PanditG #execution #kernel #multi: Fluidic Kernels: Cooperative Execution of OpenCL Programs on Multiple Heterogeneous Devices (PP, RG), p. 273.
DAC-2014-AthavaleMHV #analysis #test coverage #using: Code Coverage of Assertions Using RTL Source Code Analysis (VA, SM, SH, SV), p. 6.
DAC-2014-EldibWTS #named: QMS: Evaluating the Side-Channel Resistance of Masked Software from Source Code (HE, CW, MMIT, PS), p. 6.
DAC-2014-KozhikkottuPPDR #clustering #parallel #thread: Variation Aware Cache Partitioning for Multithreaded Programs (VJK, AP, VSP, SD, AR), p. 6.
HPCA-2014-WangDDS #concurrent #memory management #multi #named #predict #thread: DraMon: Predicting memory bandwidth usage of multi-threaded programs with high accuracy and low overhead (WW, TD, JWD, MLS), pp. 380–391.
LCTES-2014-ChandramohanO #clustering #design #energy: Partitioning data-parallel programs for heterogeneous MPSoCs: time and energy design space exploration (KC, MFPO), pp. 73–82.
OSDI-2014-KimHZHWWS #abstraction #gpu #named #network: GPUnet: Networking Abstractions for GPU Programs (SK, SH, XZ, YH, AW, EW, MS), pp. 201–216.
PDP-2014-AcostaA #analysis #performance: Performance Analysis of Paralldroid Generated Programs (AA, FA), pp. 60–67.
PDP-2014-BarnatBH #model checking #parallel: Model Checking Parallel Programs with Inputs (JB, PB, VH), pp. 756–759.
PDP-2014-BaudischBS #communication #message passing: Reducing the Communication of Message-Passing Systems Synthesized from Synchronous Programs (DB, YB, KS), pp. 444–451.
PDP-2014-FalcoLOSTT #distributed #optimisation: Extremal Optimization with Guided State Changes in Load Balancing of Distributed Programs (IDF, EL, RO, US, ET, MT), pp. 228–231.
PPoPP-2014-AgrawalFSSU #data type #parallel #scheduling: Provably good scheduling for parallel programs that use data structures through implicit batching (KA, JTF, BS, JS, RU), pp. 389–390.
PPoPP-2014-EslamimehrP #concurrent #scheduling: Race directed scheduling of concurrent programs (ME, JP), pp. 301–314.
PPoPP-2014-LiuM #architecture #parallel #performance #thread: A tool to analyze the performance of multithreaded programs on NUMA architectures (XL, JMMC), pp. 259–272.
ESOP-2014-BrainDKS #generative #proving: Model and Proof Generation for Heap-Manipulating Programs (MB, CD, DK, PS), pp. 432–452.
ESOP-2014-KuwaharaTU0 #automation #functional #higher-order #termination #verification: Automatic Termination Verification for Higher-Order Functional Programs (TK, TT, HU, NK), pp. 392–411.
FASE-2014-GomesPG #bytecode #control flow #graph #java: Sound Control Flow Graph Extraction from Incomplete Java Bytecode Programs (PdCG, AP, DG), pp. 215–229.
FASE-2014-Zaharieva-StojanovskiH #concurrent #invariant #verification: Verifying Class Invariants in Concurrent Programs (MZS, MH), pp. 230–245.
FoSSaCS-2014-Tsukada0 #call-by #complexity #model checking: Complexity of Model-Checking Call-by-Value Programs (TT, NK), pp. 180–194.
STOC-2014-ForbesSS #algebra #branch #multi #order #set: Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
TACAS-2014-AngelisFPP #named #verification: VeriMAP: A Tool for Verifying Programs through Transformations (EDA, FF, AP, MP), pp. 568–574.
TACAS-2014-BrockschmidtEFFG #analysis #complexity #integer #runtime: Alternating Runtime and Size Complexity Analysis of Integer Programs (MB, FE, SF, CF, JG), pp. 140–155.
TACAS-2014-CaballeroMRT #debugging #declarative #erlang #named: EDD: A Declarative Debugger for Sequential Erlang Programs (RC, EMM, AR, ST), pp. 581–586.
TACAS-2014-TomascoI0TP #c #contest #memory management #named: MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings — (Competition Contribution) (ET, OI, BF, SLT, GP), pp. 402–404.
WRLA-2014-AlrahmanABL #concurrent #maude #memory management #modelling #question: Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? (YAA, MA, AB, ALL), pp. 21–41.
WRLA-2014-Genet #automaton #functional #static analysis #towards #using: Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.
CAV-2014-ChengHRS #automation #generative #named: G4LTL-ST: Automatic Generation of PLC Programs (CHC, CHH, HR, SS), pp. 541–549.
CAV-2014-HeizmannHP #analysis #learning #termination: Termination Analysis by Learning Terminating Programs (MH, JH, AP), pp. 797–813.
CAV-2014-InversoT0TP #bound #c #concurrent #lazy evaluation #model checking #multi #thread: Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization (OI, ET, BF, SLT, GP), pp. 585–602.
CAV-2014-KomuravelliGC #model checking #recursion #smt: SMT-Based Model Checking for Recursive Programs (AK, AG, SC), pp. 17–34.
CAV-2014-KupriyanovF #concurrent #multi #termination #thread: Causal Termination of Multi-threaded Programs (AK, BF), pp. 814–830.
CAV-2014-MadhavanK #bound #functional: Symbolic Resource Bound Inference for Functional Programs (RM, VK), pp. 762–778.
ICLP-J-2014-Antic #on the #set: On Cascade Products of Answer Set Programs (CA), pp. 711–723.
ICLP-J-2014-CabalarFF #graph #logic programming: Causal Graph Justifications of Logic Programs (PC, JF, MF), pp. 603–618.
ICLP-J-2014-GelfondZ #logic programming: Vicious Circle Principle and Logic Programs with Aggregates (MG, YZ), pp. 587–601.
ICLP-J-2014-SerranoLH #abstract interpretation #analysis #logic programming #resource management #using: Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (AS, PLG, MVH), pp. 739–754.
ICST-2014-KifetewJTOT #grammarware: Reproducing Field Failures for Programs with Complex Grammar-Based Input (FMK, WJ, RT, AO, PT), pp. 163–172.
ICST-2014-MoonKKY #fault #locality: Ask the Mutants: Mutating Faulty Programs for Fault Localization (SM, YK, MK, SY), pp. 153–162.
IJCAR-2014-GieslBEFFOPSSST #automation #proving #termination: Proving Termination of Programs Automatically with AProVE (JG, MB, FE, FF, CF, CO, MP, PSK, TS, SS, RT), pp. 184–191.
IJCAR-2014-StroderGBFFHS #memory management #pointer #proving #safety #termination: Proving Termination and Memory Safety for Programs with Pointer Arithmetic (TS, JG, MB, FF, CF, JH, PSK), pp. 208–223.
ISSTA-2014-BaudryAM #program transformation: Tailored source code transformations to synthesize computationally diverse program variants (BB, SA, MM), pp. 149–159.
ISSTA-2014-JustJE #database #fault #java #named #testing: Defects4J: a database of existing faults to enable controlled testing studies for Java programs (RJ, DJ, MDE), pp. 437–440.
ISSTA-2014-LeAGG #haskell #mutation testing #named #testing: MuCheck: an extensible tool for mutation testing of haskell programs (DL, MAA, RG, AG), pp. 429–432.
ISSTA-2014-LinK #automation #concurrent #multi #satisfiability #thread #using: Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability (YL, SSK), pp. 237–247.
ISSTA-2014-XuZXW #c #named: Canalyze: a static bug-finding tool for C programs (ZX, JZ, ZX, JW), pp. 425–428.
LICS-CSL-2014-LiangFS #composition #concurrent #refinement #verification: Compositional verification of termination-preserving refinement of concurrent programs (HL, XF, ZS), p. 10.
TAP-2014-KahkonenH #automation #lightweight #parallel #testing #thread: Lightweight State Capturing for Automated Testing of Multithreaded Programs (KK, KH), pp. 187–203.
VMCAI-2014-AngelisFPP #array #verification: Verifying Array Programs by Transforming Verification Conditions (EDA, FF, AP, MP), pp. 182–202.
VMCAI-2014-BozgaIK #integer #problem #safety: Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (MB, RI, FK), pp. 242–261.
VMCAI-2014-LeikeT #polynomial #synthesis: Synthesis for Polynomial Lasso Programs (JL, AT), pp. 434–452.
VMCAI-2014-SchwarzSVA #analysis #precise: Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs (MDS, HS, VV, KA), pp. 21–38.
CSEET-2013-ArdisBCVI #education #re-engineering #using: Using GSwE2009 in the creation and modification of graduate software engineering programs and related curricula (MAA, SB, LC, DV, SI), pp. 109–118.
ITiCSE-2013-HawthorneC #learning: ACM core IT learning outcomes for associate-degree programs (EKH, RDC), p. 357.
ITiCSE-2013-HowardS #communication #overview #re-engineering: A survey of communication skills in computerscience/software engineering (CS/SE) abet-accredited programs (AH, BS), p. 364.
SIGITE-2013-KushalnagarLO #community #student: A transition community for deaf and hard of hearing students in information technology programs (RSK, DEL, EMO), pp. 143–144.
SIGITE-2013-LuntA #identification: Identifying information technology graduate-level programs (BML, MQA), pp. 55–58.
SIGITE-2013-McGillSD #game studies #student: Demographics of undergraduate students in game degree programs in the US and UK (MM, AS, AD), pp. 43–50.
CSMR-2013-KazatoHKOOMHS #feature model #identification #incremental: Incremental Feature Location and Identification in Source Code (HK, SH, TK, TO, SO, SM, TH, MS), pp. 371–374.
CSMR-2013-MazzeoTBS: Linking E-Mails and Source Code with LASCO (LM, AT, RB, GS), pp. 421–424.
CSMR-2013-Molitorisz #process #refactoring: Pattern-Based Refactoring Process of Sequential Source Code (KM), pp. 357–360.
CSMR-2013-Pichler #documentation #experience #fortran #industrial: Extraction of Documentation from Fortran 90 Source Code: An Industrial Experience (JP), pp. 399–402.
CSMR-2013-ScannielloGT #comprehension #diagrams #sequence chart: An Early Investigation on the Contribution of Class and Sequence Diagrams in Source Code Comprehension (GS, CG, GT), pp. 367–370.
CSMR-2013-TothNFS #using #version control: Using Version Control History to Follow the Changes of Source Code Elements (ZT, GN, RF, IS), pp. 319–322.
ICPC-2013-BernhartG #code review #comprehension #on the: On the understanding of programs with continuous code reviews (MB, TG), pp. 192–198.
ICPC-2013-EddyRKC #replication #summary: Evaluating source code summarization techniques: Replication and expansion (BPE, JAR, NAK, JCC), pp. 13–22.
ICPC-2013-MurakamiHHIK #analysis #clone detection #detection #lightweight: Gapped code clone detection with lightweight source code analysis (HM, KH, YH, HI, SK), pp. 93–102.
ICPC-2013-SteidlHJ #analysis #quality: Quality analysis of source code comments (DS, BH, EJ), pp. 83–92.
ICSM-2013-AlhindawiDCM #feature model: Improving Feature Location by Enhancing Source Code with Stereotypes (NA, ND, MLC, JIM), pp. 300–309.
ICSM-2013-AsaduzzamanRSP #approach #hybrid #independence #named: LHDiff: A Language-Independent Hybrid Approach for Tracking Source Code Lines (MA, CKR, KAS, MDP), pp. 230–239.
ICSM-2013-AsaduzzamanRSP13a #maintenance #named #process: LHDiff: Tracking Source Code Lines to Support Software Maintenance Activities (MA, CKR, KAS, MDP), pp. 484–487.
ICSM-2013-CollardDM #analysis #framework #named #semiparsing #tool support: srcML: An Infrastructure for the Exploration, Analysis, and Manipulation of Source Code: A Tool Demonstration (MLC, MJD, JIM), pp. 516–519.
ICSM-2013-MorenoBHM #debugging #on the: On the Relationship between the Vocabulary of Bug Reports and Source Code (LM, WB, SH, AM), pp. 452–455.
ICSM-2013-ScannielloR #fault #identifier: Dealing with Faults in Source Code: Abbreviated vs. Full-Word Identifier Names (GS, MR), pp. 190–199.
ICSM-2013-XinQHXZWG #concurrent #empirical: An Automation-Assisted Empirical Study on Lock Usage for Concurrent Programs (RX, ZQ, SH, CX, YZ, YW, HG), pp. 100–109.
MSR-2013-AllamanisS13a #mining #modelling #repository #using: Mining source code repositories at massive scale using language modeling (MA, CAS), pp. 207–216.
MSR-2013-JanjicHSA #dataset #research #reuse: An unabridged source code dataset for research in software reuse (WJ, OH, MS, CA), pp. 339–342.
MSR-2013-WangDZCXZ #api #mining: Mining succinct and high-coverage API usage patterns from source code (JW, YD, HZ, KC, TX, DZ), pp. 319–328.
SCAM-2013-FabryRJ #analysis: Aspectual source code analysis with GASR (JF, CDR, VJ), pp. 53–62.
SCAM-2013-MarcozziVH #algorithm #constraints #database #execution #relational #symbolic computation #testing: A relational symbolic execution algorithm for constraint-based testing of database programs (MM, WV, JLH), pp. 179–188.
ICALP-v2-2013-BartheO #composition #difference #logic #privacy #probability #relational #theorem: Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (GB, FO), pp. 49–60.
IFM-2013-Abrial #proving: From Z to B and then Event-B: Assigning Proofs to Meaningful Programs (JRA), pp. 1–15.
TLCA-2013-SeveriV #modelling: Completeness of Conversion between Reactive Programs for Ultrametric Models (PS, FJdV), pp. 221–235.
ICFP-2013-AxelssonC #functional #higher-order #syntax #using: Using circular programs for higher-order syntax: functional pearl (EA, KC), pp. 257–262.
ICFP-2013-McDonellCKL #functional #gpu #optimisation: Optimising purely functional GPU programs (TLM, MMTC, GK, BL), pp. 49–60.
IFL-2013-HackettHJ #approach #optimisation #recursion: The Under-Performing Unfold: A new approach to optimising corecursive programs (JH, GH, MJ), p. 1.
GCM-J-2012-PoskittP #correctness #graph #verification: Verifying Total Correctness of Graph Programs (CMP, DP).
CHI-2013-KatoSI #named #representation: Picode: inline photos representing posture data in source code (JK, DS, TI), pp. 3097–3100.
HCI-IMT-2013-OkuuchiKKK #modelling: Modeling Situation-Dependent Nonverbal Expressions for a Pair of Embodied Agent in a Dialogue Based on Conversations in TV Programs (KO, KK, TK, DK), pp. 340–347.
HCI-UC-2013-RodriguesNT #interactive #multi: Interaction of the Elderly Viewer with Additional Multimedia Content to Support the Appreciation of Television Programs (KRdHR, VPdAN, CACT), pp. 227–236.
OCSC-2013-YamauchiHN #analysis #twitter: Searching Emotional Scenes in TV Programs Based on Twitter Emotion Analysis (TY, YH, YIN), pp. 432–441.
VISSOFT-2013-BeckHDW #embedded #monitoring #visual notation: Visual monitoring of numeric variables embedded in source code (FB, FH, SD, DW), pp. 1–4.
VISSOFT-2013-ServantJ #named #slicing #visualisation: Chronos: Visualizing slices of source-code history (FS, JAJ), pp. 1–4.
ICEIS-v2-2013-ToureSA #enterprise #modelling #validation: A2MO and ETREOSys — Analyzing, Modeling and Validation of Enterprise Training Programs (FT, MS, EA), pp. 310–316.
ICML-c1-2013-BuhlerRSH #clustering #community #detection #set: Constrained fractional set programs and their application in local clustering and community detection (TB, SSR, SS, MH), pp. 624–632.
KDIR-KMIS-2013-PereiraRT #data mining #mining #student: Extraction Student Dropout Patterns with Data Mining Techniques in Undergraduate Programs (RTP, ACR, JJT), pp. 136–142.
KEOD-2013-Cruz-FilipeNG #logic programming #multi #ontology: Patterns for Interfacing between Logic Programs and Multiple Ontologies (LCF, IN, GG), pp. 58–69.
SEKE-2013-Al-MsiedeenSHUVS #concept analysis #mining #object-oriented #semantics #using: Mining Features from the Object-Oriented Source Code of a Collection of Software Variants Using Formal Concept Analysis and Latent Semantic Indexing (RAM, ADS, MH, CU, SV, HES), pp. 244–249.
SEKE-2013-AlshammariFC #bytecode #java #metric #security: Security Metrics for Java Bytecode Programs (BA, CJF, DC), pp. 394–399.
SEKE-2013-QiHW #combinator #concurrent #testing: A Mixed-way Combinatorial Testing for Concurrent Programs (XQ, JH, PW), pp. 699–702.
SEKE-2013-RamosRO #process #towards: Towards a strategy for analysing benefits of Software Process Improvement programs (CSR, ARR, KMdO), pp. 638–643.
SEKE-2013-TerraBMVSCB #similarity: Measuring the Structural Similarity between Source Code Entities (RT, JB, LFM, MTV, DS, DC, RdSB), pp. 753–758.
SEKE-2013-YuanYL #debugging #fine-grained #predict: Bug Prediction for Fine-Grained Source Code Changes (ZY, LY, CL), pp. 381–387.
MoDELS-2013-PiresPWD #behaviour #embedded #verification: Behavioural Verification in Embedded Software, from Model to Source Code (AFP, TP, VW, SD), pp. 320–335.
SPLC-2013-KandaII #evolution: Extraction of product evolution tree from source code of product variants (TK, TI, KI), pp. 141–150.
SPLC-2013-TsuchiyaKWKFY #requirements #traceability: Recovering traceability links between requirements and source code in the same series of software products (RT, TK, HW, MK, YF, KY), pp. 121–130.
ECOOP-2013-LernerELK #static typing: Combining Form and Function: Static Types for JQuery Programs (BSL, LE, JL, SK), pp. 79–103.
OOPSLA-2013-BerganCG #parallel #thread: Input-covering schedules for multithreaded programs (TB, LC, DG), pp. 677–692.
OOPSLA-2013-CarbinMR #hardware #reliability #verification: Verifying quantitative reliability for programs that execute on unreliable hardware (MC, SM, MCR), pp. 33–52.
OOPSLA-2013-RaychevVS #concurrent #detection #effectiveness: Effective race detection for event-driven programs (VR, MTV, MS), pp. 151–166.
OOPSLA-2013-Xu #named #optimisation #profiling: Resurrector: a tunable object lifetime profiling technique for optimizing real-world programs (G(X), pp. 111–130.
HILT-2013-Taft #concurrent #named #parallel #proving #safety #thread #tutorial: Tutorial: proving safety of parallel / multi-threaded programs (STT), pp. 1–2.
LOPSTR-2013-LiqatKSGLGHE #analysis #energy #modelling: Energy Consumption Analysis of Programs Based on XMOS ISA-Level Models (UL, SK, AS, KG, PLG, NG, MVH, KE), pp. 72–90.
LOPSTR-2013-Seki #logic programming #model checking: Extending Co-logic Programs for Branching-Time Model Checking (HS), pp. 127–144.
PADL-2013-LiangK #automation #logic programming #named #scalability: Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs (SL, MK), pp. 173–189.
PEPM-2013-AngelisFPP #verification: Verifying programs via iterated specialization (EDA, FF, AP, MP), pp. 43–52.
PEPM-2013-SatoUK #higher-order #model checking #scalability #towards: Towards a scalable software model checker for higher-order programs (RS, HU, NK), pp. 53–62.
PEPM-2013-SunCZ #analysis #constraints #locality: Constraint-based locality analysis for X10 programs (QS, YC, JZ), pp. 137–146.
PLDI-2013-CookK #nondeterminism #reasoning: Reasoning about nondeterminism in programs (BC, EK), pp. 219–230.
PLDI-2013-SankaranarayananCG #probability #static analysis: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths (SS, AC, SG), pp. 447–458.
PLDI-2013-SwamyWSCL #higher-order #monad #verification: Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
POPL-2013-Dinsdale-YoungBGPY #composition #concurrent #named #reasoning: Views: compositional reasoning for concurrent programs (TDY, LB, PG, MJP, HY), pp. 287–300.
POPL-2013-RompfSABJLJOO #compilation #data type #optimisation #staging: Optimizing data structures in high-level programs: new directions for extensible compilers based on staging (TR, AKS, NA, KJB, VJ, HL, MJ, KO, MO), pp. 497–510.
POPL-2013-UnnoTK #automation #functional #higher-order #verification: Automating relatively complete verification of higher-order functional programs (HU, TT, NK), pp. 75–86.
PPDP-2013-CalauttiGT #decidability #detection #logic programming: Detecting decidable classes of finitely ground logic programs with function symbols (MC, SG, IT), pp. 239–250.
PPDP-2013-ChristiansenHRS #encapsulation #functional #logic programming #semantics: A semantics for weakly encapsulated search in functional logic programs (JC, MH, FR, DS), pp. 49–60.
QAPL-2013-NgoH #analysis #concurrent #multi #security #thread: Quantitative Security Analysis for Multi-threaded Programs (TMN, MH), pp. 34–48.
SAS-2013-BrainDGHK #float #verification: Interpolation-Based Verification of Floating-Point Programs with Abstract CDCL (MB, VD, AG, LH, DK), pp. 412–432.
SAS-2013-Goubault #abstract interpretation #static analysis: Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and FLUCTUAT (EG), pp. 1–3.
SAS-2013-Komondoor #abstract interpretation #imperative #precise #slicing: Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation (RK), pp. 259–282.
SAS-2013-MajumdarMW #message passing #verification: Static Provenance Verification for Message Passing Programs (RM, RM, ZW), pp. 366–387.
SAS-2013-PartushY #difference #semantics: Abstract Semantic Differencing for Numerical Programs (NP, EY), pp. 238–258.
SAS-2013-Roy: From Concrete Examples to Heap Manipulating Programs (SR), pp. 126–149.
REFSQ-2013-DelaterP #development #perspective #requirements #research: Analyzing the Tracing of Requirements and Source Code during Software Development — A Research Preview (AD, BP), pp. 308–314.
ASE-2013-ChoDS #bound #composition #model checking #named: BLITZ: Compositional bounded model checking for real-world programs (CYC, VD, DS), pp. 136–146.
ASE-2013-Demasi #fault tolerance #logic #specification: Synthesizing fault-tolerant programs from deontic logic specifications (RD), pp. 750–753.
ASE-2013-KifetewJTOT #approach #grammarware #named: SBFR: A search based approach for reproducing failures of programs with grammar based input (FMK, WJ, RT, AO, PT), pp. 604–609.
ASE-2013-LiRSDC #data flow #generative #named: SEDGE: Symbolic example data generation for dataflow programs (KL, CR, YS, YD, CC), pp. 235–245.
ASE-2013-MoritzVPGMG #api #detection #named #repository #scalability #visualisation: ExPort: Detecting and visualizing API usages in large source code repositories (EM, MLV, DP, MG, CM, MG), pp. 646–651.
ASE-2013-PalombaBPOLP #detection #smell #using: Detecting bad smells in source code using change history information (FP, GB, MDP, RO, ADL, DP), pp. 268–278.
ASE-2013-TasharofiPLJ #automation #named #testing: Bita: Coverage-guided, automatic testing of actor programs (ST, MP, YL, REJ), pp. 114–124.
ESEC-FSE-2013-NavabpourJWBMBF #c #named #runtime #verification: RiTHM: a tool for enabling time-triggered runtime verification for C programs (SN, YJ, CWWW, SB, RM, BB, SF), pp. 603–606.
ESEC-FSE-2013-NguyenNNN #semantics #statistics: A statistical semantic language model for source code (TTN, ATN, HAN, TNN), pp. 532–542.
ICSE-2013-Guerrouj #comprehension #normalisation #quality: Normalizing source code vocabulary to support program comprehension and software quality (LG), pp. 1385–1388.
ICSE-2013-HaiducRBOLM #code search #predict #quality #query: Query quality prediction and reformulation for source code search: the refoqus tool (SH, GDR, GB, RO, ADL, AM), pp. 1307–1310.
ICSE-2013-HaoLM0J #multi #named: MCT: a tool for commenting programs by multimedia comments (YH, GL, LM, LZ, ZJ), pp. 1339–1342.
ICSE-2013-Leino: Developing verified programs with dafny (KRML), pp. 1488–1490.
ICSE-2013-LiZLXLLX #distributed: A characteristic study on failures of production distributed data-parallel programs (SL, HZ, HL, TX, HL, WL, TX), pp. 963–972.
ICSE-2013-MarinoHDVTV #concurrent #detection: Detecting deadlock in programs with data-centric synchronization (DM, CH, JD, MV, FT, JV), pp. 322–331.
ICSE-2013-Park #comprehension #concurrent #fault: Fault comprehension for concurrent programs (SP), pp. 1444–1446.
ICSE-2013-Zeid #contest #evaluation #framework #integration #re-engineering #student: A framework to evaluate software engineering student contests: evaluation and integration with academic programs (AZ), pp. 1083–1089.
SAC-2013-AlitavoliJE #java #novel: A novel watermarking method for Java programs (MA, MJ, AE), pp. 1013–1018.
SAC-2013-ChenLWW #abstraction #static analysis: Static analysis of list-manipulating programs via bit-vectors and numerical abstractions (LC, RL, XW, JW), pp. 1204–1210.
SAC-2013-DelahayeKS #c #dynamic analysis #specification: Common specification language for static and dynamic analysis of C programs (MD, NK, JS), pp. 1230–1235.
SAC-2013-GouwBJW #case study #industrial #java #runtime: Run-time checking of data- and protocol-oriented properties of Java programs: an industrial case study (SdG, FSdB, EBJ, PYHW), pp. 1573–1578.
SAC-2013-MoriguchiW #interactive #reuse: An interactive extension mechanism for reusing verified programs (SM, TW), pp. 1236–1243.
LDTA-J-2009-ChilowiczDR #sequence: Viewing functions as token sequences to highlight similarities in source code (MC, ÉD, GR), pp. 1871–1891.
LDTA-J-2009-LammelTK #fault #programming #traversal: Programming errors in traversal programs over structured data (RL, SJT, MK), pp. 1770–1808.
GPCE-2013-0001RN #abstract syntax tree #declarative #fine-grained #mining: Declarative visitors to ease fine-grained source code mining with full history on billions of AST nodes (RD, HR, TNN), pp. 23–32.
ASPLOS-2013-LuciaC #empirical #parallel #thread: Cooperative empirical failure avoidance for multithreaded programs (BL, LC), pp. 39–50.
ASPLOS-2013-SchulteDWF #assembly #automation #embedded: Automated repair of binary and assembly programs for cooperating embedded devices (EMS, JD, WW, SF), pp. 317–328.
CGO-2013-ChoKWLLM #concurrent: Practical lock/unlock pairing for concurrent programs (HKC, TK, YW, SL, HL, SAM), p. 12.
CGO-2013-GreweWO #parallel: Portable mapping of data parallel programs to OpenCL for heterogeneous systems (DG, ZW, MFPO), p. 10.
CGO-2013-RodriguesCP #integer #performance: A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.
CGO-2013-TanFG #detection #fault #lightweight: Lightweight fault detection in parallelized programs (LT, MF, RG), p. 11.
PPoPP-2013-AcarCR #parallel #scheduling: Scheduling parallel programs by work stealing with private deques (UAA, AC, MR), pp. 219–228.
PPoPP-2013-CaiZWC #detection #named #parallel #thread: TeamWork: synchronizing threads globally to detect real deadlocks for multithreaded programs (YC, KZ, SW, WKC), pp. 311–312.
PPoPP-2013-ParkSI #concurrent #detection #scalability: Scalable data race detection for partitioned global address space programs (CSP, KS, CI), pp. 305–306.
PPoPP-2013-YukiFRS #analysis #array #data flow: Array dataflow analysis for polyhedral X10 programs (TY, PF, SVR, VS), pp. 23–34.
ESOP-2013-BouajjaniEEH #concurrent #specification #verification: Verifying Concurrent Programs against Sequential Specifications (AB, ME, CE, JH), pp. 290–309.
ESOP-2013-FilliatreP #named #proving #why: Why3 — Where Programs Meet Provers (JCF, AP), pp. 125–128.
ESOP-2013-KobayashiI #higher-order #model checking #recursion: Model-Checking Higher-Order Programs with Recursive Types (NK, AI), pp. 431–450.
FoSSaCS-2013-HofmannRS #morphism #pointer: Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.
TACAS-2013-BhatBGR #functional #probability: Deriving Probability Density Functions from Probabilistic Functional Programs (SB, JB, ADG, CVR), pp. 508–522.
TACAS-2013-FalkeMS #bound #c #contest #model checking #named #using: LLBMC: Improved Bounded Model Checking of C Programs Using LLVM — (Competition Contribution) (SF, FM, CS), pp. 623–626.
TACAS-2013-GantyIK #approximate #integer #summary: Underapproximation of Procedure Summaries for Integer Programs (PG, RI, FK), pp. 245–259.
TACAS-2013-GodefroidY #analysis: Analysis of Boolean Programs (PG, MY), pp. 214–229.
TACAS-2013-PopeeaR #concurrent #contest #multi #named #thread #verification: Threader: A Verifier for Multi-threaded Programs — (Competition Contribution) (CP, AR), pp. 633–636.
CADE-2013-HawblitzelKLR #automation #proving #theorem proving #towards #using: Towards Modularly Comparing Programs Using Automated Theorem Provers (CH, MK, SKL, HR), pp. 282–299.
CAV-2013-BarnatBHHKLRSW #c #c++ #model checking #parallel #thread: DiVinE 3.0 — An Explicit-State Model Checker for Multithreaded C & C++ Programs (JB, LB, VH, JH, JK, ML, PR, VS, JW), pp. 863–868.
CAV-2013-KroeningLW #approximate #c #detection #performance: Under-Approximating Loops in C Programs for Fast Counterexample Detection (DK, ML, GW), pp. 381–396.
CAV-2013-WonischSW #proving: Programs from Proofs — A PCC Alternative (DW, AS, HW), pp. 912–927.
ICLP-J-2013-LiangK #analysis #logic programming #scalability: A practical analysis of non-termination in large logic programs (SL, MK), pp. 705–719.
ICLP-J-2013-YouZZ #logic programming #quantifier: Disjunctive logic programs with existential quantification in rule heads (JHY, HZ, YZ), pp. 563–578.
ICST-2013-BagnaraCGG #float #generative #testing: Symbolic Path-Oriented Test Data Generation for Floating-Point Programs (RB, MC, RG, AG), pp. 1–10.
ICST-2013-ChristakisGS #concurrent #detection #erlang #fault #testing: Systematic Testing for Detecting Concurrency Errors in Erlang Programs (MC, AG, KFS), pp. 154–163.
ICTSS-2013-SapraMCGC #execution #fault #python #symbolic computation #using: Finding Errors in Python Programs Using Dynamic Symbolic Execution (SS, MM, SC, AG, EMC), pp. 283–289.
ISSTA-2013-BindalBL #bound #concurrent #parallel #testing #thread: Variable and thread bounding for systematic testing of multithreaded programs (SB, SB, AL), pp. 145–155.
ISSTA-2013-HanazumiM #generative #java: Generation of Java programs properties from test purposes (SH, ACVdM), pp. 362–365.
ISSTA-2013-LuoR #named #parallel #runtime #thread: EnforceMOP: a runtime property enforcement system for multithreaded programs (QL, GR), pp. 156–166.
TAP-2013-CaballeroMRT #debugging #declarative #erlang: A Declarative Debugger for Sequential Erlang Programs (RC, EMM, AR, ST), pp. 96–114.
TAP-2013-KosmatovPS #proving #tutorial: A Lesson on Proof of Programs with Frama-C. Invited Tutorial Paper (NK, VP, JS), pp. 168–177.
VMCAI-2013-ChakiGKS #composition: Compositional Sequentialization of Periodic Programs (SC, AG, SK, OS), pp. 536–554.
CSEET-2012-AroraG #collaboration #learning #programming: Learning to Write Programs with Others: Collaborative Quadruple Programming (RA, SG), pp. 32–41.
CSEET-2012-Kajko-Mattsson #design #education #re-engineering: A Method for Designing Software Engineering Educational Programs (MKM), pp. 139–143.
ITiCSE-2012-Moreno #comparison #evaluation #framework: A qualitative framework for comparison and evaluation of computer science doctoral programs (MdCCM), p. 398.
ITiCSE-2012-PoonSTK #corpus #detection: Instructor-centric source code plagiarism detection and plagiarism corpus (JYHP, KS, YFT, MYK), pp. 122–127.
ITiCSE-2012-Ragonis #algorithm #education: Integrating the teaching of algorithmic patterns into computer science teacher preparation programs (NR), pp. 339–344.
SIGITE-2012-ZhangRRBW #health: Developing and improving interdisciplinary health information technology certificate programs (CZ, HR, BR, BB, AJAW), pp. 43–48.
CSMR-2012-BettenburgTH #code search #fuzzy #using: Using Fuzzy Code Search to Link Code Fragments in Discussions to Source Code (NB, SWT, AEH), pp. 319–328.
CSMR-2012-ShahDM: Making Smart Moves to Untangle Programs (SMAS, JD, CM), pp. 359–364.
CSMR-2012-YoshidaKI #approach #functional #maintenance #metric: A Cohesion Metric Approach to Dividing Source Code into Functional Segments to Improve Maintainability (NY, MK, HI), pp. 365–370.
CSMR-2012-ZiadiFSZ #identification: Feature Identification from the Source Code of Product Variants (TZ, LF, MAAdS, MZ), pp. 417–422.
ICPC-2012-CorleyKK #modelling #topic: Modeling the ownership of source code topics (CSC, EAK, NAK), pp. 173–182.
ICPC-2012-IshioEI #data flow #interprocedural #lightweight #visualisation: A lightweight visualization of interprocedural data-flow paths for source code reading (TI, SE, KI), pp. 37–46.
ICPC-2012-Keivanloo #clone detection #code search #detection: Leveraging clone detection for Internet-scale source code search (IK), pp. 277–280.
ICPC-2012-LuciaPOPP #information retrieval #question #using: Using IR methods for labeling source code artifacts: Is it worthwhile? (ADL, MDP, RO, AP, SP), pp. 193–202.
ICPC-2012-PanichellaAPMC #developer #mining: Mining source code descriptions from developer communications (SP, JA, MDP, AM, GC), pp. 63–72.
ICPC-2012-SharafiSGA #identifier #women: Women and men — Different but equal: On the impact of identifier style on source code reading (ZS, ZS, YGG, GA), pp. 27–36.
ICSM-2012-HamiltonD #community #dependence: Dependence communities in source code (JH, SD), pp. 579–582.
ICSM-2012-HayashiOZMS #refactoring: Refactoring edit history of source code (SH, TO, TZ, KM, MS), pp. 617–620.
ICSM-2012-KuangMHGHJE #comprehension #dependence #question #requirements #traceability: Do data dependencies in source code complement call dependencies for understanding requirements traceability? (HK, PM, HH, AG, LH, JL, AE), pp. 181–190.
ICSM-2012-KumarSS #c++: Rejuvenating C++ programs through demacrofication (AK, AS, BS), pp. 98–107.
ICSM-2012-QiML #automation #performance #scalability #using: Making automatic repair for large-scale programs more efficient using weak recompilation (YQ, XM, YL), pp. 254–263.
ICSM-2012-RamaKVP #detection #version control: Version history based source code plagiarism detection in proprietary systems (GMR, DK, SAV, SP), pp. 609–612.
SCAM-2012-LazarescuL #analysis #c #dependence #parallel: Dynamic Trace-Based Data Dependency Analysis for Parallelization of C Programs (MTL, LL), pp. 126–131.
WCRE-2012-FavreLLSV #documentation: Linking Documentation and Source Code in a Software Chrestomathy (JMF, RL, ML, TS, AV), pp. 335–344.
WCRE-2012-HemelK #case study #clone detection #detection #linux #reverse engineering #using #variability: Reverse Engineering Variability in Source Code Using Clone Detection: A Case Study for Linux Variants of Consumer Electronic Devices (AH, RK), pp. 357–366.
WCRE-2012-IchiiMNCO #approach #automation #modelling #rule-based: A Rule-based Automated Approach for Extracting Models from Source Code (MI, TM, YN, MC, HO), pp. 308–317.
WCRE-2012-RomanoRPK #fine-grained #using: Analyzing the Impact of Antipatterns on Change-Proneness Using Fine-Grained Source Code Changes (DR, PR, MP, FK), pp. 437–446.
ICALP-v1-2012-GuptaN #approximate #integer #online: Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.
ICALP-v1-2012-MolinaroR #geometry #linear #online: Geometry of Online Packing Linear Programs (MM, RR), pp. 701–713.
IFM-2012-DongolH #multi #reasoning: Rely/Guarantee Reasoning for Teleo-reactive Programs over Multiple Time Bands (BD, IJH), pp. 39–53.
IFM-2012-JiB #java #named: PE-KeY: A Partial Evaluator for Java Programs (RJ, RB), pp. 283–295.
IFM-2012-LensinkSE #concurrent #framework #proving: A Proof Framework for Concurrent Programs (LL, SS, MCJDvE), pp. 174–190.
SEFM-2012-AmighiGGH #control flow #exception #graph #java: Sound Control-Flow Graph Extraction for Java Programs with Exceptions (AA, PdCG, DG, MH), pp. 33–47.
SEFM-2012-ZhuXMQQ #approach #concurrent #verification: The Rely/Guarantee Approach to Verifying Concurrent BPEL Programs (HZ, QX, CM, SQ, ZQ), pp. 172–187.
FLOPS-2012-Terauchi #automation #functional #higher-order #verification: Automated Verification of Higher-Order Functional Programs (TT), p. 2.
Haskell-2012-FarmerGKS #haskell #interactive #plugin: The HERMIT in the machine: a plugin for the interactive transformation of GHC core language programs (AF, AG, EK, NS), pp. 1–12.
ICFP-2012-EarlSMH #analysis #automaton #higher-order: Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.
ICFP-2012-PereraACL #functional: Functional programs that explain their work (RP, UAA, JC, PBL), pp. 365–376.
ICFP-2012-SimoesVFJH #analysis #automation #functional #lazy evaluation #memory management: Automatic amortised analysis of dynamic memory allocation for lazy functional programs (HRS, PBV, MF, SJ, KH), pp. 165–176.
IFL-2012-Magalhaes #optimisation: Optimisation of Generic Programs Through Inlining (JPM), pp. 104–121.
CIG-2012-FradeVC #assessment #database: Aesthetic Terrain Programs database for creativity assessment (MF, FFdV, CC), pp. 350–354.
ICGT-2012-Poskitt #graph #verification: Verification of Graph Programs (CMP), pp. 420–422.
KR-2012-BahmaniBKL #declarative #dependence #set: Declarative Entity Resolution via Matching Dependencies and Answer Set Programs (ZB, LEB, SK, LVSL).
KR-2012-Feier #logic programming #reasoning #worst-case: Worst-Case Optimal Reasoning with Forest Logic Programs (CF).
KR-2012-GottlobS #datalog #ontology #query #recursion: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
KR-2012-LeoneMTV: Efficiently Computable Datalog∃ Programs (NL, MM, GT, PV).
KR-2012-Lifschitz #logic programming: Logic Programs with Intensional Functions (VL).
KR-2012-OetschPPST #on the #testing: On the Small-Scope Hypothesis for Testing Answer-Set Programs (JO, MP, JP, MS, HT).
KR-2012-SlotaL #equivalence #modelling #robust #semantics: Robust Equivalence Models for Semantic Updates of Answer-Set Programs (MS, JL).
KR-2012-WangZZZ #equivalence #logic programming: Forgetting in Logic Programs under Strong Equivalence (YW, YZ, YZ, MZ).
SEKE-2012-dArceGCE #aspect-oriented #coordination #visualisation: Coordination Model to Support Visualization of Aspect-Oriented Programs (ÁFd, REG, RCMC, DME), pp. 168–173.
SEKE-2012-HumairaSOWF #framework #metric #multi #programming language #towards: Towards a Unified Source Code Measurement Framework Supporting Multiple Programming Languages (RH, KS, AO, HW, YF), pp. 480–485.
SEKE-2012-MeloSS #effectiveness #evaluation #parallel #testing #thread: Structural Testing for Multithreaded Programs: An Experimental Evaluation of the Cost, Strength and Effectiveness (SMM, SdRSdS, PSLdS), pp. 476–479.
SEKE-2012-QiXW #concurrent #graph #interprocedural #reachability #slicing: Slicing Concurrent Interprocedural Programs Based on Program Reachability Graphs (XQ, XX, PW), pp. 293–298.
SEKE-2012-RebeloLMOR #aspect-oriented #contract: Enforcing Contracts for Aspect-oriented programs with Annotations, Pointcuts and Advice (HR, RMFL, AM, CALO, MR), pp. 148–153.
MoDELS-2012-GravinoRST #comprehension #design pattern #developer #documentation #replication: Do Professional Developers Benefit from Design Pattern Documentation? A Replication in the Context of Source Code Comprehension (CG, MR, GS, GT), pp. 185–201.
PLEASE-2012-Duszynski0 #variability: Recovering variability information from the source code of similar software products (SD, MB), pp. 37–40.
ECOOP-2012-DiasDSL #java #memory management #transaction #verification: Verification of Snapshot Isolation in Transactional Memory Java Programs (RJD, DD, JCS, JL), pp. 640–664.
ECOOP-2012-NegaraVCJD #evolution #question #version control: Is It Dangerous to Use Version Control Histories to Study Source Code Evolution? (SN, MV, NC, REJ, DD), pp. 79–103.
OOPSLA-2012-HuangZ12a #concurrent #execution: Execution privatization for scheduler-oblivious concurrent programs (JH, CZ), pp. 737–752.
OOPSLA-2012-MeawadRMV #automation #exclamation #javascript: Eval begone!: semi-automated removal of eval from javascript programs (FM, GR, FM, JV), pp. 607–620.
OOPSLA-2012-MishneSY #code search #semantics: Typestate-based semantic code search over partial programs (AM, SS, EY), pp. 997–1016.
OOPSLA-2012-ParizekL #abstraction #java: Predicate abstraction of Java programs with collections (PP, OL), pp. 75–94.
OOPSLA-2012-PrountzosMP #concurrent #graph #named: Elixir: a system for synthesizing concurrent graph programs (DP, RM, KP), pp. 375–394.
OOPSLA-2012-YuNPP #named #parallel #testing #thread: Maple: a coverage-driven testing tool for multithreaded programs (JY, SN, CP, GP), pp. 485–502.
PLATEAU-2012-UrmaM #evolution #programming language #query: Programming language evolution via source code query languages (RGU, AM), pp. 35–38.
TOOLS-EUROPE-2012-DerezinskaR #c# #evaluation #object-oriented #quality #standard: Quality Evaluation of Object-Oriented and Standard Mutation Operators Applied to C# Programs (AD, MR), pp. 42–57.
AdaEurope-2012-FariaMP #ada #approach #model checking: An Approach to Model Checking Ada Programs (JMF, JM, JSP), pp. 105–118.
AdaEurope-2012-RuizCM #ada #development: Source Code as the Key Artifact in Requirement-Based Development: The Case of Ada 2012 (JFR, CC, YM), pp. 49–59.
HILT-2012-Leino: Developing verified programs with Dafny (KRML), pp. 9–10.
LOPSTR-2012-DandoisV #logic programming #semantics: Semantic Code Clones in Logic Programs (CD, WV), pp. 35–50.
LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #symbolic computation #term rewriting: Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
LOPSTR-2012-Niwa0S: Improving Determinization of Grammar Programs for Program Inversion (MN, NN, MS), pp. 155–175.
LOPSTR-2012-Seki #logic programming #program transformation #proving: Proving Properties of Co-logic Programs with Negation by Program Transformations (HS), pp. 213–227.
PEPM-2012-Katayama #functional #induction #programming: An analytical inductive functional programming system that avoids unintended programs (SK), pp. 43–52.
PEPM-2012-KobayashiMS #functional: Functional programs as compressed data (NK, KM, AS), pp. 121–130.
PLDI-2012-CarbinKMR #approximate #nondeterminism #proving: Proving acceptability properties of relaxed nondeterministic approximate programs (MC, DK, SM, MCR), pp. 169–180.
PLDI-2012-CarteyLM #domain-specific language: Synthesising graphics card programs from DSLs (LC, RL, OdM), pp. 121–132.
PLDI-2012-WuTHCY #analysis #parallel #precise: Sound and precise analysis of parallel programs through schedule specialization (JW, YT, GH, HC, JY), pp. 205–216.
POPL-2012-BouajjaniE #analysis #parallel #recursion: Analysis of recursively parallel programs (AB, ME), pp. 203–214.
POPL-2012-FarzanK #composition #concurrent #reasoning #verification: Verification of parameterized concurrent programs by modular reasoning about data and control (AF, ZK), pp. 297–308.
PPDP-2012-BacciCFV #automation #first-order #specification #synthesis: Automatic synthesis of specifications for first order curry programs (GB, MC, MAF, AV), pp. 25–34.
PPDP-2012-GieslSSEF #evaluation #graph #logic programming #symbolic computation #term rewriting: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
PPDP-2012-MarpleBMG #execution #set: Goal-directed execution of answer set programs (KM, AB, RM, GG), pp. 35–44.
QAPL-2012-GazeauMP #analysis #float #robust: A non-local method for robustness analysis of floating point programs (IG, DM, CP), pp. 63–76.
SAS-2012-AbdullaACLR #abstraction #automation #integer: Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.
SAS-2012-CacheraJJK #imperative #invariant #polynomial: Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases (DC, TPJ, AJ, FK), pp. 58–74.
SAS-2012-EmmiL #distributed: Finding Non-terminating Executions in Distributed Asynchronous Programs (ME, AL), pp. 439–455.
SAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #reachability: Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.
SAS-2012-MadhavanRV #analysis #composition #higher-order: Modular Heap Analysis for Higher-Order Programs (RM, GR, KV), pp. 370–387.
RE-2012-CharradaKG #identification #requirements: Identifying outdated requirements based on source code changes (EBC, AK, MG), pp. 61–70.
ASE-2012-HarmanLJWAC #challenge #programming #search-based #using: The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (MH, WBL, YJ, DRW, AA, JAC), pp. 1–14.
ASE-2012-KahkonenSH #automation #parallel #testing #thread #using: Using unfoldings in automated testing of multithreaded programs (KK, OS, KH), pp. 150–159.
ASE-2012-LiT #api #automation #erlang #migration #refactoring: Automated API migration in a user-extensible refactoring tool for Erlang programs (HL, SJT), pp. 294–297.
ASE-2012-LuciaLJB #evolution #named #testing: kbe-anonymity: test data anonymization for evolving programs (L, DL, LJ, AB), pp. 262–265.
ASE-2012-SongT #model checking #named: PuMoC: a CTL model-checker for sequential programs (FS, TT), pp. 346–349.
FSE-2012-EmmiLQ: Asynchronous programs with prioritized task-buffers (ME, AL, SQ), p. 48.
FSE-2012-FarzanMRS #concurrent #predict: Predicting null-pointer dereferences in concurrent programs (AF, PM, NR, FS), p. 47.
FSE-2012-GanaiLG #analysis #concurrent #multi #named #thread: DTAM: dynamic taint analysis of multi-threaded programs for relevancy (MKG, DL, AG), p. 46.
FSE-2012-ZhangKK #evolution #fault #impact analysis #java #named: FaultTracer: a change impact and regression fault analysis tool for evolving Java programs (LZ, MK, SK), p. 40.
ICSE-2012-Jaafar #analysis #evolution #on the: On the analysis of evolution of software artefacts and programs (FJ), pp. 1563–1566.
ICSE-2012-McMillanHPCM #agile #prototype #recommendation: Recommending source code for use in rapid software prototypes (CM, NH, DP, JCH, BM), pp. 848–858.
ICSE-2012-NguyenNNTNAN #code completion #graph: Graph-based pattern-oriented, context-sensitive source code completion (ATN, TTN, HAN, AT, HVN, JMAK, TNN), pp. 69–79.
ICSE-2012-Rodes #layout #stack #towards: Stack layout transformation: Towards diversity for securing binary programs (BR), pp. 1543–1546.
ICSE-2012-Stolee #lightweight #semantics #specification: Finding suitable programs: Semantic search with incomplete and lightweight specifications (KTS), pp. 1571–1574.
SAC-2012-CruzFP #verification: Verification conditions for single-assignment programs (DCdC, MJF, JSP), pp. 1264–1270.
SAC-2012-DandamudiWH #animation #comprehension #framework: An animation framework for improving the comprehension of TinyOS programs (SD, SKW, JOH), pp. 1625–1631.
SAC-2012-LavazzaMTT #empirical #java #open source #reliability: An empirical investigation of perceived reliability of open source Java programs (LL, SM, DT, DT), pp. 1109–1114.
SAC-2012-ZaraketNSJ #architecture #library #parallel #using: Portable Parallel Programs using architecture-aware libraries (FAZ, MN, MS, AJ), pp. 1922–1924.
CGO-2012-CampanoniJHRWB #automation #named #parallel: HELIX: automatic parallelization of irregular programs for chip multiprocessing (SC, TMJ, GHH, VJR, GYW, DMB), pp. 84–93.
CGO-2012-ZouR #detection #parallel: Scan detection and parallelization in “inherently sequential” nested loop programs (YZ, SVR), pp. 74–83.
DAC-2012-KumarBKV #analysis #predict #using: Early prediction of NBTI effects using RTL source code analysis (JAK, KMB, HK, SV), pp. 808–813.
DATE-2012-CongHLZZ #replication #streaming: Combining module selection and replication for throughput-driven streaming programs (JC, MH, BL, PZ, YZ), pp. 1018–1023.
ISMM-2012-InoueN #hardware #identification #java: Identifying the sources of cache misses in Java programs without relying on hardware counters (HI, TN), pp. 133–142.
ISMM-2012-SeweMSABRG #behaviour #comparison #java #memory management #scala: new Scala() instance of Java: a comparison of the memory behaviour of Java and Scala programs (AS, MM, AS, DA, WB, NPR, SZG), pp. 97–108.
LCTES-2012-FarhadKBS #deployment #multi: Profile-guided deployment of stream programs on multicores (SMF, YK, BB, BS), pp. 79–88.
LCTES-2012-YuYWCC #consistency #parallel: Symbolic consistency checking of OpenMp parallel programs (FY, SCY, FW, GCC, CCC), pp. 139–148.
PDP-2012-BorkowskiT #distributed #process: Global Control in Distributed Programs with Dynamic Process Membership (JB, MT), pp. 525–529.
PDP-2012-DaniASB #concurrent #named #parallel #predict #thread: TCP: Thread Contention Predictor for Parallel Programs (AMD, BA, YNS, CB), pp. 19–26.
PPoPP-2012-EomYJD #named #object-oriented: DOJ: dynamically parallelizing object-oriented programs (YHE, SY, JCJ, BD), pp. 85–96.
PPoPP-2012-NollG #framework #optimisation #parallel: An infrastructure for dynamic optimization of parallel programs (AN, TRG), pp. 325–326.
ESOP-2012-InoueT #multi #reasoning: Reasoning about Multi-stage Programs (JI, WT), pp. 357–376.
ESOP-2012-LuPZX #parallel #thread: A Type and Effect System for Determinism in Multithreaded Programs (YL, JP, CZ, JX), pp. 518–538.
FASE-2012-AlbertBGHR: Verified Resource Guarantees for Heap Manipulating Programs (EA, RB, SG, RH, GRD), pp. 130–145.
FoSSaCS-2012-BoveDS #automation #first-order #functional #interactive #reasoning: Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs (AB, PD, ASR), pp. 104–118.
STOC-2012-Belovs: Span programs for functions with constant-sized 1-certificates: extended abstract (AB), pp. 77–84.
STOC-2012-DvirMPY #branch #multi: Separating multilinear branching programs and formulas (ZD, GM, SP, AY), pp. 615–624.
TACAS-2012-BaslerDKKTW #c #contest #named #verification: satabs: A Bit-Precise Verifier for C Programs — (Competition Contribution) (GB, AFD, AK, DK, MT, TW), pp. 552–555.
TACAS-2012-BouajjaniE #analysis #bound #message passing: Bounded Phase Analysis of Message-Passing Programs (AB, ME), pp. 451–465.
TACAS-2012-DudkaMPV #contest #data type #linked data #named #open data #verification: Predator: A Verification Tool for Programs with Dynamic Linked Data Structures — (Competition Contribution) (KD, PM, PP, TV), pp. 545–548.
TACAS-2012-PopeeaR #composition #concurrent #multi #proving #termination #thread: Compositional Termination Proofs for Multi-threaded Programs (CP, AR), pp. 237–251.
CAV-2012-AtigBEL #detection #parallel #thread: Detecting Fair Non-termination in Multithreaded Programs (MFA, AB, ME, AL), pp. 210–226.
CAV-2012-BodikT #constraints #theorem proving: Synthesizing Programs with Constraint Solvers (RB, ET), p. 3.
CAV-2012-BrockschmidtMOG #automation #java #proving #termination: Automated Termination Proofs for Java Programs with Cyclic Data (MB, RM, CO, JG), pp. 105–122.
CAV-2012-ChaudhuriS #named #optimisation: Euler: A System for Numerical Optimization of Programs (SC, ASL), pp. 732–737.
CAV-2012-EsparzaGK #probability #proving #termination #using: Proving Termination of Probabilistic Programs Using Patterns (JE, AG, SK), pp. 123–138.
CAV-2012-HagueL #analysis #bound #parallel #thread: Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters (MH, AWL), pp. 260–276.
CAV-2012-KahlonW #concurrent: Lock Removal for Concurrent Trace Programs (VK, CW), pp. 227–242.
CAV-2012-KieferMOWW #named #probability: APEX: An Analyzer for Open Probabilistic Programs (SK, ASM, JO, BW, JW), pp. 693–698.
CAV-2012-LahiriHKR #imperative #named #semantics: SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs (SKL, CH, MK, HR), pp. 712–717.
CAV-2012-Schwartz-NarbonneLAM #debugging #named #parallel: passert: A Tool for Debugging Parallel Programs (DSN, FL, DIA, SM), pp. 751–757.
ICLP-2012-Balduccini #set: An Answer Set Solver for non-Herbrand Programs: Progress Report (MB), pp. 49–60.
ICLP-2012-GrecoST #logic programming #on the #termination: On the Termination of Logic Programs with Function Symbols (SG, FS, IT), pp. 323–333.
ICLP-2012-Lifschitz #logic programming: Two-Valued Logic Programs (VL), pp. 259–266.
ICLP-2012-NievesL #logic programming: Possibilistic Nested Logic Programs (JCN, HL), pp. 267–276.
ICLP-2012-OetschPT #constraints #semantics: An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions (JO, JP, HT), pp. 222–234.
ICLP-2012-YouMB #semantics: Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs (JHY, JM, YB), pp. 235–246.
ICLP-J-2012-Cervesato #compilation #logic programming: An Improved Proof-Theoretic Compilation of Logic Programs (IC), pp. 639–657.
ICLP-J-2012-IslamRR #logic programming #probability #random: Inference in probabilistic logic programs with continuous random variables (MAI, CRR, IVR), pp. 505–523.
ICLP-J-2012-Martin #logic programming #semantics: Contextual hypotheses and semantics of logic programs (EM), pp. 843–887.
ICLP-J-2012-Vidal #independence #logic programming #partial evaluation: Annotation of logic programs for independent AND-parallelism by partial evaluation (GV), pp. 583–600.
ICLP-J-2012-VosKOPT: Annotating answer-set programs in Lana (MDV, DGK, JO, JP, HT), pp. 619–637.
ICST-2012-ChittimalliS #framework #modelling #named: GEMS: A Generic Model Based Source Code Instrumentation Framework (PKC, VS), pp. 909–914.
ICST-2012-Kannavara #static analysis: Securing Opensource Code via Static Analysis (RK), pp. 429–436.
ICST-2012-PonsiniMR #abstract interpretation #analysis #constraints #float #programming: Combining Constraint Programming and Abstract Interpretation for Value Analysis of Floating-point Programs (OP, CM, MR), pp. 775–776.
ICST-2012-Wotawa #challenge #constraints #fault #open science #research #using: Open Research Challenges of Localizing Faults in Programs Using Constraints (FW), pp. 770–771.
IJCAR-2012-BoerBR #automation #pointer #recursion #verification: Automated Verification of Recursive Programs with Pointers (FSdB, MMB, JR), pp. 149–163.
ISSTA-2012-CoughlinCDS #what: Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say (DC, BYEC, AD, JGS), pp. 276–286.
ISSTA-2012-HongAPKH #concurrent #testing: Testing concurrent programs to achieve high synchronization coverage (SH, JA, SP, MK, MJH), pp. 210–220.
ISSTA-2012-ThiesB #java #named #refactoring: RefaFlex: safer refactorings for reflective Java programs (AT, EB), pp. 1–11.
VMCAI-2012-BouajjaniDES #abstract domain #automation #infinity #reasoning: Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (AB, CD, CE, MS), pp. 1–22.
VMCAI-2012-ChakiGS #concurrent #multi #thread #verification: Regression Verification for Multi-threaded Programs (SC, AG, OS), pp. 119–135.
VMCAI-2012-CharltonHR #higher-order #named #verification: Crowfoot: A Verifier for Higher-Order Store Programs (NC, BH, BR), pp. 136–151.
VMCAI-2012-MorseVMM #c #message passing #modelling: Modeling Asynchronous Message Passing for C Programs (EM, NV, EM, JM), pp. 332–347.
VMCAI-2012-SiegelZ #execution #invariant #parallel #symbolic computation: Loop Invariant Symbolic Execution for Parallel Programs (SFS, TKZ), pp. 412–427.
VLDB-2011-HerodotouB #cost analysis #optimisation #pipes and filters #profiling: Profiling, What-if Analysis, and Cost-based Optimization of MapReduce Programs (HH, SB), pp. 1111–1122.
VLDB-2011-JahaniCR #automation #optimisation #pipes and filters: Automatic Optimization for MapReduce Programs (EJ, MJC, CR), pp. 385–396.
CSEET-2011-GimenesBB #distance #learning #re-engineering: International workshop on distance learning support for postgraduate programs in software engineering (e-gradSE) (IMdSG, LB, EFB), pp. 517–519.
ITiCSE-2011-BarrosBV #java #named #object-oriented #programming #sequence #visualisation: Java2Sequence: a tool for the visualization of object-oriented programs in introductory programming (JPB, LB, MV), p. 369.
ITiCSE-2011-LangCPEA #student: Outreach programs to promote computer science and ict to high school and middle school students (CL, AC, JP, MALE, RA), pp. 344–345.
ITiCSE-2011-VirsedaM #debugging #education #semantics #verification: An innovative teaching tool based on semantic tableaux for verification and debugging of programs (RdVV, FPM), p. 352.
SIGITE-2011-McGill #framework #game studies: Motivations and informing frameworks of game degree programs in the United Kingdom and the United States (MM), pp. 67–72.
SIGITE-2011-RoweLH #assessment #framework #identification: An assessment framework for identifying information technology programs (DCR, BML, CRGH), pp. 123–128.
SCAM-J-2009-Giffhorn11 #concurrent: Advanced chopping of sequential and concurrent programs (DG), pp. 239–294.
CSMR-2011-HayaseKMI: Building Domain Specific Dictionaries of Verb-Object Relation from Source Code (YH, YK, YM, KI), pp. 93–100.
ICPC-2011-BurrowsTGF #aspect-oriented #evaluation #fault #reasoning: Reasoning about Faults in Aspect-Oriented Programs: A Metrics-Based Evaluation (RB, FT, AG, FCF), pp. 131–140.
ICPC-2011-CordyR #named #open source #performance: DebCheck: Efficient Checking for Open Source Code Clones in Software Systems (JRC, CKR), pp. 217–218.
ICPC-2011-EitanGHMW #comprehension #on the #visualisation: On Visualization and Comprehension of Scenario-Based Programs (NE, MG, DH, AM, GW), pp. 189–192.
ICPC-2011-PanchenkoKPZ #database #precise #query #scalability #using: Precise and Scalable Querying of Syntactical Source Code Patterns Using Sample Code Snippets and a Database (OP, JK, HP, AZ), pp. 41–50.
ICPC-2011-ScannielloM #clustering #concept: Clustering Support for Static Concept Location in Source Code (GS, AM), pp. 1–10.
ICPC-2011-Storey #interactive #java #revisited #visualisation: An Interactive Visualization Environment for Exploring Java Programs: SHriMP Views Revisited (MADS), p. xviii.
ICSM-2011-BiggersEKE #metric #towards: Toward a metrics suite for source code lexicons (LRB, BPE, NAK, LHE), pp. 492–495.
ICSM-2011-JiresalCN #cobol #detection #precise #scalability: Precise detection of un-initialized variables in large, real-life COBOL programs in presence of unrealizable paths (RJ, AC, RN), pp. 448–456.
ICSM-2011-LawrieB #identifier: Expanding identifiers to normalize source code vocabulary (DL, DB), pp. 113–122.
ICSM-2011-NishizonoMVM #comprehension #empirical #evolution #industrial #maintenance #metric #predict: Source code comprehension strategies and metrics to predict comprehension effort in software maintenance and evolution tasks — an empirical study with industry practitioners (KN, SM, RV, KiM), pp. 473–481.
ICSM-2011-RastkarMB #generative #natural language #summary: Generating natural language summaries for crosscutting source code concerns (SR, GCM, AWJB), pp. 103–112.
ICSM-2011-RomanoP #interface #java #metric #predict #using: Using source code metrics to predict change-prone Java interfaces (DR, MP), pp. 303–312.
ICSM-2011-RomanoSRG #clustering #design pattern: Clustering and lexical information support for the recovery of design pattern in source code (SR, GS, MR, CG), pp. 500–503.
ICSM-2011-Roover #detection #logic #metaprogramming #object-oriented: A logic meta-programming foundation for example-driven pattern detection in object-oriented programs (CDR), pp. 556–561.
ICSM-2011-Scanniello: Source code survival with the Kaplan Meier (GS), pp. 524–527.
ICSM-2011-WieseHH #comparison #identifier: A comparison of stemmers on source code identifiers for software search (AW, VH, EH), pp. 496–499.
MSR-2011-GermanD #challenge: Apples vs. oranges?: an exploration of the challenges of comparing the source code of two software systems (DMG, JD), pp. 246–249.
MSR-2011-GigerPG #debugging #fine-grained #predict: Comparing fine-grained source code changes and code churn for bug prediction (EG, MP, HCG), pp. 83–92.
MSR-2011-ThomasAHB #evolution #modelling #topic: Modeling the evolution of topics in source code histories (SWT, BA, AEH, DB), pp. 173–182.
SCAM-2011-AbebeHTM #concept #smell: The Effect of Lexicon Bad Smells on Concept Location in Source Code (SLA, SH, PT, AM), pp. 125–134.
SCAM-2011-Gold #analysis #music #programming: Knitting Music and Programming: Reflections on the Frontiers of Source Code Analysis (NG), pp. 10–14.
SCAM-2011-NicolayRMJ #automation #higher-order #parallel: Automatic Parallelization of Side-Effecting Higher-Order Scheme Programs (JN, CDR, WDM, VJ), pp. 185–194.
WCRE-2011-AliGA #clustering #object-oriented #requirements #traceability: Requirements Traceability for Object Oriented Systems by Partitioning Source Code (NA, YGG, GA), pp. 45–54.
WCRE-2011-DuszynskiKB #multi #reuse: Analyzing the Source Code of Multiple Software Variants for Reuse Potential (SD, JK, MB), pp. 303–307.
WCRE-2011-GrantCS #analysis #concept #reverse engineering #using: Reverse Engineering Co-maintenance Relationships Using Conceptual Analysis of Source Code (SG, JRC, DBS), pp. 87–91.
WCRE-2011-GravinoRST #comprehension #design pattern #documentation: Does the Documentation of Design Pattern Instances Impact on Source Code Comprehension? Results from Two Controlled Experiments (CG, MR, GS, GT), pp. 67–76.
WCRE-2011-HaslingerLE #feature model #modelling #reverse engineering #set: Reverse Engineering Feature Models from Programs’ Feature Sets (ENH, RELH, AE), pp. 308–312.
WCRE-2011-KellensRNSJ #evolution #quantifier #reasoning #using: Reasoning over the Evolution of Source Code Using Quantified Regular Path Expressions (AK, CDR, CN, RS, VJ), pp. 389–393.
WCRE-2011-NonnenSI #research: Locating the Meaning of Terms in Source Code Research on “Term Introduction” (JN, DS, PI), pp. 99–108.
WCRE-2011-Panchenko #code search #database #in memory: In-Memory Database Support for Source Code Search and Analytics (OP), pp. 421–424.
WCRE-2011-ScholzK #multi #protocol #thread: Object-Based Dynamic Protocol Recovery for Multi-Threading Programs (BS, RK), pp. 251–260.
ICALP-v1-2011-AllenderW #algebra #branch #on the #power of: On the Power of Algebraic Branching Programs of Width Two (EA, FW), pp. 736–747.
ICALP-v2-2011-BrazdilKKV #analysis #bound #probability #recursion #runtime: Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.
FM-2011-BartheCK #relational #using #verification: Relational Verification Using Product Programs (GB, JMC, CK), pp. 200–214.
FM-2011-GherghinaDQC #specification #verification: Structured Specifications for Better Verification of Heap-Manipulating Programs (CG, CD, SQ, WNC), pp. 386–401.
RTA-2011-BrockschmidtOG #bytecode #composition #java #proving #recursion #term rewriting #termination: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (MB, CO, JG), pp. 155–170.
RTA-2011-FalkeKS #analysis #c #compilation #termination #using: Termination Analysis of C Programs Using Compiler Intermediate Languages (SF, DK, CS), pp. 41–50.
RTA-2011-Weirich #proving: Combining Proofs and Programs (SW), p. 9.
SEFM-2011-TschannenFNM #object-oriented #verification: Usable Verification of Object-Oriented Programs by Combining Static and Dynamic Techniques (JT, CAF, MN, BM), pp. 382–398.
TLCA-2011-Weirich #proving: Combining Proofs and Programs (SW), p. 9.
CEFP-2011-Butterfield #functional #reasoning: Reasoning about I/O in Functional Programs (AB), pp. 93–141.
ICFP-2011-Chargueraud #imperative #verification: Characteristic formulae for the verification of imperative programs (AC), pp. 418–430.
ICFP-2011-ChenDHA #functional #self: Implicit self-adjusting computation for purely functional programs (YC, JD, MAH, UAA), pp. 129–141.
IFL-2011-MiddelkoopEP #functional: Functional Instrumentation of ActionScript Programs with Asil (AM, ABE, WP), pp. 1–16.
IFL-2011-ReichNR #canonical #generative #lazy evaluation: Lazy Generation of Canonical Test Programs (JSR, MN, CR), pp. 69–84.
DiGRA-2011-ZagalS #education #game studies #overview: A Survey of Final Project Courses in Game Programs: Considerations for Teaching Capstone (JPZ, JS).
GCM-2010-PlumpSS11 #automaton #finite #graph: Minimizing Finite Automata with Graph Programs (DP, RS, AS).
HIMI-v1-2011-WuS #abstraction #visualisation: Visualizing Programs on Different Levels of Abstractions (JHW, JS), pp. 66–75.
VISSOFT-2011-LonnbergBM #concurrent #dependence #graph #visualisation: Visualising concurrent programs with dynamic dependence graphs (JL, MBA, LM), pp. 1–4.
ICEIS-v3-2011-JuniorNI #execution #identification #legacy #overview: Survey and Proposal of a Method for Business Rules Identification in Legacy Systems Source Code and Execution Logs (WARJ, GSdN, CI), pp. 207–213.
ICML-2011-RoyLM #bound #polynomial: From PAC-Bayes Bounds to Quadratic Programs for Majority Votes (JFR, FL, MM), pp. 649–656.
SEKE-2011-YooLJC #independence #named: FBDtoVerilog: A Vendor-Independent Translation from FBDs into Verilog Programs (JY, JHL, SJ, SDC), pp. 48–51.
BX-2011-Cleve #co-evolution #using: Co-evolving schemas and programs using coupled transformations (AC), p. 54.
ECOOP-2011-ZhangXZZC #estimation #object-oriented: Frequency Estimation of Virtual Call Targets for Object-Oriented Programs (CZ, HX, SZ, JZ, YC), pp. 510–532.
OOPSLA-2011-JeonGLT #named #parallel: Kismet: parallel speedup estimates for serial programs (DJ, SG, CML, MBT), pp. 519–536.
TOOLS-EUROPE-2011-TrudelOFN #automation #eiffel #java: Automated Translation of Java Source Code to Eiffel (MT, MO, CAF, MN), pp. 20–35.
PEPM-J-2007-CunhaV11 #query #xpath: Transformation of structure-shy programs with application to XPath queries and strategic functions (AC, JV), pp. 516–539.
AdaEurope-2011-CoqR #ada #analysis #modelling #quality: The SQALE Quality and Analysis Models for Assessing the Quality of Ada Source Code (TC, JPR), pp. 61–74.
AdaEurope-2011-RazaFP #detection #fault #parallel: Detecting High-Level Synchronization Errors in Parallel Programs (SAR, SF, EP), pp. 17–30.
LOPSTR-2011-DandoisV #detection #how #logic programming: Clones in Logic Programs and How to Detect Them (CD, WV), pp. 90–105.
LOPSTR-2011-Gallagher #analysis #logic programming #using: Analysis of Logic Programs Using Regular Tree Languages — (JPG), pp. 1–3.
LOPSTR-2011-Seki #logic programming #proving: Proving Properties of Co-Logic Programs by Unfold/Fold Transformations (HS), pp. 205–220.
LOPSTR-2011-SneyersS #probability #termination: Probabilistic Termination of CHRiSM Programs (JS, DDS), pp. 221–236.
PADL-2011-MeraTLH #debugging #logic programming #performance #profiling #runtime: Profiling for Run-Time Checking of Computational Properties and Performance Debugging in Logic Programs (EM, TT, PLG, MVH), pp. 38–53.
PEPM-2011-Caballero #functional #logic programming #program transformation: A program transformation for returning states in functional-logic programs (RC), pp. 111–120.
PEPM-2011-FernandesSSV #strict: Strictification of circular programs (JPF, JS, DS, JV), pp. 131–140.
PEPM-2011-Rinard #bound #probability #program analysis #program transformation: Probabilistic accuracy bounds for perforated programs: a new foundation for program analysis and transformation (MCR), pp. 79–80.
PLDI-2011-BouajjaniDES #analysis #interprocedural #on the: On inter-procedural analysis of programs with lists and data (AB, CD, CE, MS), pp. 578–589.
PLDI-2011-Chlipala #logic #low level #verification: Mostly-automated verification of low-level programs in computational separation logic (AC), pp. 234–245.
PLDI-2011-DilligDAS #composition #precise #summary: Precise and compact modular procedure summaries for heap manipulating programs (ID, TD, AA, MS), pp. 567–577.
PLDI-2011-GulwaniJTV #synthesis: Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
PLDI-2011-PrasadAG #automation #compilation #execution #matlab: Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors (AP, JA, RG), pp. 152–163.
PLDI-2011-Sevcik #concurrent #optimisation: Safe optimisations for shared-memory concurrent programs (JS), pp. 306–316.
POPL-2011-AlurC #algorithm #streaming #transducer #verification: Streaming transducers for algorithmic verification of single-pass list-processing programs (RA, PC), pp. 599–610.
POPL-2011-ChoiAYT #multi #static analysis: Static analysis of multi-staged programs via unstaging translation (WC, BA, KY, MT), pp. 81–92.
POPL-2011-DilligDA #precise #reasoning #using: Precise reasoning for programs using containers (ID, TD, AA), pp. 187–200.
POPL-2011-EsparzaG #complexity #parallel #thread #verification: Complexity of pattern-based verification for multithreaded programs (JE, PG), pp. 499–510.
POPL-2011-GuptaPR #abstraction #concurrent #multi #refinement #thread #verification: Predicate abstraction and refinement for verifying multi-threaded programs (AG, CP, AR), pp. 331–344.
POPL-2011-OngR #algebra #data type #functional #higher-order #pattern matching #verification: Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.
POPL-2011-PrountzosMPM #analysis #graph #optimisation #parallel: A shape analysis for optimizing parallel graph programs (DP, RM, KP, KSM), pp. 159–172.
POPL-2011-SchwarzSVLM #protocol #static analysis: Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol (MDS, HS, VV, PL, MMO), pp. 93–104.
PPDP-2011-NigamJLS #distributed #incremental #logic programming #maintenance: Maintaining distributed logic programs incrementally (VN, LJ, BTL, AS), pp. 125–136.
SAS-2011-BouajjaniEP #concurrent #on the: On Sequentializing Concurrent Programs (AB, ME, GP), pp. 129–145.
SAS-2011-HuangZ #concurrent #debugging #performance: An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs (JH, CZ), pp. 163–179.
SAS-2011-MightH #abstract interpretation #concurrent #higher-order #product line #static analysis: A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.
SAS-2011-SchrammelJ #data flow #verification: Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs (PS, BJ), pp. 233–248.
SAS-2011-SuterKK #recursion #satisfiability: Satisfiability Modulo Recursive Programs (PS, ASK, VK), pp. 298–315.
SAS-2011-ZulegerGSV #abstraction #analysis #bound #imperative: Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.
ASE-2011-AnandH #execution #java #symbolic computation: Heap cloning: Enabling dynamic symbolic execution of java programs (SA, MJH), pp. 33–42.
ASE-2011-GethersKDP #adaptation #approach #impact analysis: An adaptive approach to impact analysis from change requests to source code (MG, HHK, BD, DP), pp. 540–543.
ASE-2011-HillPV #code search #natural language: Improving source code search with natural language phrasal representations of method signatures (EH, LLP, KVS), pp. 524–527.
ASE-2011-KhalekYZMK #alloy #java #named #specification #testing #using: TestEra: A tool for testing Java programs using alloy specifications (SAK, GY, LZ, DM, SK), pp. 608–611.
ASE-2011-KimmigMM #natural language #query: Querying source code with natural language (MK, MM, MM), pp. 376–379.
ASE-2011-LozanoKM #named #recommendation #search-based: Mendel: Source code recommendation based on a genetic metaphor (AL, AK, KM), pp. 384–387.
ASE-2011-MacleanIG #animation #correctness #functional #pointer: The CORE system: Animation and functional correctness of pointer programs (EM, AI, GG), pp. 588–591.
ASE-2011-MaderE #empirical #navigation #traceability: Do software engineers benefit from source code navigation with traceability? — An experiment in software change management (PM, AE), pp. 444–447.
ASE-2011-RobinsonEPAL #automation #generative #scalability #testing: Scaling up automated test generation: Automatically generating maintainable regression unit tests for programs (BR, MDE, JHP, VA, NL), pp. 23–32.
ASE-2011-WesongaMR #concurrent #fault #visualisation: Guided test visualization: Making sense of errors in concurrent programs (SW, EGM, NR), pp. 624–627.
ASE-2011-YuTN #detection #specification: Specifying and detecting meaningful changes in programs (YY, TTT, BN), pp. 273–282.
ESEC-FSE-2011-ChaudhuriGLN #proving #robust: Proving programs robust (SC, SG, RL, SN), pp. 102–112.
ESEC-FSE-2011-CsallnerFL #testing: New ideas track: testing mapreduce-style programs (CC, LF, CL), pp. 504–507.
ESEC-FSE-2011-InostrozaTB #aspect-oriented #composition #interface #reasoning: Join point interfaces for modular reasoning in aspect-oriented programs (MI, ÉT, EB), pp. 508–511.
ESEC-FSE-2011-NaudziunieneBDDGP #automation #ide #java #named #verification: jStar-eclipse: an IDE for automated verification of Java programs (DN, MB, DD, MD, RG, MJP), pp. 428–431.
ESEC-FSE-2011-SahaNDNSC #fault #locality: Fault localization for data-centric programs (DS, MGN, PD, VKN, VS, SC), pp. 157–167.
ICSE-2011-Lee #case study #haskell #refactoring: A case study on refactoring in Haskell programs (DYL), pp. 1164–1166.
ICSE-2011-McMillan: Searching, selecting, and synthesizing source code (CM), pp. 1124–1125.
ICSE-2011-SchaferSDT #flexibility #java #refactoring: Refactoring Java programs for flexible locking (MS, MS, JD, FT), pp. 71–80.
ICSE-2011-StaatsWH #revisited #testing: Programs, tests, and oracles: the foundations of testing revisited (MS, MWW, MPEH), pp. 391–400.
SAC-2011-BackP #invariant #proving #semantics: Semantics and proof rules of invariant based programs (RJB, VP), pp. 1658–1665.
SAC-2011-LiuCJ #aspect-oriented #impact analysis #object-oriented: Change impact analysis for object-oriented programs evolved to aspect-oriented programs (CHL, SLC, WLJ), pp. 59–65.
SAC-2011-RangasamyS #effectiveness #modelling #parallel #performance #petri net #thread: Petri net based performance modeling for effective DVFS for multithreaded programs (AR, YNS), pp. 647–648.
SAC-2011-SunLZTCW #dependence #impact analysis #object-oriented #using: Using lattice of class and method dependence for change impact analysis of object oriented programs (XS, BL, SZ, CT, XC, WW), pp. 1439–1444.
GPCE-2011-LiNN #diagrams #generative #geometry: Generation of geometric programs specified by diagrams (YL, GSNJ), pp. 63–72.
ASPLOS-2011-BurnimNS #parallel #semantics #specification #thread: Specifying and checking semantic atomicity for multithreaded programs (JB, GCN, KS), pp. 79–90.
ASPLOS-2011-FarhadKBS #approximate #architecture #distributed #manycore: Orchestration by approximation: mapping stream programs onto multicore architectures (SMF, YK, BB, BS), pp. 357–368.
CC-2011-RimsadP #analysis: Tainted Flow Analysis on e-SSA-Form Programs (AR, Md, FMQP), pp. 124–143.
DAC-2011-CheC #compilation #embedded #manycore #memory management: Compilation of stream programs onto scratchpad memory based embedded multicore processors through retiming (WC, KSC), pp. 122–127.
DAC-2011-KuoSR #analysis #performance #reachability #using: Efficient WCRT analysis of synchronous programs using reachability (MMYK, RS, PSR), pp. 480–485.
DATE-2011-AndalamRG #analysis: Pruning infeasible paths for tight WCRT analysis of synchronous programs (SA, PSR, AG), pp. 204–209.
DATE-2011-GeunsBBC #parallel: Parallelization of while loops in nested loop programs for shared-memory multiprocessor systems (SJG, MJGB, TB, HC), pp. 697–702.
DATE-2011-LiuV #analysis #generative #performance #validation: Efficient validation input generation in RTL by hybridized source code analysis (LL, SV), pp. 1596–1601.
HPDC-2011-ZhouKB #debugging #detection #locality #named #parallel #scalability #using: Vrisha: using scaling properties of parallel programs for bug detection and localization (BZ, MK, SB), pp. 85–96.
LCTES-2011-GamatieG #design #embedded #multi #performance #static analysis: Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems (AG, LG), pp. 71–80.
PDP-2011-AchourAKN #automation #clustering #named #performance #predict #towards: MPI-PERF-SIM: Towards an Automatic Performance Prediction Tool of MPI Programs on Hierarchical Clusters (SA, MA, BK, WN), pp. 207–211.
PPoPP-2011-SiegelZ #automation #parallel #verification: Automatic formal verification of MPI-based parallel programs (SFS, TKZ), pp. 309–310.
PPoPP-2011-WuM #communication #named: ScalaExtrap: trace-based communication extrapolation for spmd programs (XW, FM), pp. 113–122.
PPoPP-2011-ZhengRQA #detection #gpu #named: GRace: a low-overhead mechanism for detecting data races in GPU programs (MZ, VTR, FQ, GA), pp. 135–146.
ESOP-2011-DeDN #analysis #data flow: Dataflow Analysis for Datarace-Free Programs (AD, DD, RN), pp. 196–215.
ESOP-2011-Mine #c #embedded #fault #parallel #runtime #static analysis: Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (AM), pp. 398–418.
FASE-2011-LiT #clone detection #detection #erlang #incremental: Incremental Clone Detection and Elimination for Erlang Programs (HL, SJT), pp. 356–370.
FoSSaCS-2011-AxelsenG #question #what: What Do Reversible Programs Compute? (HBA, RG), pp. 42–56.
STOC-2011-DinitzK #linear: Directed spanners via flow-based linear programs (MD, RK), pp. 323–332.
TACAS-2011-KieferW #on the #parallel #probability #process: On Probabilistic Parallel Programs with Process Creation and Synchronisation (SK, DW), pp. 296–310.
CADE-2011-PayetS #android #static analysis: Static Analysis of Android Programs (ÉP, FS), pp. 439–445.
CADE-2011-Platzer #difference #hybrid #logic #probability: Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs (AP), pp. 446–460.
CAV-2011-BrazdilKK #analysis #bound #performance #probability: Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.
CAV-2011-CernyCHRS #concurrent #synthesis: Quantitative Synthesis for Concurrent Programs (PC, KC, TAH, AR, RS), pp. 243–259.
CAV-2011-DonaldsonKKW #abstraction #concurrent #symmetry: Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs (AFD, AK, DK, TW), pp. 356–371.
CAV-2011-GuptaPR #concurrent #constraints #multi #named #thread #verification: Threader: A Constraint-Based Verifier for Multi-threaded Programs (AG, CP, AR), pp. 412–417.
CAV-2011-HagueL #data type #model checking #recursion: Model Checking Recursive Programs with Numeric Data Types (MH, AWL), pp. 743–759.
CAV-2011-JhalaMR #functional #named #using #verification: HMC: Verifying Functional Programs Using Abstract Interpreters (RJ, RM, AR), pp. 470–485.
CAV-2011-JoseM #fault #locality #named: Bug-Assist: Assisting Fault Localization in ANSI-C Programs (MJ, RM), pp. 504–509.
CAV-2011-LiGR #automation #c++ #execution #generative #named #symbolic computation #testing: KLOVER: A Symbolic Execution and Automatic Test Generation Tool for C++ Programs (GL, IG, SPR), pp. 609–615.
CSL-2011-Madhusudan: Synthesizing Reactive Programs (PM), pp. 428–442.
CSL-2011-ReusS #functional #logic: Relative Completeness for Logics of Functional Programs (BR, TS), pp. 470–480.
ICLP-2011-Herranz-NievaM #logic programming #object-oriented #specification #synthesis: Synthesis of Logic Programs from Object-Oriented Formal Specifications (ÁHN, JM), pp. 95–105.
ICLP-2011-Krennwallner #composition #logic programming: Promoting Modular Nonmonotonic Logic Programs (TK), pp. 274–279.
ICLP-2011-Kriener #logic programming #reasoning: Correct Reasoning about Logic Programs (JK), pp. 280–283.
ICLP-J-2011-AreiasR #evaluation #logic programming #on the: On combining linear-based strategies for tabled evaluation of logic programs (MA, RR), pp. 681–696.
ICLP-J-2011-CominiTV #concurrent #constraints: Abstract diagnosis for timed concurrent constraint programs (MC, LT, AV), pp. 487–502.
ICLP-J-2011-CruzR #evaluation #logic programming #performance #retrieval: Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs (FC, RR), pp. 697–712.
ICLP-J-2011-VoetsS #analysis #integer #logic programming: Non-termination analysis of logic programs with integer arithmetics (DV, DDS), pp. 521–536.
ICST-2011-LazaarGL #automation #constraints #framework: A Framework for the Automatic Correction of Constraint Programs (NL, AG, YL), pp. 319–326.
ICTSS-2011-MammarCJMO #c #detection #testing #using: Using Testing Techniques for Vulnerability Detection in C Programs (AM, ARC, WJ, WM, EMdO), pp. 80–96.
ISSTA-2011-AllwoodCE #haskell #testing: High coverage testing of Haskell programs (TORA, CC, SE), pp. 375–385.
ISSTA-2011-BurnimSS #concurrent #memory management #modelling #testing: Testing concurrent programs on relaxed memory models (JB, KS, CS), pp. 122–132.
LICS-2011-ChurchillLM #game studies #imperative #proving #semantics: Imperative Programs as Proofs via Game Semantics (MC, JL, GM), pp. 65–74.
LICS-2011-KrishnaswamiB #semantics: Ultrametric Semantics of Reactive Programs (NRK, NB), pp. 257–266.
TAP-2011-Gaudel #modelling #proving #testing: Checking Models, Proving Programs, and Testing Systems (MCG), pp. 1–13.
VMCAI-2011-BardinHV #context-free grammar #re-engineering: Refinement-Based CFG Reconstruction from Unstructured Programs (SB, PH, FV), pp. 54–69.
VMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #reachability: Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.
ECSA-2010-ChardignyS #architecture #documentation #object-oriented #process: Software Architecture Recovery Process Based on Object-Oriented Source Code and Documentation (SC, AS), pp. 409–416.
QoSA-2010-DietrichMTS #composition #empirical #java: Barriers to Modularity — An Empirical Study to Assess the Potential for Modularisation of Java Programs (JD, CM, EDT, SMAS), pp. 135–150.
CSMR-2010-FokinTC #c++ #decompiler #re-engineering: Reconstruction of Class Hierarchies for Decompilation of C++ Programs (AF, KT, AC), pp. 240–243.
CSMR-2010-KellensNSRD #co-evolution: Co-evolving Annotations and Source Code through Smart Annotations (AK, CN, KDS, CDR, TD), pp. 117–126.
CSMR-2010-MadaniGPGA #identifier #recognition #speech #using #word: Recognizing Words from Source Code Identifiers Using Speech Recognition Techniques (NM, LG, MDP, YGG, GA), pp. 68–77.
ICPC-2010-BacchelliDL: Extracting Source Code from E-Mails (AB, MD, ML), pp. 24–33.
ICSM-2010-KeivanlooRSR #code search #framework #named #scalability #semantics: SE-CodeSearch: A scalable Semantic Web-based source code search infrastructure (IK, LR, PS, JR), pp. 1–5.
ICSM-2010-RountevVYS #comprehension #dependence #java: Understanding parallelism-inhibiting dependences in sequential Java programs (AR, KVV, DY, PS), pp. 1–9.
ICSM-2010-SavageDGP #named #topic #using: TopicXP: Exploring topics in source code using Latent Dirichlet Allocation (TS, BD, MG, DP), pp. 1–6.
PASTE-2010-FlanaganF #concurrent #dynamic analysis #framework: The RoadRunner dynamic analysis framework for concurrent programs (CF, SNF), pp. 1–8.
SCAM-2010-GrantC #analysis #concept: Estimating the Optimal Number of Latent Concepts in Source Code Analysis (SG, JRC), pp. 65–74.
SCAM-2010-Harman #analysis #why: Why Source Code Analysis and Manipulation Will Always be Important (MH), pp. 7–19.
SCAM-2010-KetterlinC #behaviour #execution #memory management: Recovering the Memory Behavior of Executable Programs (AK, PC), pp. 189–198.
WCRE-2010-Arnaoudova #quality: Improving Source Code Quality through the Definition of Linguistic Antipatterns (VA), pp. 285–288.
WCRE-2010-DavisG #assembly #detection: From Whence It Came: Detecting Source Code Clones by Analyzing Assembler (IJD, MWG), pp. 242–246.
WCRE-2010-Eshkevari #identifier #refactoring: Linguistic Driven Refactoring of Source Code Identifiers (LME), pp. 297–300.
WCRE-2010-GomezDD #integration #visual notation: Visually Supporting Source Code Changes Integration: The Torch Dashboard (VUG, SD, TD), pp. 55–64.
WCRE-2010-Guerrouj #analysis #automation #concept #identifier: Automatic Derivation of Concepts Based on the Analysis of Source Code Identifiers (LG), pp. 301–304.
WCRE-2010-HaiducAMM #automation #on the #summary #using: On the Use of Automated Text Summarization Techniques for Summarizing Source Code (SH, JA, LM, AM), pp. 35–44.
WCRE-2010-KagdiGPC #concept #impact analysis: Blending Conceptual and Evolutionary Couplings to Support Change Impact Analysis in Source Code (HHK, MG, DP, MLC), pp. 119–128.
WCRE-2010-LawrieBM #normalisation: Normalizing Source Code Vocabulary (DJL, DB, CM), pp. 3–12.
WCRE-2010-LozanoKMA #mining: Mining Source Code for Structural Regularities (AL, AK, KM, GA), pp. 22–31.
WCRE-2010-MilanovaL #comprehension #concurrent #java #static analysis: Static Analysis for Understanding Shared Objects in Open Concurrent Java Programs (AM, YL), pp. 45–54.
IFM-2010-AutexierL #c #impact analysis #verification: Adding Change Impact Analysis to the Formal Verification of C Programs (SA, CL), pp. 59–73.
IFM-2010-Bostrom #modelling: Creating Sequential Programs from Event-B Models (PB), pp. 74–88.
IFM-2010-Dimovski #composition #equivalence #nondeterminism #termination: A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs (AD), pp. 121–135.
FLOPS-2010-Sagonas #concurrent #detection #erlang #fault #static analysis #using: Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs (KFS), pp. 13–18.
CIG-2010-Greenwood #evolution #social: Evolving N-person social dilemma strategies to resolve questions on participation in climate change programs (GWG), pp. 227–234.
ICGT-2010-PoskittP #calculus #graph #hoare: A Hoare Calculus for Graph Programs (CMP, DP), pp. 139–154.
ICGT-2010-Radke #correctness #graph: Correctness of Graph Programs Relative to HR⁺ Conditions (HR), pp. 410–412.
ICGT-2010-Ujhelyi #model transformation #static typing #type checking: Static Type Checking of Model Transformation Programs (ZU), pp. 413–415.
SOFTVIS-2010-HumphreyDGT #named #visual notation: GEM: graphical explorer of MPI programs (AH, CD, GG, BRT), pp. 217–218.
SOFTVIS-2010-JohnsonM #concurrent #execution #named #visualisation: Beat: a tool for visualizing the execution of object orientated concurrent programs (PJ, SM), pp. 225–226.
ICML-2010-LiangJK #approach #learning: Learning Programs: A Hierarchical Bayesian Approach (PL, MIJ, DK), pp. 639–646.
ICML-2010-PetrikTPZ #approximate #feature model #linear #markov #process #using: Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes (MP, GT, RP, SZ), pp. 871–878.
KR-2010-GiacomoLP #calculus #game studies #reasoning #representation: Situation Calculus Based Programs for Representing and Reasoning about Game Structures (GDG, YL, ARP).
KR-2010-ZhangZ #bound #on the #semantics #set: On the Progression Semantics and Boundedness of Answer Set Programs (YZ, YZ).
ECOOP-2010-GilL #java #using: The Use of Overloading in Java Programs (JYG, KL), pp. 529–551.
OOPSLA-2010-AltmanAFM #analysis #performance: Performance analysis of idle programs (ERA, MA, SF, NM), pp. 739–753.
OOPSLA-2010-GabelYYGS #consistency #detection #nondeterminism #scalability: Scalable and systematic detection of buggy inconsistencies in source code (MG, JY, YY, MG, ZS), pp. 175–190.
OOPSLA-2010-KleinFF #higher-order #random testing #testing: Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.
OOPSLA-2010-UpadhyayaMP #automation #identification #memory management: Automatic atomic region identification in shared memory SPMD programs (GU, SPM, VSP), pp. 652–670.
LOPSTR-2010-BacciC #first-order #functional #logic programming: Abstract Diagnosis of First Order Functional Logic Programs (GB, MC), pp. 215–233.
LOPSTR-2010-StroderSG #analysis #dependence #logic programming #termination: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (TS, PSK, JG), pp. 184–199.
LOPSTR-2010-Vidal #approach #hybrid #logic programming #partial evaluation: A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (GV), pp. 200–214.
LOPSTR-2010-VoetsS #analysis #logic programming #using: Non-termination Analysis of Logic Programs Using Types (DV, DDS), pp. 133–148.
PADL-2010-LiT #detection #erlang: Similar Code Detection and Elimination for Erlang Programs (HL, SJT), pp. 104–118.
PEPM-2010-BoustaniH #java: Corrective hints for type incorrect generic Java programs (NEB, JH), pp. 5–14.
PLDI-2010-RichardsLBV #analysis #behaviour #javascript: An analysis of the dynamic behavior of JavaScript programs (GR, SL, BB, JV), pp. 1–12.
POPL-2010-ChaudhuriGL #analysis: Continuity analysis of programs (SC, SG, RL), pp. 57–70.
POPL-2010-HarrisSIG #program analysis #satisfiability: Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.
POPL-2010-JostHLH #higher-order #resource management: Static determination of quantitative resource usage for higher-order programs (SJ, KH, HWL, MH), pp. 223–236.
POPL-2010-MagillTLT #abstraction #automation: Automatic numeric abstractions for heap-manipulating programs (SM, MHT, PL, YKT), pp. 211–222.
POPL-2010-MartinHCAC #c #c++ #concurrent #policy: Dynamically checking ownership policies in concurrent c/c++ programs (JPM, MH, MC, PA, MC), pp. 457–470.
POPL-2010-NanevskiVB #verification: Structuring the verification of heap-manipulating programs (AN, VV, JB), pp. 261–274.
QAPL-2010-NdukwuMc #abstraction #approach #independence #probability: An expectation transformer approach to predicate abstraction and data independence for probabilistic programs (UN, AM), pp. 129–143.
SAS-2010-AliasDFG #bound #complexity #multi #ranking #termination: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (CA, AD, PF, LG), pp. 117–133.
SAS-2010-DilligDA #constraints #online #scalability #static analysis: Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis (ID, TD, AA), pp. 236–252.
SAS-2010-FarzanK #analysis #composition #concurrent: Compositional Bitvector Analysis for Concurrent Programs with Nested Locks (AF, ZK), pp. 253–270.
SAS-2010-KatoenMMM #automation #generative #invariant #probability: Linear-Invariant Generation for Probabilistic Programs: — Automated Support for Proof-Based Methods (JPK, AM, LM, CCM), pp. 390–406.
SAS-2010-VechevYRS #automation #parallel #verification: Automatic Verification of Determinism for Structured Parallel Programs (MTV, EY, RR, VS), pp. 455–471.
ASE-2010-Chen #documentation #traceability #visualisation: Extraction and visualization of traceability relationships between documents and source code (XC), pp. 505–510.
ASE-2010-GermanMI #automation #identification: A sentence-matching method for automatic license identification of source code files (DMG, YM, KI), pp. 437–446.
ASE-2010-QiRL #evolution #generative #testing: Test generation to expose changes in evolving programs (DQ, AR, ZL), pp. 397–406.
FSE-2010-GabelS #case study: A study of the uniqueness of source code (MG, ZS), pp. 147–156.
FSE-2010-HuangLZ #concurrent #java #lightweight #multi #named: LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 207–216.
FSE-2010-HuangLZ10a #concurrent #java #lightweight #multi #named: LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 385–386.
FSE-2010-JalbertS #concurrent #debugging #effectiveness: A trace simplification technique for effective debugging of concurrent programs (NJ, KS), pp. 57–66.
FSE-2010-LauterburgKMA #named #testing: Basset: a tool for systematic testing of actor programs (SL, RKK, DM, GA), pp. 363–364.
ICSE-2010-BacchelliLR: Linking e-mails and source code artifacts (AB, ML, RR), pp. 375–384.
ICSE-2010-BurnimS #named #parallel #specification #thread: DETERMIN: inferring likely deterministic specifications of multithreaded programs (JB, KS), pp. 415–424.
ICSE-2010-FerrariBLGFCLTSSRMBM #aspect-oriented #case study #evolution: An exploratory study of fault-proneness in evolving aspect-oriented programs (FCF, RB, OALL, AG, EF, NC, FL, NT, LS, SS, AR, PCM, TVB, JCM), pp. 65–74.
ICSE-2010-FritzOMM: A degree-of-knowledge model to capture source code familiarity (TF, JO, GCM, ERMH), pp. 385–394.
ICSE-2010-GenevesL #xquery: Eliminating dead-code from XQuery programs (PG, NL), pp. 305–306.
ICSE-2010-HaiducAM #comprehension #summary: Supporting program comprehension with source code summarization (SH, JA, AM), pp. 223–226.
ICSE-2010-LaiCC #detection #parallel #random #testing #thread: Detecting atomic-set serializability violations in multithreaded programs through active randomized testing (ZL, SCC, WKC), pp. 235–244.
ICSE-2010-NguyenNPAN #debugging #object-oriented: Recurring bug fixes in object-oriented programs (TTN, HAN, NHP, JMAK, TNN), pp. 315–324.
ICSE-2010-NitaN #adaptation #api #using: Using twinning to adapt programs to alternative APIs (MN, DN), pp. 205–214.
ICSE-2010-ParkVH #concurrent #fault #locality #named: Falcon: fault localization in concurrent programs (SP, RWV, MJH), pp. 245–254.
ICSE-2010-Rakamaric #concurrent #named: STORM: static unit checking of concurrent programs (ZR), pp. 519–520.
ICSE-2010-RungtaM #concurrent #debugging #slicing: Slicing and dicing bugs in concurrent programs (NR, EM), pp. 195–198.
SAC-2010-BallanceC #monitoring #performance: Monitoring MPI programs for performance characterization and management control (RAB, JC), pp. 2305–2310.
SAC-2010-GravinoTS #analysis #comprehension #empirical #modelling: An empirical investigation on the relation between analysis models and source code comprehension (CG, GT, GS), pp. 2365–2366.
SAC-2010-LesnerBBB #detection #exclamation #framework #novel #student: A novel framework to detect source code plagiarism: now, students have to work for real! (BL, RB, CB, GB), pp. 57–58.
SAC-2010-ZhouCS #consistency #linear: Reparameterization based consistent graph-structured linear programs (HZ, QC, ZS), pp. 974–978.
LDTA-2010-GiorgettiMTK #case study #java #specification: Specifying generic Java programs: two case studies (AG, CM, ET, OK), p. 8.
SLE-2010-KatsKV #ambiguity #interactive #metaprogramming #syntax: Interactive Disambiguation of Meta Programs with Concrete Object Syntax (LCLK, KTK, EV), pp. 327–336.
CC-2010-BaskaranRS #automation #code generation: Automatic C-to-CUDA Code Generation for Affine Programs (MMB, JR, PS), pp. 244–263.
CC-2010-CraikK #object-oriented #parallel #using: Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs (AC, WK), pp. 145–164.
CGO-2010-PatilPSLC #analysis #framework #named #parallel: PinPlay: a framework for deterministic replay and reproducible analysis of parallel programs (HP, CP, MS, GL, JC), pp. 2–11.
CGO-2010-StrattonGMAMHH #compilation #fine-grained #manycore #performance #thread: Efficient compilation of fine-grained SPMD-threaded programs for multicore CPUs (JAS, VG, JM, BA, MM, ZH, WmWH), pp. 111–119.
CGO-2010-WeiYYG #communication #pipes and filters: Minimizing communication in rate-optimal software pipelining for stream programs (HW, JY, HY, GRG), pp. 210–217.
DAC-2010-JuHRC #analysis #multi: Timing analysis of esterel programs on general-purpose multiprocessors (LJ, BKH, AR, SC), pp. 48–51.
DATE-2010-BaudischBS #independence #parallel #thread: Multithreaded code from synchronous programs: Extracting independent threads for OpenMP (DB, JB, KS), pp. 949–952.
DATE-2010-ChePC #compilation #manycore: Compilation of stream programs for multicore processors that incorporate scratchpad memories (WC, AP, KSC), pp. 1118–1123.
DATE-2010-WenCCL #debugging #named #parallel #runtime: RunAssert: A non-intrusive run-time assertion for parallel programs debugging (CNW, SHC, TFC, TJL), pp. 287–290.
OSDI-2010-PowerL #distributed #named #performance: Piccolo: Building Fast, Distributed Programs with Partitioned Tables (RP, JL), pp. 293–306.
PDP-2010-WangBBW #approach #modelling #parallel #search-based: Model Driven Iterative Multi-dimensional Parallelization of Multi-task Programs for the Cell BE: A Genetic Algorithm-Based Approach (MW, NB, FB, ZW), pp. 218–222.
PPoPP-2010-Chakrabarti #abstraction #analysis #effectiveness #performance: New abstractions for effective performance analysis of STM programs (DRC), pp. 333–334.
PPoPP-2010-LiGKQ #verification: A symbolic verifier for CUDA programs (GL, GG, RMK, DQ), pp. 357–358.
PPoPP-2010-Mendez-LojoNPSHKBP #optimisation: Structure-driven optimizations for amorphous data-parallel programs (MML, DN, DP, XS, MAH, MK, MB, KP), pp. 3–14.
PPoPP-2010-YangXKZ #compilation #optimisation: An optimizing compiler for GPGPU programs with input-data sharing (YY, PX, JK, HZ), pp. 343–344.
PPoPP-2010-ZhangJS #matter #parallel #performance #question #thread: Does cache sharing on modern CMP matter to the performance of contemporary multithreaded programs? (EZZ, YJ, XS), pp. 203–212.
PPoPP-2010-ZyulkyarovHUCV #debugging #memory management #transaction: Debugging programs that use atomic blocks and transactional memory (FZ, TH, OSÜ, AC, MV), pp. 57–66.
ESOP-2010-AmtoftHR #array #automation #certification #contract #data flow #precise #reasoning #verification: Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays (TA, JH, ER), pp. 43–63.
ESOP-2010-MatsudaMHT #approach #grammarware: A Grammar-Based Approach to Invertible Programs (KM, SCM, ZH, MT), pp. 448–467.
ESOP-2010-MeolaW #fault tolerance #logic #reasoning: Faulty Logic: Reasoning about Fault Tolerant Programs (MLM, DW), pp. 468–487.
FASE-2010-ChatterjeeARS #concurrent #multi #thread: Analyzing the Impact of Change in Multi-threaded Programs (KC, LdA, VR, CS), pp. 293–307.
TACAS-2010-Aderhold #analysis #automation #higher-order #recursion #termination: Automated Termination Analysis for Programs with Second-Order Recursion (MA), pp. 221–235.
CAV-2010-BouajjaniDERS #bound #invariant #synthesis: Invariant Synthesis for Programs Manipulating Lists with Unbounded Data (AB, CD, CE, AR, MS), pp. 72–88.
CAV-2010-CohenMST #concurrent #invariant #verification: Local Verification of Global Invariants in Concurrent Programs (EC, MM, WS, ST), pp. 480–494.
CAV-2010-KahlonW #concurrent #debugging #detection #graph #precise: Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs (VK, CW), pp. 434–449.
CAV-2010-KaiserKW #concurrent #detection: Dynamic Cutoff Detection in Parameterized Concurrent Programs (AK, DK, TW), pp. 645–659.
CAV-2010-TorreMP #concurrent #interface #linear #model checking #using: Model-Checking Parameterized Concurrent Programs Using Linear Interfaces (SLT, PM, GP), pp. 629–644.
ICLP-2010-Alviano10 #datalog #set: Dynamic Magic Sets for Disjunctive Datalog Programs (MA), pp. 226–235.
ICLP-2010-BasolEFI10: HEX Programs with Action Atoms (SB, OE, MF, GI), pp. 24–33.
ICLP-2010-BautersJSVC10 #communication #set: Communicating Answer Set Programs (KB, JJ, SS, DV, MDC), pp. 34–43.
ICLP-2010-Dandois10 #logic programming #program analysis: Program analysis for code duplication in logic programs (CD), pp. 241–247.
ICLP-2010-FayruzovJVCC10 #performance #set: Efficient Solving of Time-dependent Answer Set Programs (TF, JJ, DV, CC, MDC), pp. 64–73.
ICLP-2010-Janhunen10 #constraints #revisited #semantics: Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited (TJ), pp. 94–103.
ICLP-2010-Near10 #logic programming #relational #specification: From Relational Specifications to Logic Programs (JPN), pp. 144–153.
ICLP-2010-OetschPT10: Methods and Methodologies for Developing Answer-Set Programs — Project Description (JO, JP, HT), pp. 154–161.
ICLP-2010-PereiraP10 #logic programming #semantics: Tight Semantics for Logic Programs (LMP, AMP), pp. 134–143.
ICLP-2010-RiguzziS10 #logic programming #reasoning: Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions (FR, TS), pp. 162–171.
ICLP-2010-ShakarianSS10 #network #optimisation #problem #social #using: Using Generalized Annotated Programs to Solve Social Network Optimization Problems (PS, VSS, MLS), pp. 182–191.
ICLP-2010-SimariS10 #abduction #logic programming #probability: Abductive Inference in Probabilistic Logic Programs (GIS, VSS), pp. 192–201.
ICLP-J-2010-BaseliceB #decidability #subclass: A decidable subclass of finitary programs (SB, PAB), pp. 481–496.
ICLP-J-2010-Delgrande #approach #logic programming #semantics #set: A program-level approach to revising logic programs under the answer set semantics (JPD), pp. 565–580.
ICLP-J-2010-OetschPST #detection: The system Kato: Detecting cases of plagiarism for answer-set programs (JO, JP, MS, HT), pp. 759–775.
ICLP-J-2010-OetschPT #debugging: Catching the Ouroboros: On debugging non-ground answer-set programs (JO, JP, HT), pp. 513–529.
ICLP-J-2010-PettorossiSP #infinity #logic programming: Transformations of logic programs on infinite lists (AP, VS, MP), pp. 383–399.
ICLP-J-2010-Schneider-KampGSST #analysis #automation #logic programming #termination: Automated termination analysis for logic programs with cut (PSK, JG, TS, AS, RT), pp. 365–381.
ICLP-J-2010-WangYYS #logic programming: Loop formulas for description logic programs (YW, JHY, LYY, YDS), pp. 531–545.
ICST-2010-DebroyW #automation #using: Using Mutation to Automatically Suggest Fixes for Faulty Programs (VD, WEW), pp. 65–74.
ICTSS-2010-Gladisch #first-order #generative #logic #quantifier #specification #testing: Test Data Generation for Programs with Quantified First-Order Logic Specifications (CG), pp. 158–173.
IJCAR-2010-Aderhold #automation #axiom #higher-order #induction #recursion #synthesis: Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.
IJCAR-2010-AyadM #float #multi #verification: Multi-Prover Verification of Floating-Point Programs (AA, CM), pp. 127–141.
ISSTA-2010-WeiPFSBMZ #automation #contract: Automated fixing of programs with contracts (YW, YP, CAF, LSS, SB, BM, AZ), pp. 61–72.
SAT-2010-FuhsS #linear #satisfiability #using: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.
VMCAI-2010-AlurC #reasoning: Temporal Reasoning for Procedural Programs (RA, SC), pp. 45–60.
VMCAI-2010-Leino #concurrent #verification: Verifying Concurrent Programs with Chalice (KRML), p. 2.
ECDL-2009-AlmeidaATC #quality #visualisation: A Visualization Technique for Quality Control of Massive Digitization Programs (RAdA, PA, AT, PC), pp. 150–155.
SIGMOD-2009-ChaiVDN #feedback #information management #integration: Efficiently incorporating user feedback into information extraction and integration programs (XC, BQV, AD, JFN), pp. 87–100.
SIGMOD-2009-ChenGDYR #evolution #optimisation: Optimizing complex extraction programs over evolving text data (FC, BJG, AD, JY, RR), pp. 321–334.
SIGMOD-2009-OlstonCS #data flow #generative: Generating example data for dataflow programs (CO, SC, US), pp. 245–256.
CSEET-2009-TaranRMB #collaboration #design #feedback #implementation #process: A Training Process for Faculty Members in Collaborative Degree Programs: Design, Implementation and Feedback (GT, MZR, PM, PB), pp. 122–129.
ITiCSE-2009-EnglishR #assessment #automation #case study #student #using: Evaluating students’ programs using automated assessment: a case study (JE, TR), p. 371.
ITiCSE-2009-Impagliazzo #metric #performance: Graduate attributes and performance measures: refinements in assessing programs (JI), p. 370.
SIGITE-2009-Hartpence #case study #experience #network #security: Qos content and experiences for IT, networking and security programs (BH), pp. 60–64.
SIGITE-2009-Hislop: Sharing instructional materials for IT degree programs (GWH), p. 207.
SIGITE-2009-HomkesS #evaluation: Meeting the ABET program outcome for issues and responsibilities: an evaluation of CS, IS, and IT programs (RH, RAS), pp. 133–137.
CSMR-2009-AbebeHMTA #evolution: Analyzing the Evolution of the Source Code Vocabulary (SLA, SH, AM, PT, GA), pp. 189–198.
CSMR-2009-Ghazarian #case study #evolution: A Case Study of Source Code Evolution (AG), pp. 159–168.
ICPC-2009-AuprasertL #representation: Representing source code with Granular hierarchical structures (BA, YL), pp. 319–320.
ICPC-2009-CeccatoPNFRTT #assessment #effectiveness #obfuscation: The effectiveness of source code obfuscation: An experimental assessment (MC, MDP, JN, PF, FR, MT, PT), pp. 178–187.
ICPC-2009-ChilowiczDR #detection #similarity #syntax: Syntax tree fingerprinting for source code similarity detection (MC, ÉD, GR), pp. 243–247.
ICPC-2009-HanWYCZL #clustering #comprehension #design pattern #open source: Design pattern directed clustering for understanding open source code (ZH, LW, LY, XC, JZ, XL), pp. 295–296.
ICPC-2009-HuangDS #policy #prototype: Prototyping synchronization policies for existing programs (YH, LKD, REKS), pp. 289–290.
ICPC-2009-NilssonLHN #fact extraction #natural language #parsing: Natural language parsing for fact extraction from source code (JN, WL, JH, JN), pp. 223–227.
ICPC-2009-SchauerK #concept: A case for concept programs (RS, RKK), pp. 258–262.
ICSM-2009-Adams #co-evolution: Co-evolution of source code and the build system (BA), pp. 461–464.
ICSM-2009-HolmesCWD #case study #using: The end-to-end use of source code examples: An exploratory study (RH, RC, RJW, JD), pp. 555–558.
ICSM-2009-Wang #developer #motivation #what: What motivate software engineers to refactor source code? evidences from professional developers (YW), pp. 413–416.
ICSM-2009-YoshikawaHS #natural language #ontology #traceability #using: Recovering traceability links between a simple natural language sentence and source code using domain ontologies (TY, SH, MS), pp. 551–554.
MSR-2009-EnslenHPV #analysis #automation #identifier #mining: Mining source code to automatically split identifiers for software analysis (EE, EH, LLP, KVS), pp. 71–80.
MSR-2009-Kuhn #automation #component #evolution #using #word: Automatic labeling of software components and their evolution using log-likelihood ratio of word frequencies in source code (AK), pp. 175–178.
MSR-2009-Mockus #scalability #towards #version control: Amassing and indexing a large sample of version control systems: Towards the census of public source code history (AM), pp. 11–20.
SCAM-2009-CanetCM #analysis #c: A Value Analysis for C Programs (GC, PC, BM), pp. 123–124.
SCAM-2009-Giffhorn #concurrent: Chopping Concurrent Programs (DG), pp. 13–22.
SCAM-2009-KlintSV #analysis #domain-specific language #named #rascal: RASCAL: A Domain Specific Language for Source Code Analysis and Manipulation (PK, TvdS, JJV), pp. 168–177.
WCRE-1999-AnquetilRAAHPPP99a #architecture #java #named: JavaCompExt: Extracting Architectural Elements from Java Source Code (NA, JCR, PA, GA, PH, TP, DP, VP), pp. 317–318.
WCRE-1999-BacchelliDLR99a #benchmark #lightweight #metric: Benchmarking Lightweight Techniques to Link E-Mails and Source Code (AB, MD, ML, RR), pp. 205–214.
WCRE-1999-PentaG99a #how #question: Who are Source Code Contributors and How do they Change? (MDP, DMG), pp. 11–20.
WCRE-1999-Perez-CastilloGAP99a #legacy #on the #using: On the Use of ADM to Contextualize Data on Legacy Source Code for Software Modernization (RPC, IGRdG, OAG, MP), pp. 128–132.
WCRE-1999-RatiuMJ99a #composition #logic: The Logical Modularity of Programs (DR, RM, JJ), pp. 123–127.
CIAA-2009-AtigT #communication #parallel #verification: Verifying Parallel Programs with Dynamic Communication Structures (MFA, TT), pp. 145–154.
FM-2009-LuthW #c #specification #verification: Certifiable Specification and Verification of C Programs (CL, DW), pp. 419–434.
FM-2009-WangKGG #analysis #concurrent #predict: Symbolic Predictive Analysis for Concurrent Programs (CW, SK, MKG, AG), pp. 256–272.
SEFM-2009-BonfanteMR #self: A Computability Perspective on Self-Modifying Programs (GB, JYM, DRP), pp. 231–239.
SEFM-2009-ColomboPS #java #monitoring #realtime: LARVA --- Safer Monitoring of Real-Time Java Programs (CC, GJP, GS), pp. 33–37.
SEFM-2009-Ferrara #java #named #parallel #thread: Checkmate: A Generic Static Analyzer of Java Multithreaded Programs (PF), pp. 169–178.
SEFM-2009-Jeannet #concurrent #interprocedural #relational #verification: Relational Interprocedural Verification of Concurrent Programs (BJ), pp. 83–92.
CEFP-2009-TothBHLTK #behaviour #dependence #erlang #graph #impact analysis #using: Impact Analysis of Erlang Programs Using Behaviour Dependency Graphs (MT, IB, ZH, LL, MT, TK), pp. 372–390.
ICFP-2009-ChlipalaMMSW #effectiveness #higher-order #imperative #interactive #proving: Effective interactive proofs for higher-order imperative programs (AC, JGM, GM, AS, RW), pp. 79–90.
CHI-2009-JakobsenH #using #visualisation: Fisheyes in the field: using method triangulation to study the adoption and use of a source code visualization (MRJ, KH), pp. 1579–1588.
VISSOFT-2009-CottrellGHWD #visual notation: Compare and contrast: Visual exploration of source code examples (RC, BG, RH, RJW, JD), pp. 29–32.
VISSOFT-2009-OliveiraPHC #behaviour #domain-specific language #visualisation: Visualization of domain-specific programs’ behavior (NO, MJVP, PRH, DCdC), pp. 37–40.
ECIR-2009-Kettunen #metric #question: Choosing the Best MT Programs for CLIR Purposes — Can MT Metrics Be Helpful? (KK), pp. 706–712.
ICML-2009-PetrikZ #approximate #constraints #linear: Constraint relaxation in approximate linear programs (MP, SZ), pp. 809–816.
ECOOP-2009-SteimannT #java #refactoring: From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility (FS, AT), pp. 419–443.
OOPSLA-2009-DincklageD #optimisation #semantics: Optimizing programs with intended semantics (DvD, AD), pp. 409–424.
OOPSLA-2009-TsafrirWBS #dependence #performance: Minimizing dependencies within generic classes for faster and smaller programs (DT, RWW, DFB, BS), pp. 425–444.
LOPSTR-2009-Schneider-KampGN #dependence #framework #logic programming #termination: The Dependency Triple Framework for Termination of Logic Programs (PSK, JG, MTN), pp. 37–51.
LOPSTR-2009-Vidal #declarative #partial evaluation #scalability #towards: Towards Scalable Partial Evaluation of Declarative Programs (GV), pp. 1–4.
PADL-2009-DukeBWR #design #domain-specific language #embedded #multi #visualisation: Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs (DJD, RB, MW, CR), pp. 31–45.
PADL-2009-PereiraP #logic programming #modelling #query #top-down: Layered Models Top-Down Querying of Normal Logic Programs (LMP, AMP), pp. 254–268.
PEPM-2009-PardoFS #higher-order #monad: Shortcut fusion rules for the derivation of circular and higher-order monadic programs (AP, JPF, JS), pp. 81–90.
PEPM-2009-RungtaM #model checking #morphism #polymorphism: Guided model checking for programs with polymorphism (NR, EGM), pp. 21–30.
PLDI-2009-NeamtiuH #concurrent #multi #thread: Safe and timely updates to multi-threaded programs (IN, MWH), pp. 13–24.
PLDI-2009-PetrankMS #bound #parallel: Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.
PLDI-2009-TorreMP #calculus #fixpoint #recursion #using: Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.
PLDI-2009-ZeeKR #imperative #proving: An integrated proof language for imperative programs (KZ, VK, MCR), pp. 338–351.
POPL-2009-GantyMR #liveness #verification: Verifying liveness for asynchronous programs (PG, RM, AR), pp. 102–113.
POPL-2009-Kobayashi #higher-order #recursion #verification: Types and higher-order recursion schemes for verification of higher-order programs (NK), pp. 416–428.
PPDP-2009-FalaschiOP #abstract interpretation #concurrent #constraints #framework: A framework for abstract interpretation of timed concurrent constraint programs (MF, CO, CP), pp. 207–218.
PPDP-2009-PhanJ #analysis: Path-sensitive region analysis for mercury programs (QP, GJ), pp. 161–170.
PPDP-2009-SagonasA #automation #erlang #refactoring: Automatic refactoring of Erlang programs (KFS, TA), pp. 13–24.
PPDP-2009-Virseda #algorithm #debugging #declarative #framework #higher-order #logic #verification: A higher-order logical framework for the algorithmic debugging and verification of declarative programs (RdVV), pp. 49–60.
SAS-2009-Bodik #algorithm #synthesis: Algorithmic Program Synthesis with Partial Programs and Decision Procedures (RB), p. 1.
SAS-2009-GodoyT #invariant: Invariant Checking for Programs with Procedure Calls (GG, AT), pp. 326–342.
SAS-2009-Hurlin #automation #optimisation #parallel #proving: Automatic Parallelization and Optimization of Programs by Proof Rewriting (CH), pp. 52–68.
RE-2009-OmoronyiaSRFW #case study #developer #navigation #traceability: Use Case to Source Code Traceability: The Developer Navigation View Point (IO, GS, MR, JDF, MW), pp. 237–242.
ASE-2009-KroeningSTTW #named: Loopfrog: A Static Analyzer for ANSI-C Programs (DK, NS, ST, AT, CMW), pp. 668–670.
ASE-2009-LauterburgDMA #framework: A Framework for State-Space Exploration of Java-Based Actor Programs (SL, MD, DM, GAA), pp. 468–479.
ASE-2009-LinTCZ #adaptation #approach #java #random testing #testing: A Divergence-Oriented Approach to Adaptive Random Testing of Java Programs (YL, XT, YC, JZ), pp. 221–232.
ASE-2009-LiXTHS #automation #generative #named #regular expression #testing #using: Reggae: Automated Test Generation for Programs Using Complex Regular Expressions (NL, TX, NT, JdH, WS), pp. 515–519.
ASE-2009-YuAB #analysis #generative #string #using: Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses (FY, MA, TB), pp. 605–609.
ESEC-FSE-2009-BurnimS #parallel #thread: Asserting and checking determinism for multithreaded programs (JB, KS), pp. 3–12.
ESEC-FSE-2009-KahlonSKZ #concurrent #detection: Static data race detection for concurrent programs with asynchronous calls (VK, NS, EK, YZ), pp. 13–22.
ESEC-FSE-2009-QiRLV #approach #debugging #evolution #named: Darwin: an approach for debugging evolving programs (DQ, AR, ZL, KV), pp. 33–42.
ESEC-FSE-2009-ShermanDE #concurrent #testing: Saturation-based testing of concurrent programs (ES, MBD, SGE), pp. 53–62.
ESEC-FSE-2009-ThummalapentaXTHS #generative #mining #named #object-oriented #testing: MSeqGen: object-oriented unit-test generation via mining source code (ST, TX, NT, JdH, WS), pp. 193–202.
ICSE-2009-HangalL #automation #object-oriented: Automatic dimension inference and checking for object-oriented programs (SH, MSL), pp. 155–165.
ICSE-2009-HillPV #automation #maintenance #reuse: Automatically capturing source code context of NL-queries for software maintenance and reuse (EH, LLP, KVS), pp. 232–242.
SAC-2009-ZhaoZL #abstraction #multi #object-oriented: Abstraction of multiple executions of object-oriented programs (CZ, KZ, YL), pp. 549–550.
LDTA-2008-ChilowiczDR09: Finding Similarities in Source Code Through Factorization (MC, ÉD, GR), pp. 47–62.
LDTA-2008-FokkerS09 #abstract interpretation #attribute grammar #functional #using: Abstract Interpretation of Functional Programs using an Attribute Grammar System (JF, SDS), pp. 117–133.
LDTA-2008-LammelTK09 #fault #programming #traversal: Programming Errors in Traversal Programs Over Structured Data (RL, SJT, MK), pp. 135–153.
LDTA-2008-Nilsson-NymanHME09 #analysis #declarative #java: Declarative Intraprocedural Flow Analysis of Java Source Code (ENN, GH, EM, TE), pp. 155–171.
GPCE-2009-NedunuriC #performance #problem #synthesis: Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.
ASPLOS-2009-RajamaniRRV #named: ISOLATOR: dynamically ensuring isolation in comcurrent programs (SKR, GR, VPR, KV), pp. 181–192.
CASE-2009-WangLNRKML #concurrent #parallel #thread: Maximally permissive deadlock avoidance for multithreaded computer programs (YW, HL, AN, SAR, TK, SAM, SL), pp. 37–41.
CC-2009-BraunH: Register Spilling and Live-Range Splitting for SSA-Form Programs (MB, SH), pp. 174–189.
CC-2009-GaoLXN #concurrent #predict #recursion #thread: Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction (LG, LL, JX, TFN), pp. 78–93.
CC-2009-Sarkar #challenge #optimisation #parallel: Challenges in Code Optimization of Parallel Programs (VS), p. 1.
CC-2009-VasudevanTDE #analysis #concurrent: Compile-Time Analysis and Specialization of Clocks in Concurrent Programs (NV, OT, JD, SAE), pp. 48–62.
CGO-2009-DuanFWZY #c #c++ #concurrent #consistency #detection: Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs (YD, XF, LW, CZ, PCY), pp. 25–34.
CGO-2009-LiuR #c++ #named #performance: Perflint: A Context Sensitive Performance Advisor for C++ Programs (LL, SR), pp. 265–274.
CGO-2009-UdupaGT #execution #pipes and filters: Software Pipelined Execution of Stream Programs on GPUs (AU, RG, MJT), pp. 200–209.
DAC-2009-DangRMM #generative #interactive #pipes and filters: Generating test programs to cover pipeline interactions (TND, AR, TM, PM), pp. 142–147.
DAC-2009-JuHCR #analysis: Context-sensitive timing analysis of Esterel programs (LJ, BKH, SC, AR), pp. 870–873.
ISMM-2009-NagarajanJG #self: Self-recovery in server programs (VN, DJ, RG), pp. 49–58.
ISMM-2009-UnnikrishnanS #analysis #functional #parametricity: Parametric heap usage analysis for functional programs (LU, SDS), pp. 139–148.
LCTES-2009-UdupaGT #execution #multi: Synergistic execution of stream programs on multicores with accelerators (AU, RG, MJT), pp. 99–108.
PPoPP-2009-BikshandiCKNPSSVW #implementation #multi #performance: Efficient, portable implementation of asynchronous multi-place programs (GB, JGC, SBK, VKN, IP, VAS, SS, PV, TW), pp. 271–282.
PPoPP-2009-HuangEHC #compilation #optimisation: Exploiting global optimizations for openmp programs in the openuh compiler (LH, DE, MWH, BMC), pp. 289–290.
PPoPP-2009-KejariwalC #analysis #concurrent #parallel #thread: Parallelization spectroscopy: analysis of thread-level parallelism in hpc programs (AK, CC), pp. 293–294.
PPoPP-2009-VoVDGKT #verification: Formal verification of practical MPI programs (AV, SSV, MD, GG, RMK, RT), pp. 261–270.
WRLA-2008-LucasM09 #equation #order #termination: Operational Termination of Membership Equational Programs: the Order-Sorted Way (SL, JM), pp. 207–225.
ESOP-2009-LeinoM #concurrent #multi #thread #verification: A Basis for Verifying Multi-threaded Programs (KRML, PM), pp. 378–393.
ESOP-2009-SadowskiFF #named #parallel #thread: SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs (CS, SNF, CF), pp. 394–409.
ESOP-2009-WadlerF: Well-Typed Programs Can’t Be Blamed (PW, RBF), pp. 1–16.
FASE-2009-AcharyaX #api #mining #specification: Mining API Error-Handling Specifications from Source Code (MA, TX), pp. 370–384.
FASE-2009-ChocklerFGN #concurrent: Cross-Entropy-Based Replay of Concurrent Programs (HC, EF, BG, SN), pp. 201–215.
FASE-2009-KovacsV #array #invariant #proving #theorem proving #using: Finding Loop Invariants for Programs over Arrays Using a Theorem Prover (LK, AV), pp. 470–485.
FoSSaCS-2009-BolligGH #concurrent #recursion: Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
STOC-2009-Goldwasser #question: Athena lecture: Controlling Access to Programs? (SG), pp. 167–168.
TACAS-2009-AtigBQ #analysis #bound #concurrent #thread: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (MFA, AB, SQ), pp. 107–123.
TACAS-2009-BjornerTV #analysis #string: Path Feasibility Analysis for String-Manipulating Programs (NB, NT, AV), pp. 307–321.
TACAS-2009-BrughNR #dot-net #named #verification: MoonWalker: Verification of .NET Programs (NHMAdB, VYN, TCR), pp. 170–173.
TACAS-2009-KahlonSG #concurrent #reduction #semantics #thread: Semantic Reduction of Thread Interleavings in Concurrent Programs (VK, SS, AG), pp. 124–138.
TACAS-2009-VanoverbergheTP #generative #pointer: Test Input Generation for Programs with Pointers (DV, NT, FP), pp. 277–291.
CADE-2009-FalkeK #analysis #approach #automation #imperative #term rewriting #termination: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.
CAV-2009-BouissouGPTV #named: HybridFluctuat: A Static Analyzer of Numerical Programs within a Continuous Environment (OB, EG, SP, KT, FV), pp. 620–626.
CAV-2009-BozgaHIKV #array #automation #integer #verification: Automatic Verification of Integer Array Programs (MB, PH, RI, FK, TV), pp. 157–172.
CAV-2009-JoshiNPS #concurrent #framework #named #testing: CalFuzzer: An Extensible Active Testing Framework for Concurrent Programs (PJ, MN, CSP, KS), pp. 675–681.
CAV-2009-Strichman #equivalence #proving #verification: Regression Verification: Proving the Equivalence of Similar Programs (OS), p. 63.
CAV-2009-VerdoolaegeJB #equivalence #using: Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences (SV, GJ, MB), pp. 599–613.
CSL-2009-AlurCW #algorithm #analysis: Algorithmic Analysis of Array-Accessing Programs (RA, PC, SW), pp. 86–101.
ICLP-2009-BroechelerSS #logic programming #probability #query #using: Using Histograms to Better Answer Queries to Probabilistic Logic Programs (MB, GIS, VSS), pp. 40–54.
ICLP-2009-ChenJL #logic programming: Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (XC, JJ, FL), pp. 130–144.
ICLP-2009-CostaRR #logic programming: A Term-Based Global Trie for Tabled Logic Programs (JC, JR, RR), pp. 205–219.
ICLP-2009-DelgrandeSTW #logic programming #semantics #set: Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
ICLP-2009-Fodor #evaluation #logic programming #research #summary #transaction: Research Summary: Tabled Evaluation for Transaction Logic Programs (PF), pp. 525–526.
ICLP-2009-HolldoblerR #logic programming #semantics: Logic Programs under Three-Valued Lukasiewicz Semantics (SH, CDPKR), pp. 464–478.
ICLP-2009-LierlerL #decidability: One More Decidable Class of Finitely Ground Programs (YL, VL), pp. 489–493.
ICLP-2009-Namasivayam #logic programming #random: Study of Random Logic Programs (GN), pp. 555–556.
ICLP-2009-Truszczynski #logic programming #satisfiability #semantics: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (MT), pp. 175–189.
ICLP-2009-Voets #analysis #logic programming #research #summary: Research Summary: Non-termination Analysis of Logic Programs (DV), pp. 553–554.
ICLP-2009-VoetsS #analysis #approach #logic programming: A New Approach to Non-termination Analysis of Logic Programs (DV, DDS), pp. 220–234.
ICST-2009-Gotlieb #c #constraints #framework #named #testing: Euclide: A Constraint-Based Testing Framework for Critical C Programs (AG), pp. 151–160.
ICST-2009-KorelZT #validation: Assertion-Based Validation of Modified Programs (BK, QZ, LT), pp. 426–435.
ISSTA-2009-GorgZ #aspectj #difference #identification #semantics: Identifying semantic differences in AspectJ programs (MTG, JZ), pp. 25–36.
ISSTA-2009-MurphySK #automation #testing: Automatic system testing of programs without test oracles (CM, KS, GEK), pp. 189–200.
ISSTA-2009-SaxenaPMS #execution #symbolic computation: Loop-extended symbolic execution on binary programs (PS, PP, SM, DS), pp. 225–236.
LICS-2009-HofmannS #pointer #reachability: Pointer Programs and Undirected Reachability (MH, US), pp. 133–142.
TestCom-FATES-2009-GuoDW #erlang #testing: Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs (QG, JD, NW), pp. 81–96.
VMCAI-2009-BentonF #behaviour #java: Mostly-Functional Behavior in Java Programs (WCB, CNF), pp. 29–43.
VMCAI-2009-Gupta #concurrent #model checking: Model Checking Concurrent Programs (AG), p. 2.
VMCAI-2009-GurovH #behaviour: Reducing Behavioural to Structural Properties of Programs with Procedures (DG, MH), pp. 136–150.
CSEET-2008-PysterTHLBB #re-engineering: The Current State of Software Engineering Masters Degree Programs (ABP, RT, DH, KL, LB, KB), pp. 103–109.
ITiCSE-2008-BorstlerCBNWMC #object-oriented: Evaluating OO example programs for CS1 (JB, HBC, JB, MN, LKW, JEM, MEC), pp. 47–52.
ITiCSE-2008-Burrell #learning #object-oriented #process #programming #visualisation: Learning object oriented programming: unique visualizations of individuals learning styles, activities and the programs produced (CJB), p. 339.
ITiCSE-2008-JiWC #contest #detection #experience #programming: An experience of detecting plagiarized source codes in competitive programming contests (JHJ, GW, HGC), p. 369.
CSMR-2008-KanellopoulosTHV #clustering #maintenance: Interpretation of Source Code Clusters in Terms of the ISO/IEC-9126 Maintainability Characteristics (YK, CT, IH, JV), pp. 63–72.
CSMR-2008-PantosBGG #adaptation #assessment #case study #experience #quality: Experiences in Adapting a Source Code-Based Quality Assessment Technology (JP, ÁB, PG, TG), pp. 311–313.
ICPC-2008-EaddyAAG #dynamic analysis #information retrieval #named #program analysis #requirements #using: CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis (ME, AVA, GA, YGG), pp. 53–62.
ICPC-2008-HaiducM #on the #using: On the Use of Domain Terms in Source Code (SH, AM), pp. 113–122.
ICPC-2008-PinzgerGKG #comprehension #dependence #visual notation: A Tool for Visual Understanding of Source Code Dependencies (MP, KG, PK, HCG), pp. 254–259.
ICPC-2008-SatoST #comprehension #execution #user interface #visualisation: Support for Understanding GUI Programs by Visualizing Execution Traces Synchronized with Screen Transitions (TS, BS, JT), pp. 272–275.
ICSM-2008-AnvikS #issue tracking #maintenance: Task articulation in software maintenance: Integrating source code annotations with an issue tracking system (JA, MADS), pp. 460–461.
ICSM-2008-KagdiHM #question: Who can help me with this source code change? (HHK, MH, JIM), pp. 157–166.
ICSM-2008-Lozano: A methodology to assess the impact of source code flaws in changeability, and its application to clones (AL), pp. 424–427.
ICSM-2008-TallamTG #concurrent #detection #parallel #slicing #thread: Dynamic slicing of multithreaded programs for race detection (ST, CT, RG), pp. 97–106.
ICSM-2008-ZhangGLZ #aspectj #impact analysis: Change impact analysis for AspectJ programs (SZ, ZG, YL, JZ), pp. 87–96.
ICSM-2008-Zhao #aspect-oriented #challenge #maintenance: Maintenance support for aspect-oriented programs: opportinuties and challenges (JZ), pp. 482–483.
MSR-2008-ChangM #detection #evaluation: Evaluation of source code copy detection methods on freebsd (HFC, AM), pp. 61–66.
MSR-2008-HillFBSNPV #automation #maintenance #mining #named #tool support: AMAP: automatically mining abbreviation expansions in programs to enhance software maintenance tools (EH, ZPF, HB, GS, YN, LLP, KVS), pp. 79–88.
MSR-2008-OmoriM #development #editing: A change-aware development environment by recording editing operations of source code (TO, KM), pp. 31–34.
SCAM-2008-GiffhornH #analysis #java #precise #using: Precise Analysis of Java Programs Using JOANA (DG, CH), pp. 267–268.
SCAM-2008-PentaCA #detection #evolution: The Evolution and Decay of Statically Detected Source Code Vulnerabilities (MDP, LC, LA), pp. 101–110.
WCRE-2008-DolgovaC #automation #c #re-engineering: Automatic Type Reconstruction in Disassembled C Programs (KD, AC), pp. 202–206.
WCRE-2008-GasparisNEK #design #navigation #object-oriented: Navigating Through the Design of Object-Oriented Programs (EG, JN, AHE, RK), pp. 331–332.
WCRE-2008-GhanbariCA #analysis #aspectj #hybrid #java #query: A Hybrid Query Engine for the Structural Analysis of Java and AspectJ Programs (HG, CC, VA), pp. 133–137.
WCRE-2008-IshioDMI #detection #java #mining: Mining Coding Patterns to Detect Crosscutting Concerns in Java Programs (TI, HD, TM, KI), pp. 123–132.
WCRE-2008-LukinsKE #debugging #locality #retrieval #using: Source Code Retrieval for Bug Localization Using Latent Dirichlet Allocation (SKL, NAK, LHE), pp. 155–164.
WCRE-2008-Zhang: Exploring Regularity in Source Code: Software Science and Zipf’s Law (HZ), pp. 101–110.
ICALP-A-2008-AzarG #framework #integer #unification: Truthful Unification Framework for Packing Integer Programs with Choices (YA, IG), pp. 833–844.
SEFM-2008-Ferrara #parallel #static analysis #thread: Static Analysis of the Determinism of Multithreaded Programs (PF), pp. 41–50.
SEFM-2008-XavierHM #fault tolerance #using #verification: Using Formal Verification to Reduce Test Space of Fault-Tolerant Programs (KSX, SH, ACVdM), pp. 181–190.
ICFP-2008-FischerK #data flow #declarative #testing: Data-flow testing of declarative programs (SF, HK), pp. 201–212.
ICFP-2008-Ley-WildFA #compilation #continuation #self: Compiling self-adjusting programs with continuations (RLW, MF, UAA), pp. 321–334.
ICFP-2008-NanevskiMSGB #dependent type #imperative #named: Ynot: dependent types for imperative programs (AN, GM, AS, PG, LB), pp. 229–240.
ICFP-2008-SpoonhowerBHG #functional #parallel #profiling: Space profiling for parallel functional programs (DS, GEB, RH, PBG), pp. 253–264.
IFL-2008-BrasselF #functional #lazy evaluation #logic programming: From Functional Logic Programs to Purely Functional Programs Preserving Laziness (BB, SF), pp. 25–42.
IFL-2008-ShkaravskaET #functional #semantics: Collected Size Semantics for Functional Programs over Lists (OS, MCJDvE, AT), pp. 118–137.
GT-VMT-2006-Kunert08 #automation #generative #metamodelling #modelling: Semi-automatic Generation of Metamodels and Models From Grammars and Programs (AK), pp. 111–119.
GT-VMT-2008-AzabP #c++ #graph #type checking: Type Checking C++ Template Instantiation by Graph Programs (KA, KHP).
ICGT-2008-AzabH: High-Level Programs and Program Conditions (KA, AH), pp. 211–225.
CHI-2008-ChengET #towards: Participant and interviewer attitudes toward handheld computers in the context of HIV/AIDS programs in sub-Saharan Africa (KGC, FE, KNT), pp. 763–766.
ICEIS-ISAS1-2008-BeckerAP #approach #process: An Approach to Support the Strategic Alignment of Software Process Improvement Programs (ALB, JLNA, RP), pp. 66–73.
ICML-2008-RavikumarAW #convergence #linear #message passing: Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes (PDR, AA, MJW), pp. 800–807.
KDD-2008-Sindhgatta #developer #identification: Identifying domain expertise of developers from source code (RS), pp. 981–989.
KR-2008-ClassenL #logic: A Logic for Non-Terminating Golog Programs (JC, GL), pp. 589–599.
KR-2008-DelgrandeSTW #logic programming #semantics #set: Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KR-2008-FaberTW #equivalence #logic programming #order: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
SEKE-2008-BaiL #named #testing: SyncTest: a Tool to Synchronize Source Code, Model and Testing (XB, TL), pp. 723–728.
SEKE-2008-HuS #design pattern #detection #dynamic analysis #java: Dynamic Analysis and Design Pattern Detection in Java Programs (LH, KS), pp. 842–846.
SEKE-2008-Shaffer #domain model #security #static analysis #verification: A Security Domain Model for Static Analysis and Verification of Software Programs (ABS), pp. 673–678.
SEKE-2008-TinkhamTP #assessment #comprehension #java #reverse engineering #testing #tool support: A Qualitative Assessment of the Reverse Engineering Capabilities of Unit Testing Tools for Understanding Java Programs (AT, SRT, TP), pp. 111–116.
BX-2008-Matsuda1 #bidirectional: Bidirectionalization of Programs with Duplication through Complement Function Derivation (KM), p. 40.
ECOOP-2008-TemperoNM #empirical #how #inheritance #java: How Do Java Programs Use Inheritance? An Empirical Study of Inheritance in Java Software (EDT, JN, HM), pp. 667–691.
OOPSLA-2008-DagenaisH #java #static analysis: Enabling static analysis for partial java programs (BD, LJH), pp. 313–328.
OOPSLA-2008-XianSJ #execution #java #parallel #thread: Contention-aware scheduler: unlocking execution parallelism in multithreaded java programs (FX, WSa, HJ), pp. 163–180.
TOOLS-EUROPE-2008-NordioMM #compilation #eiffel: Proof-Transforming Compilation of Eiffel Programs (MN, PM, BM), pp. 316–335.
AdaEurope-2008-FecheteKB #ada #framework #program analysis: A Framework for CFG-Based Static Program Analysis of Ada Programs (RF, GK, JB), pp. 130–143.
AdaEurope-2008-RazaV #detection #flexibility #framework #named #parallel: RCanalyser: A Flexible Framework for the Detection of Data Races in Parallel Programs (AR, GV), pp. 226–239.
LOPSTR-2008-ArroyoRTV #approach #functional #higher-order: A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (GA, JGR, ST, GV), pp. 40–54.
LOPSTR-2008-LeuschelV #logic programming #partial evaluation #performance #scalability: Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
PADL-2008-EshkevariAC #analysis #aspect-oriented #comprehension #declarative #dependence #reasoning: Comprehension and Dependency Analysis of Aspect-Oriented Programs through Declarative Reasoning (LME, VA, CC), pp. 35–52.
PEPM-2008-LiT #functional #refactoring #tool support: Tool support for refactoring functional programs (HL, SJT), pp. 199–203.
PEPM-2008-PietrzakCPH #analysis #composition #prolog #verification: A practical type analysis for verification of modular prolog programs (PP, JC, GP, MVH), pp. 61–70.
PEPM-2008-PuchingerS #automation #bound: Automating branch-and-bound for dynamic programs (JP, PJS), pp. 81–89.
PLDI-2008-ChughVJL #analysis #concurrent #data flow #detection #using: Dataflow analysis for concurrent programs using datarace detection (RC, JWV, RJ, SL), pp. 316–326.
PLDI-2008-FengSDG #hardware #low level #thread: Certifying low-level programs with hardware interrupts and preemptive threads (XF, ZS, YD, YG), pp. 170–182.
PLDI-2008-FlanaganFY #named #parallel #thread: Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs (CF, SNF, JY), pp. 293–303.
PLDI-2008-HalbwachsP #array: Discovering properties about arrays in simple programs (NH, MP), pp. 339–348.
PLDI-2008-KudlurM #execution #manycore #platform: Orchestrating the execution of stream programs on multicore platforms (MK, SAM), pp. 114–124.
PLDI-2008-Sen #concurrent #random testing #testing: Race directed random testing of concurrent programs (KS), pp. 11–21.
PPDP-2008-ChitilD #algorithm #debugging #finite #functional #higher-order: Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.
PPDP-2008-Hanus #analysis #functional #logic programming: Call pattern analysis for functional logic programs (MH), pp. 67–78.
PPDP-2008-Lu #dependence #logic programming #polymorphism #precise: Inferring precise polymorphic type dependencies in logic programs (LL), pp. 143–151.
QAPL-2008-Smith #abstract interpretation #imperative #probability #using: Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions (MJAS), pp. 43–59.
SAS-2008-LammichM #analysis #concurrent #monitoring #thread: Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors (PL, MMO), pp. 205–220.
SAS-2008-RuggieriM #constraints #linear #type system: Typing Linear Constraints for Moding CLP() Programs (SR, FM), pp. 128–143.
SIGAda-2008-Maurer #ada #problem: Removing backward go-to statements from Ada programs: possibilities and problems (WDM), pp. 105–108.
SIGAda-2008-Safari-SharifabadiC #ada #comprehension #dynamic analysis #metric #quality: Dynamic analysis of Ada programs for comprehension and quality measurement (ESS, CC), pp. 15–38.
ASE-2008-BordiniDFF #automation #multi #verification: Automated Verification of Multi-Agent Programs (RHB, LAD, BF, MF), pp. 69–78.
ASE-2008-BrichauKM #using: Enforcing Structural Regularities in Source Code using IntensiVE (JB, AK, KM), pp. 471–472.
ASE-2008-InkumsahX #execution #object-oriented #symbolic computation #testing: Improving Structural Testing of Object-Oriented Programs via Integrating Evolutionary Testing and Symbolic Execution (KI, TX), pp. 297–306.
ASE-2008-Jones #development #predict: Reflections on, and Predictions for, Support Systems for the Development of Programs (CBJ), pp. 7–8.
ASE-2008-JoshiS #java #parallel #predict #thread #type system: Predictive Typestate Checking of Multithreaded Java Programs (PJ, KS), pp. 288–296.
ASE-2008-Papailiopoulou #automation #generative #testing: Automatic Test Generation for LUSTRE/SCADE Programs (VP), pp. 517–520.
ASE-2008-ThummalapentaX #detection #framework #mining #named #open source #web: SpotWeb: Detecting Framework Hotspots and Coldspots via Mining Open Source Code on the Web (ST, TX), pp. 327–336.
ASE-2008-Yom-TovTUH #automation #concurrent #debugging #random: Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections (EYT, RT, SU, SH), pp. 307–316.
FSE-2008-CottrellWD #reuse: Semi-automating small-scale source code reuse via structural correspondence (RC, RJW, JD), pp. 214–225.
FSE-2008-ParkS #concurrent #detection #random: Randomized active atomicity violation detection in concurrent programs (CSP, KS), pp. 135–145.
ICSE-2008-LauterburgSMV #incremental: Incremental state-space exploration for programs with dynamically allocated data (SL, AS, DM, MV), pp. 291–300.
SAC-2008-DuraoVAM #code search #semantics: Applying a semantic layer in a source code search tool (FAD, TAV, ESdA, SRdLM), pp. 1151–1157.
SAC-2008-LiQWLW #consistency #diagrams #interactive #java #runtime #state machine #uml #verification: UML state machine diagram driven runtime verification of Java programs for message interaction consistency (XL, XQ, LW, BL, WEW), pp. 384–389.
SAC-2008-MeloNX #java #testing #towards #verification: Towards verification and testing of Java programs (ACVdM, PRFN, KSX), pp. 730–734.
SLE-2008-BastenK #fact extraction #named #parametricity: DeFacto: Language-Parametric Fact Extraction from Source Code (BB, PK), pp. 265–284.
CC-2008-LogozzoF #analysis #bytecode #on the: On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis (FL, MF), pp. 197–212.
CGO-2008-BoissinotHGDR #liveness #performance: Fast liveness checking for ssa-form programs (BB, SH, DG, BDdD, FR), pp. 35–44.
CGO-2008-Sarkar #optimisation #parallel: Code optimization of parallel programs: evolutionary vs. revolutionary approaches (VS), p. 1.
DATE-2008-CertnerLPTAD #approach #parallel #performance #predict: A Practical Approach for Reconciling High and Predictable Performance in Non-Regular Parallel Programs (OC, ZL, PP, OT, FA, ND), pp. 740–745.
DATE-2008-GanaiG #smt: Completeness in SMT-based BMC for Software Programs (MKG, AG), pp. 831–836.
DATE-2008-LinF #parallel #performance: Harnessing Horizontal Parallelism and Vertical Instruction Packing of Programs to Improve System Overall Efficiency (HL, YF), pp. 758–763.
HPCA-2008-RashidH #concurrent #parallel #thread: Supporting highly-decoupled thread-level redundancy for parallel programs (MWR, MCH), pp. 393–404.
ISMM-2008-ChinNPQ #bound #low level #memory management: Analysing memory resource bounds for low-level programs (WNC, HHN, CP, SQ), pp. 151–160.
LCTES-2008-DelavalGP #automation #data flow #higher-order #type system: A type system for the automatic distribution of higher-order synchronous dataflow programs (GD, AG, MP), pp. 101–110.
LCTES-2008-NewtonGCMM #compilation #design #embedded #evaluation: Design and evaluation of a compiler for embedded stream programs (RN, LG, MBC, SM, JGM), pp. 131–140.
OSDI-2008-CadarDE #automation #generative #named #testing: KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs (CC, DD, DRE), pp. 209–224.
OSDI-2008-MusuvathiQBBNN #concurrent: Finding and Reproducing Heisenbugs in Concurrent Programs (MM, SQ, TB, GB, PAN, IN), pp. 267–280.
OSDI-2008-WangKKLM #concurrent #named #parallel #thread: Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs (YW, TK, MK, SL, SAM), pp. 281–294.
PPoPP-2008-RulVB #parallel: Extracting coarse-grain parallelism in general-purpose programs (SR, HV, KDB), pp. 281–282.
PPoPP-2008-VakkalankaSGK #model checking #named: ISP: a tool for model checking MPI programs (SSV, SS, GG, RMK), pp. 285–286.
PPoPP-2008-WangYFDWJ #analysis #automation: Automated application-level checkpointing based on live-variable analysis in MPI programs (PW, XY, HF, YD, ZW, JJ), pp. 273–274.
FASE-2008-SmansJPS #automation #java #verification: An Automatic Verifier for Java-Like Programs Based on Dynamic Frames (JS, BJ, FP, WS), pp. 261–275.
STOC-2008-AwerbuchK #distributed #linear: Stateless distributed gradient descent for positive linear programs (BA, RK), pp. 691–700.
TACAS-2008-LalTKR #analysis #bound #concurrent #interprocedural: Interprocedural Analysis of Concurrent Programs Under a Context Bound (AL, TT, NK, TWR), pp. 282–298.
TACAS-2008-LegayMOW #automation #on the #probability #verification: On Automated Verification of Probabilistic Programs (AL, ASM, JO, JW), pp. 173–187.
CAV-2008-AbdullaBCHR #abstraction #memory management: Monotonic Abstraction for Programs with Dynamic Memory Heaps (PAA, AB, JC, FH, AR), pp. 341–354.
CAV-2008-CohenN #concurrent #linear #proving: Local Proofs for Linear-Time Properties of Concurrent Programs (AC, KSN), pp. 149–161.
CAV-2008-FarzanM #concurrent #monitoring: Monitoring Atomicity in Concurrent Programs (AF, PM), pp. 52–65.
CAV-2008-VakkalankaGK #order #reduction #verification: Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings (SSV, GG, RMK), pp. 66–79.
CSL-2008-HofmannS #pointer: Pure Pointer Programs with Iteration (MH, US), pp. 79–93.
ICLP-2008-BaseliceB: Composing Normal Programs with Function Symbols (SB, PAB), pp. 425–439.
ICLP-2008-CohenSS #algorithm #logic programming: Dynamic Programming Algorithms as Products of Weighted Logic Programs (SBC, RJS, NAS), pp. 114–129.
ICLP-2008-Janhunen #set: Removing Redundancy from Answer Set Programs (TJ), pp. 729–733.
ICLP-2008-JanssenHVC #compilation #fuzzy #set: Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories (JJ, SH, DV, MDC), pp. 362–376.
ICLP-2008-KimmigCRDR #execution #on the #performance: On the Efficient Execution of ProbLog Programs (AK, VSC, RR, BD, LDR), pp. 175–189.
ICLP-2008-LiuY #representation #semantics: Lparse Programs Revisited: Semantics and Representation of Aggregates (GL, JHY), pp. 347–361.
ICLP-2008-MarquesS #concurrent #evaluation: Concurrent and Local Evaluation of Normal Programs (RM, TS), pp. 206–222.
ICLP-2008-PearceV #equilibrium #logic #quantifier #set: Quantified Equilibrium Logic and Foundations for Answer Set Programs (DP, AV), pp. 546–560.
ICLP-2008-PuhrerTW: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.
ICLP-2008-Riguzzi #logic programming #semantics: Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics (FR), pp. 667–671.
ICLP-2008-SenniPP #algorithm #constraints #logic programming: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (VS, AP, MP), pp. 284–300.
ICLP-2008-TruszczynskiW #composition #logic programming: Relativized Hyperequivalence of Logic Programs for Modular Programming (MT, SW), pp. 576–590.
ICLP-2008-VanhoofD #algorithm #logic programming: An Algorithm for Sophisticated Code Matching in Logic Programs (WV, FD), pp. 785–789.
ICST-2008-FerrariMR #aspect-oriented #mutation testing #testing: Mutation Testing for Aspect-Oriented Programs (FCF, JCM, AR), pp. 52–61.
ICST-2008-KimC #object-oriented #sequence #testing: A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs (MK, YC), pp. 537–540.
ICST-2008-LeiWL #concurrent #consistency #diagrams #java #nondeterminism #process #testing #uml: UML Activity Diagram Based Testing of Java Concurrent Programs for Data Race and Inconsistency (BL, LW, XL), pp. 200–209.
ICST-2008-PrasetyaVB #object-oriented #reflexive #testing: Trace-based Reflexive Testing of OO Programs with T2 (WP, TEJV, AIB), pp. 151–160.
IJCAR-2008-BozgaIP #logic: Quantitative Separation Logic and Programs with Lists (MB, RI, SP), pp. 34–49.
ISSTA-2008-KondohO #debugging #interface #java: Finding bugs in java native interface programs (GK, TO), pp. 109–118.
LICS-2008-Kahlon #abstraction #analysis #approach #concurrent #data flow: Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs (VK), pp. 181–192.
LICS-2008-Murawski #game studies #nondeterminism #reachability #semantics: Reachability Games and Game Semantics: Comparing Nondeterministic Programs (ASM), pp. 353–363.
TAP-2008-VelroyenR #imperative: Non-termination Checking for Imperative Programs (HV, PR), pp. 154–170.
TestCom-FATES-2008-Havelund #c #runtime #verification: Runtime Verification of C Programs (KH), pp. 7–22.
VMCAI-2008-BouissouM #abstract interpretation #embedded #physics: Abstract Interpretation of the Physical Inputs of Embedded Programs (OB, MM), pp. 37–51.
VMCAI-2008-Mendez-LojoH #analysis #precise #set: Precise Set Sharing Analysis for Java-Style Programs (MML, MVH), pp. 172–187.
JCDL-2007-PomerantzOWYF #education #library: Digital library education in computer science programs (JP, SO, BMW, SY, EAF), pp. 177–178.
CSEET-2007-MeadHMRS #on the #re-engineering: On the Feasibility of Specialization within Software Engineering Degree Programs (NRM, TBH, JM, MR, DS), pp. 362–366.
ITiCSE-2007-BrownM #student #visualisation: Visualizing berkeley socket calls in students’ programs (CB, CM), pp. 101–105.
ITiCSE-2007-Helmick #automation #interface #java #programming: Interface-based programming assignments and automatic grading of java programs (MTH), pp. 63–67.
ITiCSE-2007-Impagliazzo #approach #using: Using an outcome-based approach to assess computing programs (JI), p. 344.
ITiCSE-2007-JiWC #detection: A source code linearization technique for detecting plagiarized programs (JHJ, GW, HGC), pp. 73–77.
ITiCSE-2007-JonesB #navigation: Spatial skills and navigation of source code (SJJ, GEB), pp. 231–235.
ITiCSE-2007-SandersT #concept #object-oriented: Checklists for grading object-oriented CS1 programs: concepts and misconceptions (KS, LT), pp. 166–170.
SIGITE-2007-NezlekL: The quest for an administrative nexus for information technology programs (GSN, PML), pp. 151–154.
WCRE-J-2005-KuhnDG07 #clustering #identification #semantics #topic: Semantic clustering: Identifying topics in source code (AK, SD, TG), pp. 230–243.
CSMR-2007-Leitao #approach #framework #java #lisp #migration #platform: Migration of Common Lisp Programs to the Java Platform — The Linj Approach (AML), pp. 243–251.
CSMR-2007-Staiger #static analysis #user interface #visual notation: Static Analysis of Programs with Graphical User Interface (SS), pp. 252–264.
CSMR-2007-SzegediGBGT #concept #java #slicing #verification: Verifying the Concept of Union Slices on Java Programs (AS, TG, ÁB, TG, GT), pp. 233–242.
ICPC-2007-CareyG #automation #concept #identification: Recovering Concepts from Source Code with Automated Concept Identification (MMC, GCG), pp. 27–36.
ICPC-2007-LuccaSFSH #aspect-oriented #challenge #roadmap: Comprehending Aspect-Oriented Programs: Challenges and Open Issues (GADL, MS, BF, ES, HJH), pp. 286–292.
ICPC-2007-PoshyvanykM #concept analysis #information retrieval: Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code (DP, AM), pp. 37–48.
ICPC-2007-RatiuD: From Reality to Programs and (Not Quite) Back Again (DR, FD), pp. 91–102.
ICPC-2007-ShearerC #constraints: Enforcing Constraints Between Documentary Comments and Source Code (CDS, MLC), pp. 271–280.
ICPC-2007-Vivanco #algorithm #complexity #identification #metric #modelling #predict #search-based #using: Use of a Genetic Algorithm to Identify Source Code Metrics Which Improves Cognitive Complexity Predictive Models (RAV), pp. 297–300.
ICSM-2007-CorboGP #learning: Smart Formatter: Learning Coding Style from Existing Source Code (FC, CDG, MDP), pp. 525–526.
ICSM-2007-OezbekP #comprehension #documentation #named: JTourBus: Simplifying Program Understanding by Documentation that Provides Tours Through the Source Code (CO, LP), pp. 64–73.
MSR-2007-CanforaCP #identification #repository: Identifying Changed Source Code Lines from Version Repositories (GC, LC, MDP), p. 14.
MSR-2007-KagdiCM #mining: Comparing Approaches to Mining Source Code for Call-Usage Patterns (HHK, MLC, JIM), p. 20.
PASTE-2007-XuPV #analysis #java: Dynamic purity analysis for java programs (HX, CJFP, CV), pp. 75–82.
SCAM-2007-GiffhornH #algorithm #concurrent #evaluation #slicing: An Evaluation of Slicing Algorithms for Concurrent Programs (DG, CH), pp. 17–26.
SCAM-2007-Johannes #composition #framework #reuse: Source Code Composition with the Reuseware Composition Framework (JJ), pp. 159–160.
SCAM-2007-MolinaS #approximate #open source #performance #using: Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes (AJMM, TS), pp. 111–122.
SCAM-2007-MoorVHAEOST #analysis: Keynote Address: .QL for Source Code Analysis (OdM, MV, EH, PA, TE, NO, DS, JT), pp. 3–16.
WCRE-2007-FluriWG: Do Code and Comments Co-Evolve? On the Relation between Source Code and Comment Changes (BF, MW, HG), pp. 70–79.
ICALP-2007-LeePP #alias: Aliased Register Allocation for Straight-Line Programs Is NP-Complete (JKL, JP, FMQP), pp. 680–691.
LATA-2007-AblayevG #branch #complexity #quantum #simulation: Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.
SEFM-2007-BeckertK #concurrent #deduction #logic #verification: A Dynamic Logic for Deductive Verification of Concurrent Programs (BB, VK), pp. 141–150.
SEFM-2007-Cook #automation #concurrent #proving: Automatically Proving Concurrent Programs Correct (BC), pp. 269–272.
SEFM-2007-CrockerC #automation #c #reasoning #using #verification: Verification of C Programs Using Automated Reasoning (DC, JC), pp. 7–14.
SEFM-2007-DengRH #algorithm #execution #object-oriented #symbolic computation #towards: Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs (XD, R, JH), pp. 273–282.
CEFP-2007-MolEP #functional #lazy evaluation #proving: Proving Properties of Lazy Functional Programs with Sparkle (MdM, MCJDvE, RP), pp. 41–86.
ICFP-2007-Jones #haskell: Call-pattern specialisation for haskell programs (SLPJ), pp. 327–337.
ICFP-2007-Sereni #analysis #functional #graph #higher-order #termination: Termination analysis and call graph construction for higher-order functional programs (DS), pp. 71–84.
IFL-2007-BrasselS #debugging #functional #lazy evaluation: Debugging Lazy Functional Programs by Asking the Oracle (BB, HS), pp. 183–200.
VISSOFT-2007-BohnerGHM #analysis #uml #using #visual notation #visualisation: Evolutional Insights from UML and Source Code Versions using Information Visualization and Visual Analysis (SAB, DG, TH, KM), pp. 145–148.
VISSOFT-2007-BohnetD #2d #graph #visualisation: Facilitating Exploration of Unfamiliar Source Code by Providing 21/2D Visualizations of Dynamic Call Graphs (JB, JD), pp. 63–66.
VISSOFT-2007-HolmesW #dependence: Task-specific source code dependency investigation (RH, RJW), pp. 100–107.
VISSOFT-2007-VoineaT #debugging #process #repository #visualisation: Visualizing Debugging Activity in Source Code Repositories (LV, ACT), pp. 156–157.
SEKE-2007-KuoSSTZ #random testing #testing: Enhanced Random Testing for Programs with High Dimensional Input Domains (FCK, KYS, CaS, SFT, ZZ), pp. 135–140.
SEKE-2007-MonteiroOG #implementation #user interface #using: A Proposal to Delegate GUI Implementation using a Source Code based Model (MM, PO, RG), pp. 29–32.
SEKE-2007-RushtonT #reasoning: A Language Facilitating Informal Reasoning about Programs (JNR, DT), p. 396–?.
OOPSLA-2007-ShanerLN #composition #higher-order #verification: Modular verification of higher-order methods with mandatory calls specified by model programs (SMS, GTL, DAN), pp. 351–368.
TOOLS-EUROPE-2007-HorieC #aspectj #named: AspectScope: An Outline Viewer for AspectJ Programs (MH, SC), pp. 341–361.
AdaEurope-2007-BliebergerBM #ada #detection #multi #static analysis: Static Detection of Livelocks in Ada Multitasking Programs (JB, BB, RM), pp. 69–83.
LOPSTR-2007-CasasCH #algorithm #independence #logic programming #strict: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.
LOPSTR-2007-DegraveV #normalisation #towards: Towards a Normal Form for Mercury Programs (FD, WV), pp. 43–58.
LOPSTR-2007-FischerSTV #functional #lazy evaluation #partial evaluation: Preserving Sharing in the Partial Evaluation of Lazy Functional Programs (SF, JS, ST, GV), pp. 74–89.
LOPSTR-2007-Mendez-LojoNH #analysis #approach #flexibility #object-oriented: A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs (MML, JAN, MVH), pp. 154–168.
LOPSTR-2007-NguyenGSS #analysis #dependence #graph #logic programming #termination: Termination Analysis of Logic Programs Based on Dependency Graphs (MTN, JG, PSK, DDS), pp. 8–22.
PADL-2007-AlbertGHP #analysis #bytecode #java #logic programming #using #verification: Verification of Java Bytecode Using Analysis and Transformation of Logic Programs (EA, MGZ, LH, GP), pp. 124–139.
PEPM-2007-CunhaV #query #xpath: Transformation of structure-shy programs: applied to XPath queries and strategic functions (AC, JV), pp. 11–20.
PEPM-2007-FernandesS #library #tool support: Tools and libraries to model and manipulate circular programs (JPF, JS), pp. 102–111.
PEPM-2007-Hamilton #named: Distillation: extracting the essence of programs (GWH), pp. 61–70.
PEPM-2007-RooverDBND #behaviour #logic #query #similarity #using: Behavioral similarity matching using concrete source code templates in logic queries (CDR, TD, JB, CN, LD), pp. 92–101.
PEPM-2007-Vidal #logic programming #partial evaluation #termination: Quasi-terminating logic programs for ensuring the termination of partial evaluation (GV), pp. 51–60.
PLDI-2007-MoritaMMHT #automation #divide and conquer