BibSLEIGH — concurrent tag

concurrent

concurrent

Tag #concurrent

1931 papers:

POPL-2020-AschieriG #functional #linear #logic #parallel #proving #source code: Par means parallel: multiplicative linear logic proofs as concurrent functional programs (FA, FAG), p. 28.
ASPLOS-2020-YuanY #distributed #effectiveness #testing: Effective Concurrency Testing for Distributed Systems (XY, JY), pp. 1141–1156.
CGO-2020-VermaKPR #debugging #interactive #memory management #modelling #source code: Interactive debugging of concurrent programs under relaxed memory models (AV, PKK, AP, SR), pp. 68–80.
ICSA-2019-JahicKAW #architecture #implementation #testing: Testing the Implementation of Concurrent AUTOSAR Drivers Against Architecture Decisions (JJ, VK, POA, GW), pp. 171–180.
SANER-2019-DilleyL #empirical: An Empirical Study of Messaging Passing Concurrency in Go Projects (ND, JL), pp. 377–387.
SANER-2019-QiZ #source code #testing: A Splitting Strategy for Testing Concurrent Programs (XQ, HZ), pp. 388–398.
FM-2019-DerrickDDSW #correctness #data type #persistent #verification: Verifying Correctness of Persistent Concurrent Data Structures (JD, SD, BD, GS, HW), pp. 179–195.
FM-2019-KwiatkowskaN0S #game studies #model checking #probability: Equilibria-Based Probabilistic Model Checking for Concurrent Stochastic Games (MK, GN, DP0, GS), pp. 298–315.
FM-2019-Lang0M #bisimulation #composition #verification: Compositional Verification of Concurrent Systems by Combining Bisimulations (FL, RM0, FM), pp. 196–213.
FM-2019-ZhaoSZ0 #framework #parametricity #reasoning: A Parametric Rely-Guarantee Reasoning Framework for Concurrent Reactive Systems (YZ, DS, FZ, YL0), pp. 161–178.
IFM-2019-BoerH #axiom #reachability: Axiomatic Characterization of Trace Reachability for Concurrent Objects (FSdB, HDAH), pp. 157–174.
IFM-2019-MargariaS #industrial #thread: The Digital Thread in Industry 4.0 (TM, AS), pp. 3–24.
IFM-2019-OortwijnH #abstraction #automation #message passing #verification: Practical Abstractions for Automated Verification of Message Passing Concurrency (WO, MH), pp. 399–417.
SEFM-2019-WijsW #code generation #composition #multi #thread #verification: Modular Indirect Push-Button Formal Verification of Multi-threaded Code Generators (AW, MW), pp. 410–429.
Haskell-2019-ErtelARGC #composition #data flow #monad #named #parallel #thread: STCLang: state thread composition as a foundation for monadic dataflow parallelism (SE, JA, NAR, AG, JC), pp. 146–161.
ICFP-2019-TimanyB #continuation #relational #source code #verification: Mechanized relational verification of concurrent programs with continuations (AT, LB), p. 28.
CIKM-2019-YuPY #modelling #recognition: Modeling Long-Range Context for Concurrent Dialogue Acts Recognition (YY, SP, GHY), pp. 2277–2280.
OOPSLA-2019-BenderP #formal method #java: A formalization of Java's concurrent access modes (JB, JP), p. 28.
OOPSLA-2019-GencRXB #bound #detection #predict: Dependence-aware, unbounded sound predictive race detection (KG, JR, YX, MDB), p. 30.
OOPSLA-2019-Nanevski0DF #logic #morphism #simulation #source code #specification: Specifying concurrent programs in separation logic: morphisms and simulations (AN, AB0, GAD, IF), p. 30.
PLDI-2019-JiangLXZF #compilation #source code #towards: Towards certified separate compilation for concurrent programs (HJ, HL, SX, JZ, XF), pp. 111–125.
PLDI-2019-PultePKLH #named #performance: Promising-ARM/RISC-V: a simpler and faster operational concurrency model (CP, JPP, JK, SHL, CKH), pp. 1–15.
PLDI-2019-RuppelL #energy #transaction: Transactional concurrency control for intermittent, energy-harvesting computing systems (ER, BL), pp. 1085–1100.
POPL-2019-BizjakGKB #higher-order #logic #named: Iron: managing obligations in higher-order concurrent separation logic (AB, DG, RK, LB), p. 30.
POPL-2019-BonchiHPSZ #algebra #diagrams #linear: Diagrammatic algebra: from linear to concurrent systems (FB, JH, RP, PS, FZ), p. 28.
POPL-2019-RaadDRLV #consistency #correctness #declarative #library #memory management #modelling #on the #specification #verification: On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models (AR, MD, LR, OL, VV), p. 31.
POPL-2019-TassarottiH #logic #random #source code: A separation logic for concurrent randomized programs (JT, RH0), p. 30.
ASE-2019-ArthoPT #java #visual notation: Visual Analytics for Concurrent Java Executions (CA, MP, QT0), pp. 1102–1105.
ASE-2019-FischerTP #multi #source code #thread: VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq (BF, SLT, GP), pp. 1150–1153.
ASE-2019-MengZYL0Y #detection #effectiveness #named: CONVUL: An Effective Tool for Detecting Concurrency Vulnerabilities (RM, BZ, HY, HL, YC0, ZY), pp. 1154–1157.
ASE-2019-PobeeMC #multi #performance #source code #thread #transaction: Efficient Transaction-Based Deterministic Replay for Multi-threaded Programs (EBP, XM, WKC), pp. 760–771.
ASE-2019-ZamanHY #fault #named #scalability: SCMiner: Localizing System-Level Concurrency Faults from Large System Call Traces (TSZ, XH, TY), pp. 515–526.
ASE-2019-ZhangYD #abstraction #automation: Automating Non-Blocking Synchronization In Concurrent Data Abstractions (JZ, QY, DD), pp. 735–747.
ESEC-FSE-2019-CaiZMYHSL #detection #memory management: Detecting concurrency memory corruption vulnerabilities (YC, BZ, RM, HY, LH, PS, BL0), pp. 706–717.
ESEC-FSE-2019-PobeeC #multi #named #performance #source code #thread: AggrePlay: efficient record and replay of multi-threaded programs (EBP, WKC), pp. 567–577.
ICSE-2019-Yin0L0 #parallel #refinement #thread #verification: Parallel refinement for multi-threaded program verification (LY, WD0, WL, JW0), pp. 643–653.
ASPLOS-2019-TuLSZ #comprehension #debugging: Understanding Real-World Concurrency Bugs in Go (TT, XL, LS, YZ), pp. 865–878.
CASE-2019-BhattKMSSG #design #nondeterminism: Concurrent Design of Tool-Paths and Impedance Controllers for Performing Area Coverage Operations in Manufacturing Applications under Uncertainty (PMB, AMK, RKM, AVS, BCS, SKG), pp. 1151–1156.
CC-2019-LiuHWCL0X #compilation #kernel #named #thread: PPOpenCL: a performance-portable OpenCL compiler with host and kernel thread code fusion (YL, LH, MW, HC, FL, XF0, JX), pp. 2–16.
CAV-2019-LauGMPS #c #named #semantics: Cerberus-BMC: A Principled Reference Semantics and Exploration Tool for Concurrent and Sequential C (SL, VBFG, KM, JPP, PS), pp. 387–397.
CAV-2019-EmmiE #generative #named #refinement #testing: Violat: Generating Tests of Observational Refinement for Concurrent Objects (ME, CE), pp. 534–546.
CAV-2019-ErnstM #logic #named #security: SecCSL: Security Concurrent Separation Logic (GE, TM), pp. 208–230.
CAV-2019-ZhaoS #memory management #reasoning: Rely-Guarantee Reasoning About Concurrent Memory Management in Zephyr RTOS (YZ, DS), pp. 515–533.
MSR-2018-GaoYJLYZ #dataset #named #testing: Jbench: a dataset of data races for concurrency testing (JG, XY, YJ0, HL0, WY, XZ), pp. 6–9.
SANER-2018-JolakLSC #interactive #modelling #multi #named #uml #visualisation: OctoBubbles: A Multi-view interactive environment for concurrent visualization and synchronization of UML models and code (RJ, KDL, KBS, MRVC), pp. 482–486.
SCAM-2018-SakuraiAG #detection #parallel #research: [Research Paper] POI: Skew-Aware Parallel Race Detection (YS, YA, KG), pp. 215–224.
FM-2018-AzadbakhtBV #detection: Deadlock Detection for Actor-Based Coroutines (KA, FSdB, EPdV), pp. 39–54.
FM-2018-HayesM #algebra #encoding: Encoding Fairness in a Synchronous Concurrent Program Algebra (IJH, LAM), pp. 222–239.
FM-2018-Laneve #analysis #lightweight #source code #thread: A Lightweight Deadlock Analysis for Programs with Threads and Reentrant Locks (CL), pp. 608–624.
FM-2018-ZhangZSLTLS #composition #reasoning #source code: Compositional Reasoning for Shared-Variable Concurrent Programs (FZ, YZ, DS, YL0, AT, SWL, JS0), pp. 523–541.
SEFM-2018-SchuppA #analysis #hybrid #multi #safety #thread: Spread the Work: Multi-threaded Safety Analysis for Hybrid Systems (SS, EÁ), pp. 89–104.
CIG-2018-HarmerGVHBOSN #3d #game studies #learning: Imitation Learning with Concurrent Actions in 3D Games (JH, LG, JdV, HH, JB, TO, KS, MN), pp. 1–8.
ICML-2018-DimakopoulouR #coordination #learning: Coordinated Exploration in Concurrent Reinforcement Learning (MD, BVR), pp. 1270–1278.
ECOOP-2018-NtzikPSG #file system #specification: A Concurrent Specification of POSIX File Systems (GN, PdRP, JS, PG), p. 28.
OOPSLA-2018-BlackshearGOS #composition #detection #named: RacerD: compositional static race detection (SB, NG, PWO, IS), p. 28.
OOPSLA-2018-KakiESJ #bound #replication #verification: Safe replication through bounded concurrency verification (GK, KE, KCS, SJ), p. 27.
OOPSLA-2018-KalhaugeP #predict: Sound deadlock prediction (CGK, JP), p. 29.
OOPSLA-2018-MathurK0 #detection #power of #predict #what: What happens-after the first race? enhancing the predictive power of happens-before based dynamic race detection (UM, DK, MV0), p. 29.
PLDI-2018-GuSKWKS0CR #abstraction: Certified concurrent abstraction layers (RG, ZS, JK, X(W, JK, VS, HC0, DC, TR), pp. 646–661.
PLDI-2018-LiuH #analysis #debugging #difference #named #parallel #performance: D4: fast concurrency debugging with parallel differential analysis (BL, JH0), pp. 359–373.
PLDI-2018-LiuW #analysis #bound #interprocedural #named #source code: CUBA: interprocedural Context-UnBounded Analysis of concurrent programs (PL, TW), pp. 105–119.
PLDI-2018-RoemerGB #bound #detection #predict: High-coverage, unbounded sound predictive race detection (JR, KG, MDB), pp. 374–389.
POPL-2018-EmmiE #monitoring: Sound, complete, and tractable linearizability monitoring for concurrent collections (ME, CE), p. 27.
POPL-2018-Kokologiannakis #c #c++ #effectiveness #model checking: Effective stateless model checking for C/C++ concurrency (MK, OL, KS, VV), p. 32.
POPL-2018-KrishnaSW #abstraction #composition #data type: Go with the flow: compositional abstractions for concurrent data structures (SK, DES, TW), p. 31.
POPL-2018-LiangF: Progress of concurrent objects with partial methods (HL, XF), p. 31.
POPL-2018-PulteFDFSS #axiom #modelling #multi: Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8 (CP, SF, WD, JF, SS, PS), p. 29.
PPDP-2018-Schmidt-Schauss #functional #parallel #programming language: Sequential and Parallel Improvements in a Concurrent Functional Programming Language (MSS, DS, ND), p. 13.
SAS-2018-OHearn #analysis #experience #facebook: Experience Developing and Deploying Concurrency Analysis at Facebook (PWO), pp. 56–70.
ASE-2018-BeyerF #independence #model checking #multi #thread: Domain-independent multi-threaded software model checking (DB, KF), pp. 634–644.
ASE-2018-LinWLSZW #data access #debugging #memory management #named: PFix: fixing concurrency bugs based on memory access patterns (HL, ZW, SL, JS0, DZ, GW), pp. 589–600.
ASE-2018-SungLEW #difference #scalability #semantics #source code: Datalog-based scalable semantic diffing of concurrent programs (CS, SKL, CE, CW0), pp. 656–666.
ASE-2018-TerragniP #challenge #effectiveness #generative #testing #thread: Effectiveness and challenges in generating concurrent tests for thread-safe classes (VT, MP), pp. 64–75.
ESEC-FSE-2018-AdamsenMAT #ajax #detection #javascript #web: Practical AJAX race detection for JavaScript web applications (CQA, AM, SA, FT), pp. 38–48.
ESEC-FSE-2018-Chen00M0 #parallel #source code #testing #thread: Testing multithreaded programs via thread speed control (DC, YJ0, CX0, XM, JL0), pp. 15–25.
ESEC-FSE-2018-KiniM0 #detection: Data race detection on compressed traces (DK, UM, MV0), pp. 26–37.
ESEC-FSE-2018-LuLL0 #debugging #in the cloud #named: CloudRaid: hunting concurrency bugs in the cloud via log-mining (JL, FL, LL0, XF0), pp. 3–14.
ESEC-FSE-2018-YiH #verification: Concurrency verification with maximal path causality (QY, JH0), pp. 366–376.
ASPLOS-2018-AlglaveMMPS #kernel #linux: Frightening Small Children and Disconcerting Grown-ups: Concurrency in the Linux Kernel (JA, LM, PEM, AP, ASS), pp. 405–418.
ASPLOS-2018-Ausavarungnirun #gpu #memory management #multi #named: MASK: Redesigning the GPU Memory Hierarchy to Support Multi-Application Concurrency (RA, VM, JL, SG, JG, AJ, CJR, OM), pp. 503–518.
ASPLOS-2018-DeLozierELD #named #thread: SOFRITAS: Serializable Ordering-Free Regions for Increasing Thread Atomicity Scalably (CD, AE, BL, JD), pp. 286–300.
CGO-2018-0003LJZW #debugging #distributed #graph #scalability: Scalable concurrency debugging with distributed graph processing (LZ0, XL, HJ0, JZ, QW), pp. 188–199.
ESOP-2018-AbdullaJT #abstraction #analysis: Fragment Abstraction for Concurrent Shape Analysis (PAA, BJ, CQT), pp. 442–471.
ESOP-2018-AguadoMPRH #approach #memory management: Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach (JA, MM, MP, PSR, RvH), pp. 86–113.
ESOP-2018-FrancoCDVW #correctness: Correctness of a Concurrent Object Collector for Actor Languages (JF, SC, SD, JV, TW), pp. 885–911.
ESOP-2018-GommerstadtJP #contract: Session-Typed Concurrent Contracts (HG, LJ, FP), pp. 771–798.
ESOP-2018-Hamin0 #monitoring: Deadlock-Free Monitors (JH, BJ0), pp. 415–441.
ESOP-2018-KappeB0Z #algebra: Concurrent Kleene Algebra: Free Model and Completeness (TK, PB, AS0, FZ), pp. 856–882.
CAV-2018-KraglQ #source code: Layered Concurrent Programs (BK, SQ), pp. 79–102.
CAV-2018-YuanYG #partial order: Partial Order Aware Concurrency Sampling (XY, JY, RG), pp. 317–335.
CSL-2018-AlcoleiCHW #theorem: The True Concurrency of Herbrand's Theorem (AA, PC, MH, GW), p. 22.
FSCD-2017-CastellanCW #abstraction: Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or (SC, PC, GW), p. 16.
FSCD-2017-Silva #theorem: Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk) (AS0), p. 1.
IFM-2017-BlomDHO #parallel #set #verification: The VerCors Tool Set: Verification of Parallel and Concurrent Software (SB, SD, MH, WO), pp. 102–110.
SEFM-2017-GeorgetJPTT #data flow #linux #memory management: Information Flow Tracking for Linux Handling Concurrent System Calls and Shared Memory (LG, MJ, GP, FT, VVTT), pp. 1–16.
Haskell-2017-ChenCN #adaptation #data type #haskell #implementation: Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swapping (CHC, VC, RRN), pp. 197–211.
CIKM-2017-HalderKS #health #recommendation #thread #topic #using: Health Forum Thread Recommendation Using an Interest Aware Topic Model (KH, MYK, KS), pp. 1589–1598.
ICMT-2017-TrollmannA #graph grammar #nondeterminism: Decision Points for Non-determinism in Concurrent Model Synchronization with Triple Graph Grammars (FT, SA), pp. 35–50.
ECOOP-2017-DelbiancoSNB #data type: Concurrent Data Structures Linked in Time (GAD, IS, AN, AB0), p. 30.
ECOOP-2017-HuangR #detection #performance #perspective #precise #what: What's the Optimal Performance of Precise Dynamic Race Detection? - A Redundancy Perspective (JH, AKR), p. 22.
OOPSLA-2017-AdamsenMT #detection #javascript #web: Practical initialization race detection for JavaScript web applications (CQA, AM, FT), p. 22.
OOPSLA-2017-CogumbreiroSMSV #parallel #source code #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-UgawaAM #garbage collection #memory management #model checking #modelling: Model checking copy phases of concurrent copying garbage collection with various memory models (TU, TA0, TM), p. 26.
OOPSLA-2017-WoodCBG #bias #detection: Instrumentation bias for dynamic data race detection (BPW, MC, MDB, DG), p. 31.
LOPSTR-2017-AlbertGI #detection #effectiveness #generative: Generation of Initial Contexts for Effective Deadlock Detection (EA, MGZ, MI), pp. 3–19.
LOPSTR-2017-LaneveG #bytecode #detection #java: Deadlock Detection of Java Bytecode (CL, AG), pp. 37–53.
PLDI-2017-RhodesFF #detection #named #static analysis: BigFoot: static check placement for dynamic race detection (DR, CF, SNF), pp. 141–156.
PLDI-2017-SanthiarK #c# #detection #source code: Static deadlock detection for asynchronous C# programs (AS, AK), pp. 292–305.
POPL-2017-FlurSPNMGSBS: Mixed-size concurrency: ARM, POWER, C/C++11, and SC (SF, SS, CP, KN, LM, KEG, AS, MB, PS), pp. 429–442.
POPL-2017-HoenickeMP #composition #thread #verification: Thread modularity at many levels: a pearl in compositional verification (JH, RM, AP), pp. 473–485.
POPL-2017-KangHLVD #semantics: A promising semantics for relaxed-memory concurrency (JK, CKH, OL, VV, DD), pp. 175–189.
POPL-2017-KrebbersTB #higher-order #interactive #logic #proving: Interactive proofs in higher-order concurrent separation logic (RK, AT, LB), pp. 205–217.
POPL-2017-Krogh-Jespersen #higher-order #logic #relational: A relational model of types-and-effects in higher-order concurrent separation logic (MKJ, KS, LB), pp. 218–231.
POPL-2017-LidburyD #detection: Dynamic race detection for C++11 (CL, AFD), pp. 443–457.
SAS-2017-BouajjaniEL #difference #evolution #semantics #source code: Abstract Semantic Diffing of Evolving Concurrent Programs (AB, CE, SKL), pp. 46–65.
ASE-2017-MetzlerSBS #scheduling #source code #verification: Quick verification of concurrent programs by iteratively relaxed scheduling (PM, HS, PB, NS), pp. 776–781.
ASE-2017-NguyenS0TP #parallel #source code: Parallel bug-finding in concurrent programs via reduced interleaving instances (TLN, PS, BF0, SLT, GP), pp. 753–764.
ASE-2017-WangDGGQYW #debugging: A comprehensive study on real world concurrency bugs in Node.js (JW, WD, YG, CG, FQ, KY, JW0), pp. 520–531.
ESEC-FSE-2017-BianchiPT: Reproducing concurrency failures from crash stacks (FAB, MP, VT), pp. 705–716.
ESEC-FSE-2017-GuoCY #detection #execution #named #thread: AtexRace: across thread and execution sampling for in-house race detection (YG, YC0, ZY), pp. 315–325.
ESEC-FSE-2017-YuZW #named: DESCRY: reproducing system-level concurrency failures (TY, TSZ, CW0), pp. 694–704.
ICSE-2017-ChoudharyLP #detection #generative #performance #safety #testing #thread: Efficient detection of thread safety violations via coverage-guided generation of concurrent tests (AC, SL, MP), pp. 266–277.
SLE-2017-OqvistH #attribute grammar: Concurrent circular reference attribute grammars (JÖ, GH), pp. 151–162.
ASPLOS-2017-CalciuSBA #architecture #black box #data type: Black-box Concurrent Data Structures for NUMA Architectures (IC, SS0, MB0, MKA), pp. 207–221.
ASPLOS-2017-LiuLLLLGT #automation #debugging #detection #distributed #named: DCatch: Automatically Detecting Distributed Concurrency Bugs in Cloud Systems (HL, GL, JFL, JL, SL, HSG, CT0), pp. 677–691.
ASPLOS-2017-ZhangJL #detection #named: ProRace: Practical Data Race Detection for Production Use (TZ, CJ, DL), pp. 149–162.
CC-2017-BiswasCZBW #detection #lightweight: Lightweight data race detection for production runs (SB, MC, MZ, MDB, BPW), pp. 11–21.
CGO-2017-ChakrabortyV #formal method #semantics: Formalizing the concurrency semantics of an LLVM fragment (SC, VV), pp. 100–110.
ESOP-2017-BouajjaniEEOT #robust #source code #verification: Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency (AB, ME, CE, BKO, ST), pp. 170–200.
ESOP-2017-Dinsdale-YoungP #automation #fine-grained #verification: Caper - Automatic Verification for Fine-Grained Concurrency (TDY, PdRP, KJA, LB), pp. 420–447.
ESOP-2017-DokoV: Tackling Real-Life Relaxed Concurrency with FSL++ (MD, VV), pp. 448–475.
ESOP-2017-Krebbers0BJDB #higher-order #logic: The Essence of Higher-Order Concurrent Separation Logic (RK, RJ0, AB, JHJ, DD, LB), pp. 696–723.
ESOP-2017-TassarottiJ0 #higher-order #logic #refinement: A Higher-Order Logic for Concurrent Termination-Preserving Refinement (JT, RJ0, RH0), pp. 909–936.
ESOP-2017-XiongPNG #specification: Abstract Specifications for Concurrent Maps (SX, PdRP, GN, PG), pp. 964–990.
CADE-2017-Andronick #reasoning: Reasoning About Concurrency in High-Assurance, High-Performance Software Systems (JA), pp. 1–7.
CAV-2017-WindsorDSP #lightweight #named #verification: Starling: Lightweight Concurrency Verification with Views (MW, MD, BS, MJP), pp. 544–569.
ICST-2017-ChanWSPS #analysis #fault #invariant #multi #named #source code #thread #using: IPA: Error Propagation Analysis of Multi-Threaded Programs Using Likely Invariants (AC, SW0, HS, KP, NS), pp. 184–195.
ICST-2017-DiasFFLSSV #contract #source code #using #verification: Verifying Concurrent Programs Using Contracts (RJD, CF0, JF, JML, AS, DGS, TV), pp. 196–206.
ICST-2017-XuLC #data type #debugging #testing #using: Using Delta Debugging to Minimize Stress Tests for Concurrent Data Structures (JX, YL, RHC), pp. 35–46.
VMCAI-2017-DSilvaKS #abstraction #independence #modelling: Independence Abstractions and Models of Concurrency (VD, DK, MS), pp. 151–168.
VMCAI-2017-FrumkinFLPSS #fault #proving #reachability: Property Directed Reachability for Proving Absence of Concurrent Modification Errors (AF, YMYF, OL, OP, MS, SS), pp. 209–227.
VMCAI-2017-GuntherLSW #model checking #reduction: Dynamic Reductions for Model Checking Concurrent Software (HG, AL, AS, GW), pp. 246–265.
VMCAI-2017-MonatM #abstract interpretation #abstraction #precise #relational #source code #thread #using: Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (RM, AM), pp. 386–404.
SCAM-2016-MingW #control flow #multi #named #performance #profiling #thread: BinCFP: Efficient Multi-threaded Binary Code Control Flow Profiling (JM0, DW), pp. 61–66.
FM-2016-BohmMJ #detection #reduction: State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI (SB, OM, PJ), pp. 102–118.
FM-2016-HolzerSBWW #fault #invariant: Error Invariants for Concurrent Traces (AH, DSN, MTB, GW, TW), pp. 370–387.
IFM-2016-AlbertGI #detection #static analysis #testing: Combining Static Analysis and Testing for Deadlock Detection (EA, MGZ, MI), pp. 409–424.
IFM-2016-NazarpourFBBC #component #monitoring #multi #thread: Monitoring Multi-threaded Component-Based Systems (HN, YF, SB, MB, JC), pp. 141–159.
IFM-2016-Owe #inheritance #object-oriented #reasoning #reuse #strict: Reasoning About Inheritance and Unrestricted Reuse in Object-Oriented Concurrent Systems (OO), pp. 210–225.
SEFM-2016-Agha #abstraction #analysis #modelling #problem #semantics #tool support: Abstractions, Semantic Models and Analysis Tools for Concurrent Systems: Progress and Open Problems - (Extended Abstract) (GA), pp. 3–8.
ICFP-2016-UenoO #functional #garbage collection #manycore #source code: A fully concurrent garbage collector for functional programs on multicore processors (KU, AO), pp. 421–433.
ECOOP-2016-CastegrenW: Reference Capabilities for Concurrency Control (EC, TW), p. 26.
OOPSLA-2016-HuangR #detection #precise: Precise and maximal race detection from incomplete traces (JH0, AKR), pp. 462–476.
OOPSLA-2016-NienhuisMS #semantics: An operational semantics for C/C++11 concurrency (KN, KM, PS), pp. 111–128.
OOPSLA-2016-SamakTR #synthesis: Directed synthesis of failing concurrent executions (MS, OT, MKR), pp. 430–446.
OOPSLA-2016-SergeyNBD #correctness #hoare #specification: Hoare-style specifications as correctness conditions for non-linearizable concurrent objects (IS, AN, AB0, GAD), pp. 92–110.
LOPSTR-2016-FalaschiGOP #constraints #slicing #source code: Slicing Concurrent Constraint Programs (MF, MG, CO, CP), pp. 76–93.
PLDI-2016-El-HassanyMBVV #analysis #named #network: SDNRacer: concurrency analysis for software-defined networks (AEH, JM, PB, LV, MTV), pp. 402–415.
POPL-2016-ChatterjeeGIP #algebra #algorithm #component #constant: Algorithms for algebraic path properties in concurrent systems of constant treewidth components (KC, AKG, RIJ, AP), pp. 733–747.
POPL-2016-FlurGPSSMDS #architecture #modelling: Modelling the ARMv8 architecture, operationally: concurrency and ISA (SF, KEG, CP, SS, AS, LM, WD, PS), pp. 608–621.
POPL-2016-LiangF #logic #scheduling: A program logic for concurrent objects under fair scheduling (HL, XF), pp. 385–399.
POPL-2016-Pichon-Pharabod #optimisation #semantics: A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions (JPP, PS), pp. 622–633.
PPDP-2016-AlbertAG #imperative #testing #using: Testing of concurrent and imperative software using CLP (EA, PA, MGZ), pp. 1–8.
PPDP-2016-Benton0N #source code: Effect-dependent transformations for concurrent programs (NB, MH0, VN), pp. 188–201.
ASE-2016-GuoKW #execution #incremental #named #symbolic computation: Conc-iSE: incremental symbolic execution of concurrent software (SG, MK, CW), pp. 531–542.
ASE-2016-KroeningPSW #analysis #thread: Sound static deadlock analysis for C/Pthreads (DK, DP, PS, BW), pp. 379–390.
ASE-2016-TangWWZ #android #debugging #generative #testing: Generating test cases to expose concurrency bugs in Android applications (HT, GW, JW, HZ), pp. 648–653.
ASE-2016-VojdaniARSVV #approach #detection: Static race detection for device drivers: the Goblint approach (VV, KA, VR, HS, VV, RV), pp. 391–402.
FSE-2016-CaiZCL #detection: A deployable sampling strategy for data race detection (YC0, JZ, LC, JL), pp. 810–821.
FSE-2016-LiuCL #comprehension #debugging #generative #quality: Understanding and generating high quality patches for concurrency bugs (HL, YC, SL), pp. 715–726.
FSE-2016-YogaNG #detection #parallel #source code: Parallel data race detection for task parallel programs with locks (AY, SN, AG), pp. 833–845.
FSE-2016-ZhanH #detection #ide #named: ECHO: instantaneous in situ race detection in the IDE (SZ, JH0), pp. 775–786.
ICSE-2016-Huang #analysis #scalability #thread: Scalable thread sharing analysis (JH0), pp. 1097–1108.
ICSE-2016-TerragniC #code generation: Coverage-driven test code generation for concurrent classes (VT, SCC), pp. 1121–1132.
ASPLOS-2016-Leesatapornwongsa #debugging #distributed #named #nondeterminism #taxonomy: TaxDC: A Taxonomy of Non-Deterministic Concurrency Bugs in Datacenter Distributed Systems (TL, JFL, SL, HSG), pp. 517–530.
ASPLOS-2016-ZhangLJ #detection #hardware #memory management #named #performance #transaction #using: TxRace: Efficient Data Race Detection Using Commodity Hardware Transactional Memory (TZ, DL, CJ), pp. 159–173.
CASE-2016-CampbellTLPOF #approach #configuration management #modelling #π-calculus: Modeling concurrency and reconfiguration in vehicular systems: A π-calculus approach (JC, CET, PL0, TPP, ÜÖ, GEF), pp. 523–530.
CASE-2016-ReveliotisF #resource management #robust: Robust deadlock avoidance for sequential resource allocation systems with resource outages (SAR, ZF), pp. 864–871.
CC-2016-AlbertGI #named #testing: SYCO: a systematic testing tool for concurrent objects (EA, MGZ, MI), pp. 269–270.
CC-2016-CaoV #memory management #thread: Reducing memory buffering overhead in software thread-level speculation (ZC, CV), pp. 12–22.
CC-2016-HammacherSZH #kernel #thread: Thread-level speculation with kernel support (CH, KS, AZ, SH), pp. 1–11.
CC-2016-NgY #detection #graph #synthesis: Static deadlock detection for concurrent go by global session graph synthesis (NN, NY), pp. 174–184.
CGO-2016-ChakrabortyV #c #c++ #optimisation #source code #validation: Validating optimizations of concurrent C/C++ programs (SC, VV), pp. 216–226.
ESOP-2016-Garnock-JonesF #coordination #programming: Coordinated Concurrent Programming in Syndicate (TGJ, MF), pp. 310–336.
ESOP-2016-PintoDGS #composition #termination #verification: Modular Termination Verification for Non-blocking Concurrency (PdRP, TDY, PG, JS), pp. 176–201.
FASE-2016-CorrodiHP #graph #semantics #source code: A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs (CC, AH, CMP), pp. 31–48.
CSL-2016-Berger #nondeterminism #source code: Extracting Non-Deterministic Concurrent Programs (UB0), p. 21.
ICST-2016-Bianchi #testing: Testing Concurrent Software Systems (FAB), pp. 375–376.
ICST-2016-YuWHH #predict #source code #testing: Predicting Testability of Concurrent Programs (TY, WW, XH, JHH), pp. 168–179.
VMCAI-2016-ChakiK #model checking #multi #thread: Model Checking with Multi-threaded IC3 Portfolios (SC, DK), pp. 517–535.
VMCAI-2016-Holzmann #verification: Cloud-Based Verification of Concurrent Software (GJH), pp. 311–327.
SIGMOD-2015-0001MK #database #in memory #multi #performance: Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems (TN, TM, AK), pp. 677–689.
SIGMOD-2015-BailisFFGHS #empirical: Feral Concurrency Control: An Empirical Investigation of Modern Application Integrity (PB, AF, MJF, AG, JMH, IS), pp. 1327–1342.
SIGMOD-2015-BernsteinDDP #database #optimisation: Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases (PAB, SD, BD, MP), pp. 1295–1309.
VLDB-2015-FaleiroA #multi: Rethinking serializable multiversion concurrency control (JMF, DJA), pp. 1190–1201.
VLDB-2015-LevandoskiLSS0 #multi: Multi-Version Range Concurrency Control in Deuteronomy (JJL, DBL, SS, RS, RW), pp. 2146–2157.
VLDB-2015-PsaroudakisSMSA #adaptation #in memory #scalability #towards: Scaling Up Concurrent Main-Memory Column-Store Scans: Towards Adaptive NUMA-aware Data and Task Placement (IP, TS, NM, AS, AA), pp. 1442–1453.
ICSME-2015-PoluriR #detection: Deterministic dynamic race detection across program versions (SVP, MKR), pp. 181–190.
CIAA-2015-Bollig #automaton #logic #modelling: Automata and Logics for Concurrent Systems: Five Models in Five Pages (BB), pp. 3–12.
FM-2015-AlbertACGGMPR #analysis #distributed #source code: Resource Analysis: From Sequential to Concurrent and Distributed Programs (EA, PA, JC, SG, MGZ, EMM, GP, GRD), pp. 3–17.
SEFM-2015-BlomHZ #behaviour #functional #source code #verification: History-Based Verification of Functional Behaviour of Concurrent Programs (SB, MH, MZS), pp. 84–98.
Haskell-2015-WalkerR #haskell #library #testing: Déjà Fu: a concurrency testing library for Haskell (MW0, CR), pp. 141–152.
GaM-2015-HeussnerPCM #graph #object-oriented #towards #verification: Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model (AH, CMP, CC, BM), pp. 32–47.
ICEIS-v1-2015-RezendeJ #process #using #workflow: Deadlock Avoidance in Interorganizational Business Processes using a Possibilistic WorkFlow Net (LPdR, SJ), pp. 429–439.
ECIR-2015-BiyaniBCM #analysis #online #retrieval #thread #using: Using Subjectivity Analysis to Improve Thread Retrieval in Online Forums (PB, SB, CC, PM), pp. 495–500.
MoDELS-2015-PrzigodaHWPD #behaviour #modelling #ocl #uml: Checking concurrent behavior in UML/OCL models (NP, CH, RW, JP, RD), pp. 176–185.
ECOOP-2015-DongolDGS #architecture #correctness #manycore: Defining Correctness Conditions for Concurrent Objects in Multicore Architectures (BD, JD, LG, GS), pp. 470–494.
OOPSLA-2015-BielikRV #android #detection #scalability: Scalable race detection for Android applications (PB, VR, MTV), pp. 332–348.
OOPSLA-2015-UpadhyayaR #abstraction #effectiveness #java #message passing #thread #virtual machine: Effectively mapping linguistic abstractions for message-passing concurrency to threads on the Java virtual machine (GU, HR), pp. 840–859.
PLATEAU-2015-PintoTC #case study #programming: A study on the most popular questions about concurrent programming (GP0, WT, FC), pp. 39–46.
PEPM-2015-LeCT #thread #verification: Threads as Resource for Concurrency Verification (DKL, WNC, YMT), pp. 73–84.
PEPM-2015-LiT #slicing: Safe Concurrency Introduction through Slicing (HL, SJT), pp. 103–113.
PLDI-2015-Huang #model checking #reduction #source code: Stateless model checking concurrent programs with maximal causality reduction (JH), pp. 165–174.
PLDI-2015-MachadoLR #debugging #difference: Concurrency debugging with differential schedule projections (NM, BL, LETR), pp. 586–595.
PLDI-2015-SergeyNB #fine-grained #source code #verification: Mechanized verification of fine-grained concurrent programs (IS, AN, AB), pp. 77–87.
PLDI-2015-ZivAGRS: Composing concurrency control (OZ, AA, GGG, GR, MS), pp. 240–249.
POPL-2015-BouajjaniEEH #refinement: Tractable Refinement Checking for Concurrent Objects (AB, ME, CE, JH), pp. 651–662.
POPL-2015-GuptaHRST #representation #set: Succinct Representation of Concurrent Trace Sets (AG, TAH, AR, RS, TT), pp. 433–444.
POPL-2015-HeGWZ #automaton #composition #probability #reasoning: Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems (FH, XG, BYW, LZ), pp. 503–514.
POPL-2015-JungSSSTBD #invariant #monad #named #orthogonal #reasoning: Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning (RJ, DS, FS, KS, AT, LB, DD), pp. 637–650.
PPDP-2015-CanoRLP #declarative: Declarative interpretations of session-based concurrency (MC, CR, HAL, JAP), pp. 67–78.
PPDP-2015-GrandeBS #library #thread: Jthread, a deadlock-free mutex library (JG, GB, MS), pp. 149–160.
PPDP-2015-HaarPRV #algebra #logic: An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic (SH, SP, CR, FDV), pp. 161–172.
PPDP-2015-StievenartNMR #abstract interpretation #debugging #detection #higher-order #source code: Detecting concurrency bugs in higher-order programs through abstract interpretation (QS, JN, WDM, CDR), pp. 232–243.
ASE-2015-DeligiannisDR #analysis #debugging #performance #precise: Fast and Precise Symbolic Analysis of Concurrency Bugs in Device Drivers (T) (PD, AFD, ZR), pp. 166–177.
ASE-2015-InversoN0TP #bound #model checking #multi #named #thread: Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs (OI, TLN, BF, SLT, GP), pp. 807–812.
ASE-2015-LinMZCZ #benchmark #debugging #java #metric #named: JaConTeBe: A Benchmark Suite of Real-World Java Concurrency Bugs (T) (ZL, DM, HZ, YC, JZ), pp. 178–189.
ASE-2015-Okur #c# #comprehension #refactoring: Understanding, Refactoring, and Fixing Concurrency in C# (SO), pp. 898–901.
ASE-2015-WilcoxFFF #array #detection #precise: Array Shadow State Compression for Precise Dynamic Race Detection (T) (JRW, PF, CF, SNF), pp. 155–165.
ESEC-FSE-2015-GuJSZL #thread #what: What change history tells us about thread synchronization (RG, GJ, LS, LZ, SL), pp. 426–438.
ESEC-FSE-2015-RajagopalanH #detection #named: RDIT: race detection from incomplete traces (AKR, JH), pp. 914–917.
ESEC-FSE-2015-WestNM #object-oriented #performance: Efficient and reasonable object-oriented concurrency (SW, SN, BM), pp. 734–744.
ESEC-FSE-2015-Yu #named #source code #testing: TACO: test suite augmentation for concurrent programs (TY), pp. 918–921.
ICSE-v1-2015-HuangLR #analysis #named #predict: GPredict: Generic Predictive Concurrency Analysis (JH, QL, GR), pp. 847–857.
ICSE-v1-2015-TerragniCZ #effectiveness #named #source code #testing: RECONTEST: Effective Regression Testing of Concurrent Programs (VT, SCC, CZ), pp. 246–256.
ICSE-v1-2015-YuanWWLYHFLCG #debugging #named #using: ReCBuLC: Reproducing Concurrency Bugs Using Local Clocks (XY, CW, ZW, JL, PCY, JH, XF, YL, YC, YG), pp. 824–834.
ICSE-v2-2015-ShinRM #education #re-engineering: Concurrent Software Engineering and Robotics Education (JS, AR, BM), pp. 370–379.
SAC-2015-DabrowskiLP #compilation #thread: Nested atomic sections with thread escape: compilation (FD, FL, TP), pp. 2099–2106.
SAC-2015-Homm0G #markov #modelling #statistics #testing: Concurrent streams in Markov chain usage models for statistical testing of complex systems (DH, JE, RG), pp. 1803–1807.
SLE-2015-LatombeCCDP #domain-specific language #execution #modelling #weaving: Weaving concurrency in executable domain-specific modeling languages (FL, XC, BC, JD, MP), pp. 125–136.
ASPLOS-2015-AlglaveBDGKPSW #behaviour #gpu #programming: GPU Concurrency: Weak Behaviours and Programming Assumptions (JA, MB, AFD, GG, JK, DP, TS, JW), pp. 577–591.
ASPLOS-2015-DavidGT #data type #scalability: Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures (TD, RG, VT), pp. 631–644.
CASE-2015-ShellshearCBT #algorithm #multi #problem #thread: A multi-threaded memetic packing algorithm for the ISO luggage packing problem (ES, JSC, RB, ST), pp. 1509–1514.
CASE-2015-WangSH: A three-stage deadlock prevention strategy for S3PR nets (SW, CS, LH), pp. 286–291.
CGO-2015-JiaoLHM #energy #execution #kernel: Improving GPGPU energy-efficiency through concurrent kernel execution and DVFS (QJ, ML, HPH, TM), pp. 1–11.
CGO-2015-KimHSLH #architecture #cpu #modelling #programming #scheduling #thread: Locality-centric thread scheduling for bulk-synchronous programming models on CPU architectures (HSK, IEH, JAS, SSL, WmWH), pp. 257–268.
CGO-2015-LuciaC #source code: Data provenance tracking for concurrent programs (BL, LC), pp. 146–156.
CGO-2015-ShresthaGMMF #locality: Locality aware concurrent start for stencil applications (SS, GRG, JM, AM, JF), pp. 157–166.
DATE-2015-DeAntoniDTCC #domain-specific language #metalanguage #towards: Towards a meta-language for the concurrency concern in DSLs (JD, PID, CT, JC, BC), pp. 313–316.
DATE-2015-RawatS #architecture #hybrid #manycore #memory management #thread: Enabling multi-threaded applications on hybrid shared memory manycore architectures (TR, AS), pp. 742–747.
HPDC-2015-AkiyamaT #scalability #thread: Uni-Address Threads: Scalable Thread Management for RDMA-Based Work Stealing (SA, KT), pp. 15–26.
ISMM-2015-OsterlundL #protocol #using: Concurrent compaction using a field pinning protocol (EÖ, WL), pp. 56–69.
PDP-2015-EvrardL #automation #code generation #distributed #formal method #modelling #process: Automatic Distributed Code Generation from Formal Models of Asynchronous Concurrent Processes (HE, FL), pp. 459–466.
PDP-2015-FilipponeSDSMT #simulation #thread: CUDA Dynamic Active Thread List Strategy to Accelerate Debris Flow Simulations (GF, WS, DD, DS, DM, GAT), pp. 316–320.
PDP-2015-SoaresRS #logic #semantics: Revisiting Concurrent Separation Logic and Operational Semantics (PS, AR, SMdS), pp. 484–491.
PDP-2015-ThomanGF #implementation #library #on the #quality #thread: On the Quality of Implementation of the C++11 Thread Support Library (PT, PG, TF), pp. 94–98.
PPoPP-2015-ArbelM #scalability: Predicate RCU: an RCU for scalable concurrent updates (MA, AM), pp. 21–30.
PPoPP-2015-ChangG #algorithm #parallel: A parallel algorithm for global states enumeration in concurrent systems (YJC, VKG), pp. 140–149.
PPoPP-2015-CogumbreiroHMY #verification: Dynamic deadlock verification for general barrier synchronisation (TC, RH, FM, NY), pp. 150–160.
PPoPP-2015-DasSR #communication #detection #program analysis #thread: Section based program analysis to reduce overhead of detecting unsynchronized thread communication (MD, GS, JR), pp. 283–284.
PPoPP-2015-Gramoli #algorithm #impact analysis: More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms (VG), pp. 1–10.
PPoPP-2015-RamachandranM #named #performance #using: CASTLE: fast concurrent internal binary search tree using edge-based locking (AR, NM), pp. 281–282.
PPoPP-2015-SaillardCB #multi #thread #validation: Static/Dynamic validation of MPI collective communications in multi-threaded context (ES, PC, DB), pp. 279–280.
PPoPP-2015-ThomsonD #lazy evaluation #partial order #reduction #testing: The lazy happens-before relation: better partial-order reduction for systematic concurrency testing (PT, AFD), pp. 259–260.
PPoPP-2015-WestNM #object-oriented #performance: Efficient and reasonable object-oriented concurrency (SW, SN, BM), pp. 273–274.
SOSP-2015-MatveevSFM #lightweight #named #programming: Read-log-update: a lightweight synchronization mechanism for concurrent programming (AM, NS, PF, PM), pp. 168–183.
SOSP-2015-XieSLAK0 #composition: High-performance ACID via modular concurrency control (CX, CS, CL, LA, MK, YW), pp. 279–294.
ESOP-2015-BattyMNPS #problem #programming language #semantics: The Problem of Programming Language Concurrency Semantics (MB, KM, KN, JPP, PS), pp. 283–307.
ESOP-2015-RaadVG #logic #named: CoLoSL: Concurrent Local Subjective Logic (AR, JV, PG), pp. 710–735.
ESOP-2015-SergeyNB #algorithm #specification #verification: Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity (IS, AN, AB), pp. 333–358.
TACAS-2015-BloemCJK #source code #synthesis: Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information (RB, KC, SJ, RK), pp. 517–532.
TACAS-2015-TomascoI0TP15a #memory management #source code #verification: Verifying Concurrent Programs by Memory Unwinding (ET, OI, BF, SLT, GP), pp. 551–565.
CADE-2015-DinBH #deduction #modelling #named #verification: KeY-ABS: A Deductive Verification Tool for the Concurrent Modelling Language ABS (CCD, RB, RH), pp. 517–526.
CAV-2015-HawblitzelPQT #automation #composition #reasoning #refinement #source code: Automated and Modular Refinement Reasoning for Concurrent Programs (CH, EP, SQ, ST), pp. 449–465.
ICST-2015-FarzanHV #execution #testing: Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution (AF, AH, HV), pp. 1–11.
ISSTA-2015-KhoshnoodKW #constraints #debugging #named #theorem proving: ConcBugAssist: constraint solving for diagnosis and repair of concurrency bugs (SK, MK, CW), pp. 165–176.
ISSTA-2015-Narayanaswamy #performance: When truth is efficient: analysing concurrency (GN), pp. 141–152.
TAP-2015-AthanasiouLS #generative #testing #using: Test Case Generation for Concurrent Systems Using Event Structures (KA, HPdL, SS), pp. 19–37.
QoSA-2014-MzidMBA #design pattern #modelling #named #realtime: SRMP: a software pattern for deadlocks prevention inreal-time concurrency models (RM, CM, JPB, MA), pp. 139–144.
SIGMOD-2014-PsaroudakisAOA #query: Reactive and proactive sharing across concurrent analytical queries (IP, MA, MO, AA), pp. 889–892.
VLDB-2014-SadoghiCBNR #database #multi: Reducing Database Locking Contention Through Multi-version Concurrency (MS, MC, BB, FN, KAR), pp. 1331–1342.
VLDB-2014-WangZYMLD0 #query: Concurrent Analytical Query Processing with GPUs (KW, KZ, YY, SM, RL, XD, XZ), pp. 1011–1022.
VLDB-2015-YuBPDS14 #evaluation: Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores (XY, GB, AP, SD, MS), pp. 209–220.
EDM-2014-YangPHR #online #recommendation #thread: Forum Thread Recommendation for Massive Open Online Courses (DY, MP, IKH, CPR), pp. 257–260.
ICSME-2014-LiuQWM #debugging #named #precise: Pinso: Precise Isolation of Concurrency Bugs via Delta Triaging (BL, ZQ, BW, RM), pp. 201–210.
ICSME-2014-TaoQ #analysis #java #refactoring #source code: Refactoring Java Concurrent Programs Based on Synchronization Requirement Analysis (BT, JQ), pp. 361–370.
SCAM-2014-HutchinsBS #analysis #c #c++ #safety #thread: C/C++ Thread Safety Analysis (DH, AB, DS), pp. 41–46.
FM-2014-AntoninoSW #analysis #csp #network #process #refinement: A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes (PRGA, AS, JW), pp. 62–77.
FM-2014-ArmstrongGS #algebra #tool support #verification: Algebraic Principles for Rely-Guarantee Style Concurrency Verification Tools (AA, VBFG, GS), pp. 78–93.
FM-2014-BlomH #source code #verification: The VerCors Tool for Verification of Concurrent Programs (SB, MH), pp. 127–131.
FM-2014-LinH #composition #learning #model checking #synthesis: Compositional Synthesis of Concurrent Systems through Causal Model Checking and Learning (SWL, PAH), pp. 416–431.
RTA-TLCA-2014-Schmidt-Schauss #analysis #programming language #semantics: Concurrent Programming Languages and Methods for Semantic Analyses (MSS), pp. 21–30.
SEFM-2014-PunSS #behaviour: Effect-Polymorphic Behaviour Inference for Deadlock Checking (KIP, MS, VS), pp. 50–64.
SFM-2014-AlbertAGR #concept #execution #generative #symbolic computation #testing: Test Case Generation by Symbolic Execution: Basic Concepts, a CLP-Based Instance, and Actor-Based Concurrency (EA, PA, MGZ, JMR), pp. 263–309.
SFM-2014-AmighiBDHMZ #verification: Verification of Concurrent Systems with VerCors (AA, SB, SD, MH, WM, MZS), pp. 172–216.
SFM-2014-GiachinoL #detection #linear #recursion #source code: Deadlock Detection in Linear Recursive Programs (EG, CL), pp. 26–64.
ICFP-2014-MarlowBCP #abstraction #data access #performance: There is no fork: an abstraction for efficient, concurrent, and concise data access (SM, LB, JC, JP), pp. 325–337.
ICFP-2014-SchlesingerGW #pipes and filters #policy: Concurrent NetCore: from policies to pipelines (CS, MG, DW), pp. 11–24.
ICEIS-v2-2014-PfisterHN #agile #design #diagrams #framework #metamodelling #modelling #synthesis #towards #visual notation: A Framework for Concurrent Design of Metamodels and Diagrams — Towards an Agile Method for the Synthesis of Domain Specific Graphical Modeling Languages (FP, MH, CN), pp. 298–306.
ICEIS-v2-2014-SarmientoLRS #approach #automation #generative #requirements #testing: An Automated Approach of Test Case Generation for Concurrent Systems from Requirements Descriptions (ES, JCSdPL, NR, AvS), pp. 339–347.
KR-2014-GutierrezHW #reasoning: Reasoning about Equilibria in Game-Like Concurrent Systems (JG, PH, MW).
MLDM-2014-WangLK #data mining #mining: Applications of Concurrent Sequential Patterns in Protein Data Mining (CW, JL, MK), pp. 243–257.
AMT-2014-ZhangBBEHKW #code generation #java #state machine #towards: Towards Verified Java Code Generation from Concurrent State Machines (DZ, DB, MvdB, LE, CH, RK, AW), pp. 64–69.
ECOOP-2014-GramoliG #data type #reuse: Reusable Concurrent Data Types (VG, RG), pp. 182–206.
ECOOP-2014-LeeKZ #execution #multi: Infrastructure-Free Logging and Replay of Concurrent Execution on Multiple Cores (KHL, DK, XZ), pp. 232–256.
ECOOP-2014-MillerHO #named #type system: Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution (HM, PH, MO), pp. 308–333.
OOPSLA-2014-PintoCL #behaviour #comprehension #energy #thread: Understanding energy behaviors of thread management constructs (GP, FC, YDL), pp. 345–360.
OOPSLA-2014-SamakR #detection #parallel #synthesis #thread: Multithreaded test synthesis for deadlock detection (MS, MKR), pp. 473–489.
PLATEAU-2014-SadowskiY #detection #developer #how #tool support: How Developers Use Data Race Detection Tools (CS, JY), pp. 43–51.
PLDI-2014-DimitrovRVK #commutative #detection: Commutativity race detection (DD, VR, MTV, EK), p. 33.
PLDI-2014-Hoare #programming: Laws of concurrent programming (CARH), p. 20.
PLDI-2014-HsiaoPYPNCKF #detection #mobile: Race detection for event-driven mobile applications (CHH, CP, JY, GP, SN, PMC, ZK, JF), p. 35.
PLDI-2014-HuangMR #abstraction #control flow #detection #predict: Maximal sound predictive race detection with control flow abstraction (JH, POM, GR), p. 36.
PLDI-2014-MaiyaKM #android #detection: Race detection for Android applications (PM, AK, RM), p. 34.
PLDI-2014-Misra: A personal perspective on concurrency (JM), p. 41.
POPL-2014-Birkedal #composition #higher-order #imperative #reasoning #source code: Modular reasoning about concurrent higher-order imperative programs (LB), pp. 1–2.
ASE-2014-OsterlundL #component #using: Concurrent transformation components using contention context sensors (EÖ, WL), pp. 223–234.
ASE-2014-WangWWYSYLFG #debugging #locality #memory management #using: Localization of concurrency bugs using shared memory access pairs (WW, ZW, CW, PCY, XS, XY, JL, XF, YG), pp. 611–622.
FSE-2014-0010TZ #debugging #named: Grail: context-aware fixing of concurrency bugs (PL, OT, CZ), pp. 318–329.
FSE-2014-EslamimehrP #detection #named #scalability #source code: Sherlock: scalable deadlock detection for concurrent programs (ME, JP), pp. 353–365.
FSE-2014-LinRD #android #refactoring: Retrofitting concurrency for Android applications through refactoring (YL, CR, DD), pp. 341–352.
FSE-2014-SamakR #detection #java #library #parallel #precise #thread: Omen+: a precise dynamic deadlock detector for multithreaded Java libraries (MS, MKR), pp. 735–738.
FSE-2014-ZhangWLQRZ #debugging #lightweight #named: AI: a lightweight system for tolerating concurrency bugs (MZ, YW, SL, SQ, JR, WZ), pp. 330–340.
ICSE-2014-BeschastnikhBEK #behaviour #modelling: Inferring models of concurrent systems from logs of their behavior with CSight (IB, YB, MDE, AK), pp. 468–479.
ICSE-2014-JiangGXML #java #named #source code: CARE: cache guided deterministic replay for concurrent Java programs (YJ, TG, CX, XM, JL), pp. 457–467.
SAC-2014-DabrowskiLP #thread: Nested atomic sections with thread escape: a formal definition (FD, FL, TP), pp. 1585–1592.
ASPLOS-2014-EyermanE #flexibility #manycore #parallel #smt #thread #towards: The benefit of SMT in the multi-core era: flexibility towards degrees of thread-level parallelism (SE, LE), pp. 591–606.
CASE-2014-AfaghaniA #online: Advanced-collision-map-based on-line collision and deadlock avoidance between two robot manipulators with PTP commands (AYA, YA), pp. 1244–1251.
DATE-2014-ChenWP #capacity #distributed #framework: Concurrent placement, capacity provisioning, and request flow control for a distributed cloud infrastructure (SC, YW, MP), pp. 1–6.
DATE-2014-JunsangsriLH #detection #hybrid: A hybrid non-volatile SRAM cell with concurrent SEU detection and correction (PJ, FL, JH), pp. 1–4.
DATE-2014-MurilloWCLA #automation #constraints #debugging #detection: Automatic detection of concurrency bugs through event ordering constraints (LGM, SW, JC, RL, GA), pp. 1–6.
DATE-2014-PandaB #thread: Introducing Thread Criticality awareness in Prefetcher Aggressiveness Control (BP, SB), pp. 1–6.
HPCA-2014-HuangHFS #data transformation #detection #metadata #runtime: Low-overhead and high coverage run-time race detection through selective meta-data management (RCH, EH, AF, GES), pp. 96–107.
HPCA-2014-LeeSMKSCR #resource management #scheduling #thread: Improving GPGPU resource utilization through alternative thread block scheduling (ML, SS, JM, JK, WS, YGC, SR), pp. 260–271.
HPCA-2014-LiuXGZC #consistency #hardware #memory management #transaction #virtual machine: Concurrent and consistent virtual machine introspection with hardware transactional memory (YL, YX, HG, BZ, HC), pp. 416–427.
HPCA-2014-WangDDS #memory management #multi #named #predict #source code #thread: DraMon: Predicting memory bandwidth usage of multi-threaded programs with high accuracy and low overhead (WW, TD, JWD, MLS), pp. 380–391.
HPDC-2014-XueYQHD #graph #low cost #named #performance: Seraph: an efficient, low-cost system for concurrent graph processing (JX, ZY, ZQ, SH, YD), pp. 227–238.
ISMM-2014-BrandtKSB #garbage collection #linear #parallel: Concurrent, parallel garbage collection in linear time (SRB, HK, GS, CB), pp. 47–58.
LCTES-2014-KimBL #garbage collection #javascript #lightweight: Lightweight and block-level concurrent sweeping for javascript garbage collection (HK, SB, JL), pp. 155–164.
OSDI-2014-0001RB #debugging #kernel #named: SKI: Exposing Kernel Concurrency Bugs through Systematic Schedule Exploration (PF, RR, BBB), pp. 415–431.
OSDI-2014-MuCZLL #distributed #transaction: Extracting More Concurrency from Distributed Transactions (SM, YC, YZ, WL, JL), pp. 479–494.
PDP-2014-AraujoGRM #evaluation #lazy evaluation: Afluentes Concurrent I/O Made Easy with Lazy Evaluation (SMdA, KSdG, NSR, SRdLM), pp. 279–287.
PDP-2014-Hadim #communication #multi #network #performance: The Multi-level Communication: Minimal Deadlock-Free and Storage Efficient Routing for Torus Networks (MBH), pp. 44–51.
PDP-2014-Misale #approach #memory management: Accelerating Bowtie2 with a lock-less concurrency approach and memory affinity (CM), pp. 578–585.
PDP-2014-RughettiSCQ #feature model: Dynamic Feature Selection for Machine-Learning Based Concurrency Regulation in STM (DR, PdS, BC, FQ), pp. 68–75.
PPoPP-2014-DrachslerVY #logic: Practical concurrent binary search trees via logical ordering (DD, MTV, EY), pp. 343–356.
PPoPP-2014-EslamimehrP #scheduling #source code: Race directed scheduling of concurrent programs (ME, JP), pp. 301–314.
PPoPP-2014-LeeKZ #execution #multi: Infrastructure-free logging and replay of concurrent execution on multiple cores (KHL, DK, XZ), pp. 371–372.
PPoPP-2014-NatarajanM #performance: Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.
PPoPP-2014-PetrovicRS #hardware #message passing #performance #thread: Leveraging hardware message passing for efficient thread synchronization (DP, TR, AS), pp. 143–154.
PPoPP-2014-PusukuriGB #thread: Lock contention aware thread migrations (KKP, RG, LNB), pp. 369–370.
PPoPP-2014-SamakR #detection: Trace driven dynamic deadlock detection and reproduction (MS, MKR), pp. 29–42.
PPoPP-2014-ThomsonDB #bound #empirical #testing #using: Concurrency testing using schedule bounding: an empirical study (PT, AFD, AB), pp. 15–28.
PPoPP-2014-WangWYYWL0 #debugging #locality #memory management #using: Concurrency bug localization using shared memory access pairs (WW, CW, PCY, XY, ZW, JL, XF), pp. 375–376.
PPoPP-2014-YangZ #named #parallel #thread: CUDA-NP: realizing nested thread-level parallelism in GPGPU applications (YY, HZ), pp. 93–106.
ESOP-2014-AguadoMHF #programming: Grounding Synchronous Deterministic Concurrency in Sequential Programming (JA, MM, RvH, IF), pp. 229–248.
ESOP-2014-NanevskiLSD #communication #fine-grained: Communicating State Transition Systems for Fine-Grained Concurrent Resources (AN, RLW, IS, GAD), pp. 290–310.
ESOP-2014-SvendsenB: Impredicative Concurrent Abstract Predicates (KS, LB), pp. 149–168.
FASE-2014-Zaharieva-StojanovskiH #invariant #source code #verification: Verifying Class Invariants in Concurrent Programs (MZS, MH), pp. 230–245.
FoSSaCS-2014-EsparzaD #on the: On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations (JE, JD), pp. 258–273.
STOC-2014-AlistarhCS #algorithm #question: Are lock-free concurrent algorithms practically wait-free? (DA, KCH, NS), pp. 714–723.
TACAS-2014-AlbertAFGGMPR #named: SACO: Static Analyzer for Concurrent Objects (EA, PA, AFM, SG, MGZ, EMM, GP, GRD), pp. 562–567.
TACAS-2014-Ardeshir-LarijaniGN #equivalence #protocol #quantum #verification: Verification of Concurrent Quantum Protocols by Equivalence Checking (EAL, SJG, RN), pp. 500–514.
TACAS-2014-Lowe #algorithm: Concurrent Depth-First Search Algorithms (GL), pp. 202–216.
WRLA-2014-AlrahmanABL #maude #memory management #modelling #question #source code: Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? (YAA, MA, AB, ALL), pp. 21–41.
CAV-2014-CernyHRRT #synthesis: Regression-Free Synthesis for Concurrency (PC, TAH, AR, LR, TT), pp. 568–584.
CAV-2014-InversoT0TP #bound #c #lazy evaluation #model checking #multi #source code #thread: Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization (OI, ET, BF, SLT, GP), pp. 585–602.
CAV-2014-KupriyanovF #multi #source code #termination #thread: Causal Termination of Multi-threaded Programs (AK, BF), pp. 814–830.
CAV-2014-LesaniMP #automation #data type #verification: Automatic Atomicity Verification for Clients of Concurrent Data Structures (ML, TDM, JP), pp. 550–567.
CAV-2014-SanchezS #data type #named #verification: LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes (AS, CS), pp. 620–627.
ICLP-J-2014-CruzRGP #graph #linear #logic programming #programming language: A Linear Logic Programming Language for Concurrent Programming over Graph Structures (FC, RR, SCG, FP), pp. 493–507.
ICLP-J-2014-PimentelON #constraints #programming #proving: A Proof Theoretic Study of Soft Concurrent Constraint Programming (EP, CO, VN), pp. 649–663.
ICST-2014-HongPK #detection #fault #java #web: Detecting Concurrency Errors in Client-Side Java Script Web Applications (SH, YP, MK), pp. 61–70.
ICST-2014-WojciakT #case study #combinator #maintenance #testing: System Level Combinatorial Testing in Practice — The Concurrent Maintenance Case Study (PW, RTB), pp. 103–112.
ISSTA-2014-LinK #automation #multi #satisfiability #source code #thread #using: Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability (YL, SSK), pp. 237–247.
ISSTA-2014-PradelHG #performance #testing: Performance regression testing of concurrent classes (MP, MH, TRG), pp. 13–25.
ISSTA-2014-ZhangW #parallel #runtime #thread: Runtime prevention of concurrency related type-state violations in multithreaded applications (LZ, CW), pp. 1–12.
LICS-CSL-2014-CastellanCW #game studies #symmetry: Symmetry in concurrent games (SC, PC, GW), p. 10.
LICS-CSL-2014-GutierrezW #game studies: Equilibria of concurrent games on event structures (JG, MW), p. 10.
LICS-CSL-2014-LiangFS #composition #refinement #source code #verification: Compositional verification of termination-preserving refinement of concurrent programs (HL, XF, ZS), p. 10.
LICS-CSL-2014-Padovani #linear #π-calculus: Deadlock and lock freedom in the linear π-calculus (LP), p. 10.
VMCAI-2014-WangH #reachability: Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability (CW, KH), pp. 376–394.
ECSA-2013-MorandiWNG #behaviour #design pattern #development #object-oriented: Concurrent Object-Oriented Development with Behavioral Design Patterns (BM, SW, SN, HG), pp. 25–32.
VLDB-2013-PsaroudakisAA #query: Sharing Data and Work Across Concurrent Analytical Queries (IP, MA, AA), pp. 637–648.
VLDB-2013-WuCHN #database #execution #predict #query #towards: Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads (WW, YC, HH, JFN), pp. 925–936.
ICSM-2013-XinQHXZWG #empirical #source code: An Automation-Assisted Empirical Study on Lock Usage for Concurrent Programs (RX, ZQ, SH, CX, YZ, YW, HG), pp. 100–109.
PASTE-2013-DingesCA #automation #execution #set: Automated inference of atomic sets for safe concurrent execution (PD, MC, GA), pp. 1–8.
LATA-2013-DengZDZ #π-calculus: The Buffered π-Calculus: A Model for Concurrent Languages (XD, YZ, YD, FZ), pp. 250–261.
IFM-2013-GiachinoGLLW #analysis #theory and practice: Deadlock Analysis of Concurrent Objects: Theory and Practice (EG, CAG, CL, ML, PYHW), pp. 394–411.
ICFP-2013-TuronDB #higher-order #hoare #logic #reasoning #refinement: Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency (AT, DD, LB), pp. 377–390.
GT-VMT-2013-Corradini #semantics: Invited Talk: On the Concurrent Semantics of Transformation Systems with Negative Application Conditions (AC).
VISSOFT-2013-WallerWFDH #3d #monitoring #named #visualisation: Synchrovis: 3D visualization of monitoring traces in the city metaphor for analyzing concurrency (JW, CW, FF, PD, WH), pp. 1–4.
ICML-c3-2013-SilverNBWM #interactive #learning: Concurrent Reinforcement Learning from Customer Interactions (DS, LN, DB, SW, JM), pp. 924–932.
SEKE-2013-LiLJJ #communication #comprehension #debugging #graph: Locating and Understanding Concurrency Bugs Based on Edge-labeled Communication Graphs (HL, ML, TJ, ZJ), pp. 525–530.
SEKE-2013-QiHW #combinator #source code #testing: A Mixed-way Combinatorial Testing for Concurrent Programs (XQ, JH, PW), pp. 699–702.
AMT-2013-Gottmann0NBEEE #correctness #graph grammar: Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars (SG, FH, NN, BB, CE, HE, TE), pp. 62–71.
BX-2013-OrejasBE0S #on the: On Propagation-Based Concurrent Model Synchronization (FO, AB, HE, FH, HS), pp. 18–36.
ECOOP-2013-GruberB #manycore: Ownership-Based Isolation for Concurrent Actors on Multi-core Machines (OG, FB), pp. 281–301.
ECOOP-2013-SvendsenBP #case study #composition #higher-order #library #named #specification: Joins: A Case Study in Modular Specification of a Concurrent Reentrant Higher-Order Library (KS, LB, MJP), pp. 327–351.
ECOOP-2013-TasharofiDJ #developer #modelling #question #scala #why: Why Do Scala Developers Mix the Actor Model with other Concurrency Models? (ST, PD, REJ), pp. 302–326.
OOPSLA-2013-BoisSEE #graph #multi #scalability #thread #visualisation: Bottle graphs: visualizing scalability bottlenecks in multi-threaded applications (KDB, JBS, SE, LE), pp. 355–372.
OOPSLA-2013-ClebschD #garbage collection #manycore: Fully concurrent garbage collection of actors on many-core machines (SC, SD), pp. 553–570.
OOPSLA-2013-NorrisD #c #c++ #data type #named: CDSchecker: checking concurrent data structures written with C/C++ atomics (BN, BD), pp. 131–150.
OOPSLA-2013-RaychevVS #detection #effectiveness #source code: Effective race detection for event-driven programs (VR, MTV, MS), pp. 151–166.
OOPSLA-2013-VafeiadisN #logic: Relaxed separation logic: a program logic for C11 concurrency (VV, CN), pp. 867–884.
HILT-2013-Taft #named #parallel #proving #safety #source code #thread #tutorial: Tutorial: proving safety of parallel / multi-threaded programs (STT), pp. 1–2.
PLDI-2013-ElmasBNS #debugging #domain-specific language #named: CONCURRIT: a domain specific language for reproducing concurrency bugs (TE, JB, GCN, KS), pp. 153–164.
PLDI-2013-Golan-GuetaRSY #library: Concurrent libraries with foresight (GGG, GR, MS, EY), pp. 263–274.
PLDI-2013-HuangZD #named: CLAP: recording local executions to reproduce concurrency failures (JH, CZ, JD), pp. 141–152.
POPL-2013-BattyDG #abstraction #c #c++ #library: Library abstraction for C/C++ concurrency (MB, MD, AG), pp. 235–248.
POPL-2013-Dinsdale-YoungBGPY #composition #named #reasoning #source code: Views: compositional reasoning for concurrent programs (TDY, LB, PG, MJP, HY), pp. 287–300.
POPL-2013-HenzingerKPSS #data type: Quantitative relaxation of concurrent data structures (TAH, CMK, HP, AS, AS), pp. 317–328.
POPL-2013-Ley-WildN: Subjective auxiliary state for coarse-grained concurrency (RLW, AN), pp. 561–574.
POPL-2013-TuronTABD #fine-grained #logic: Logical relations for fine-grained concurrency (AJT, JT, AA, LB, DD), pp. 343–356.
PPDP-2013-PinoBV #confluence #constraints #equivalence #performance #programming: Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.
QAPL-2013-McIverRS #algebra #probability: Probabilistic Concurrent Kleene Algebra (AM, TMR, GS), pp. 97–115.
QAPL-2013-NgoH #analysis #multi #security #source code #thread: Quantitative Security Analysis for Multi-threaded Programs (TMN, MH), pp. 34–48.
SAS-2013-DOsualdoKO #automation #verification: Automatic Verification of Erlang-Style Concurrency (ED, JK, CHLO), pp. 454–476.
SAS-2013-RaychevVY #automation #synthesis: Automatic Synthesis of Deterministic Concurrency (VR, MTV, EY), pp. 283–303.
ASE-2013-0002IP #c #named #preprocessor #tool support #verification: CSeq: A concurrency pre-processor for sequential C verification tools (BF, OI, GP), pp. 710–713.
ASE-2013-KusanoW #c #c++ #generative #named #parallel #thread: CCmutator: A mutation generator for concurrency constructs in multithreaded C/C++ applications (MK, CW), pp. 722–725.
ASE-2013-ZhangCW #data type #named #runtime: Round-up: Runtime checking quasi linearizability of concurrent data structures (LZ, AC, CW), pp. 4–14.
ESEC-FSE-2013-AlbertAGW #generative #named #testing: aPET: a test case generation tool for concurrent objects (EA, PA, MGZ, PYHW), pp. 595–598.
ICSE-2013-MarinoHDVTV #detection #source code: Detecting deadlock in programs with data-centric synchronization (DM, CH, JD, MV, FT, JV), pp. 322–331.
ICSE-2013-Park #comprehension #fault #source code: Fault comprehension for concurrent programs (SP), pp. 1444–1446.
ICSE-2013-PradelG #automation #testing: Automatic testing of sequential and concurrent substitutability (MP, TRG), pp. 282–291.
SAC-2013-LourencoSM: Concurrent typed intermediate language (LML, JCS, FM), pp. 1587–1588.
SAC-2013-OyamadaKK #query: Continuous query processing with concurrency control: reading updatable resources consistently (MO, HK, HK), pp. 788–794.
SLE-2013-CombemaleDLMBBF #execution #metamodelling: Reifying Concurrency for Executable Metamodeling (BC, JD, MVL, FM, OB, BB, RBF), pp. 365–384.
ASPLOS-2013-JogKNMKMID #array #named #owl #performance #scheduling #thread: OWL: cooperative thread array aware scheduling techniques for improving GPGPU performance (AJ, OK, NCN, AKM, MTK, OM, RI, CRD), pp. 395–406.
ASPLOS-2013-PaiTG #kernel: Improving GPGPU concurrency with elastic kernels (SP, MJT, RG), pp. 407–418.
ASPLOS-2013-WesterDCFN #detection: Parallelizing data race detection (BW, DD, PMC, JF, SN), pp. 27–38.
ASPLOS-2013-ZhangKLLS #debugging #execution #named #thread: ConAir: featherweight concurrency bug recovery via single-threaded idempotent execution (WZ, MdK, AL, SL, KS), pp. 113–126.
CASE-2013-MashaeiL #automation #design: Concurrent design and control of automated material handling systems (MM, BL), pp. 292–299.
CASE-2013-PanHJ #flexibility #petri net #policy #using: One computationally improved deadlock prevention policy for flexible manufacturing systems using Petri nets (YLP, HH, MJ), pp. 924–929.
CASE-2013-YueH #robust #using: Robust deadlock control using shared-resources for production systems with unreliable workstations (HY, HH), pp. 1095–1100.
CASE-2013-YueH13a #assembly #petri net #policy #polynomial #process: A polynomial deadlock avoidance policy for a class of assembly processes based on Petri nets (HY, HH), pp. 1151–1156.
CGO-2013-ChoKWLLM #source code: Practical lock/unlock pairing for concurrent programs (HKC, TK, YW, SL, HL, SAM), p. 12.
DAC-2013-KauerNSLCH #architecture #composition: Modular system-level architecture for concurrent cell balancing (MK, SN, SS, ML, SC, LH), p. 10.
DAC-2013-NathAR #scheduling #thread: Temperature aware thread block scheduling in GPGPUs (RN, RZA, TSR), p. 6.
DATE-2013-ElbayoumiHE #diagrams #manycore #novel #platform: A novel concurrent cache-friendly binary decision diagram construction for multi-core platforms (ME, MSH, MYE), pp. 1427–1430.
DATE-2013-FreitasRS #consistency #memory management #on the fly #verification: On-the-fly verification of memory consistency with concurrent relaxed scoreboards (LSF, EAR, LCVdS), pp. 631–636.
DATE-2013-HanxledenMADFMMO: Sequentially constructive concurrency: a conservative extension of the synchronous model of computation (RvH, MM, JA, BD, IF, CM, SM, OO), pp. 581–586.
DATE-2013-HuYH0 #low cost #multi #named #thread: Orchestrator: a low-cost solution to reduce voltage emergencies for multi-threaded applications (XH, GY, YH, XL), pp. 208–213.
DATE-2013-LagraaTP #data access #data mining #identification #memory management #mining #simulation: Data mining MPSoC simulation traces to identify concurrent memory access patterns (SL, AT, FP), pp. 755–760.
DATE-2013-SarrazinENBG #design #detection #fault #performance: Scan design with shadow flip-flops for low performance overhead and concurrent delay fault detection (SS, SE, LAdBN, YB, VG), pp. 1077–1082.
PDP-2013-SchlimbachBK #distributed #memory management: Concurrent Collections on Distributed Memory Theory Put into Practice (FS, JCB, KK), pp. 225–232.
PPoPP-2013-HeumannAW: The tasks with effects model for safe concurrency (SH, VSA, SW), pp. 239–250.
PPoPP-2013-MorrisonA #performance: Fast concurrent queues for x86 processors (AM, YA), pp. 103–112.
PPoPP-2013-ParkSI #detection #scalability #source code: Scalable data race detection for partitioned global address space programs (CSP, KS, CI), pp. 305–306.
PPoPP-2013-WamhoffFFRM #memory management #named #performance #thread #transaction: FastLane: improving performance of software transactional memory for low thread counts (JTW, CF, PF, ER, GM), pp. 113–122.
PPoPP-2013-XiangS #compilation #data type #performance: Compiler aided manual speculation for high performance concurrent data structures (LX, MLS), pp. 47–56.
SOSP-2013-KasikciZC #crowdsourcing #detection #named: RaceMob: crowdsourced data race detection (BK, CZ, GC), pp. 406–422.
ESOP-2013-BouajjaniEEH #source code #specification #verification: Verifying Concurrent Programs against Sequential Specifications (AB, ME, CE, JH), pp. 290–309.
ESOP-2013-GotsmanRY #algorithm #memory management #verification: Verifying Concurrent Memory Reclamation Algorithms with Grace (AG, NR, HY), pp. 249–269.
ESOP-2013-KatoenP #implementation #modelling #probability: Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems (JPK, DP), pp. 411–430.
ESOP-2013-LaneseLMSS #flexibility: Concurrent Flexible Reversibility (IL, ML, CAM, AS, JBS), pp. 370–390.
ESOP-2013-SvendsenBP #composition #data type #reasoning: Modular Reasoning about Separation of Concurrent Data Structures (KS, LB, MJP), pp. 169–188.
FoSSaCS-2013-MioS #composition #probability #process #proving #verification: A Proof System for Compositional Verification of Probabilistic Concurrent Processes (MM, AS), pp. 161–176.
STOC-2013-Goyal #simulation: Non-black-box simulation in the fully concurrent setting (VG), pp. 221–230.
TACAS-2013-AbdullaHHJR #data type #specification #verification: An Integrated Specification and Verification Technique for Highly Concurrent Data Structures (PAA, FH, LH, BJ, AR), pp. 324–338.
TACAS-2013-PopeeaR #contest #multi #named #source code #thread #verification: Threader: A Verifier for Multi-threaded Programs — (Competition Contribution) (CP, AR), pp. 633–636.
CAV-2013-AlglaveKT #bound #model checking #partial order #performance: Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.
CAV-2013-AndreLSDL #named #parametricity #realtime #synthesis: PSyHCoS: Parameter Synthesis for Hierarchical Concurrent Real-Time Systems (ÉA, YL, JS, JSD, SWL), pp. 984–989.
CAV-2013-BinghamBEG #distributed #model checking: Distributed Explicit State Model Checking of Deadlock Freedom (BDB, JDB, JE, MRG), pp. 235–241.
CAV-2013-Brenguier #game studies #named #nash: PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games (RB), pp. 890–895.
CAV-2013-CernyHRRT #performance #semantics #synthesis: Efficient Synthesis for Concurrency by Semantics-Preserving Transformations (PC, TAH, AR, LR, TT), pp. 951–967.
CAV-2013-DragoiGH #automation #proving: Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates (CD, AG, TAH), pp. 174–190.
CSL-2013-Goller #model checking #parametricity: The Fixed-Parameter Tractability of Model Checking Concurrent Systems (SG), pp. 332–347.
ICST-2013-ChristakisGS #detection #erlang #fault #source code #testing: Systematic Testing for Detecting Concurrency Errors in Erlang Programs (MC, AG, KFS), pp. 154–163.
ICST-2013-HongSAKR #effectiveness #metric #testing: The Impact of Concurrent Coverage Metrics on Testing Effectiveness (SH, MS, JA, MK, GR), pp. 232–241.
ICST-2013-LinD #java #using: CHECK-THEN-ACT Misuse of Java Concurrent Collections (YL, DD), pp. 164–173.
ICST-2013-SteenbuckF #generative #testing: Generating Unit Tests for Concurrent Classes (SS, GF), pp. 144–153.
ICTSS-2013-KocaSA #fault #locality: Spectrum-Based Fault Localization for Diagnosing Concurrency Faults (FK, HS, RA), pp. 239–254.
ICTSS-2013-LeonHL #consistency #testing: Unfolding-Based Test Selection for Concurrent Conformance (HPdL, SH, DL), pp. 98–113.
ISSTA-2013-BindalBL #bound #parallel #source code #testing #thread: Variable and thread bounding for systematic testing of multithreaded programs (SB, SB, AL), pp. 145–155.
ISSTA-2013-ChocklerEY #fault: Finding rare numerical stability errors in concurrent computations (HC, KE, EY), pp. 12–22.
ISSTA-2013-GligoricZPP #mutation testing #testing: Selective mutation testing for concurrent code (MG, LZ, CP, GP), pp. 224–234.
ISSTA-2013-Park #debugging: Debugging non-deadlock concurrency bugs (SP), pp. 358–361.
ISSTA-2013-ParkHV #comprehension #data access #debugging #named: Griffin: grouping suspicious memory-access patterns to improve understanding of concurrency bugs (SP, MJH, RWV), pp. 134–144.
ISSTA-2013-RadoiD #detection #java #parallel: Practical static race detection for Java parallel loops (CR, DD), pp. 178–190.
SAT-2013-WieringaH: Concurrent Clause Strengthening (SW, KH), pp. 116–132.
VLDB-2012-GraefeHIKM #adaptation: Concurrency Control for Adaptive Indexing (GG, FH, SI, HAK, SM), pp. 656–667.
VLDB-2012-PattersonENAA #multi: Serializability, not Serial: Concurrency Control and Availability in Multi-Datacenter Datastores (SP, AJE, FN, DA, AEA), pp. 1459–1470.
LATA-2012-KlimosLST #game studies #nash: Nash Equilibria in Concurrent Priced Games (MK, KGL, FS, JT), pp. 363–376.
IFM-2012-LensinkSE #framework #proving #source code: A Proof Framework for Concurrent Programs (LL, SS, MCJDvE), pp. 174–190.
SEFM-2012-BistarelliS #constraints #programming: Securely Accessing Shared Resources with Concurrent Constraint Programming (SB, FS), pp. 308–322.
SEFM-2012-Jones #abstraction #formal method: Abstraction as a Unifying Link for Formal Approaches to Concurrency (CBJ), pp. 1–15.
SEFM-2012-ZhuXMQQ #approach #source code #verification: The Rely/Guarantee Approach to Verifying Concurrent BPEL Programs (HZ, QX, CM, SQ, ZQ), pp. 172–187.
ICFP-2012-StefanRBLMM #data flow #termination: Addressing covert termination and timing channels in concurrent information flow systems (DS, AR, PB, AL, JCM, DM), pp. 201–214.
ICGT-2012-HeckelEGH #graph transformation #parallel #probability: Parallelism and Concurrency of Stochastic Graph Transformations (RH, HE, UG, FH), pp. 96–110.
ICGT-2012-SerbanutaR #framework #graph transformation #semantics #𝕂: A Truly Concurrent Semantics for the 𝕂 Framework Based on Graph Transformations (TFS, GR), pp. 294–310.
CHI-2012-KimCZT: Enabling concurrent dual views on common LCD screens (SK, XC, HZ, DST), pp. 2175–2184.
CIKM-2012-ThonangiB0: A practical concurrent index for solid-state drives (RT, SB, JY), pp. 1332–1341.
ECIR-2012-JonassenB #distributed #pipes and filters #retrieval: Intra-query Concurrent Pipelined Processing for Distributed Full-Text Retrieval (SJ, SEB), pp. 413–425.
ICPR-2012-GimelfarbGND #optimisation #problem: Concurrent propagation for solving ill-posed problems of global discrete optimisation (GLG, RG, RN, PD), pp. 1864–1867.
ICPR-2012-WangXZH #image #segmentation: Concurrent segmentation of categorized objects from an image collection (LW, JX, NZ, GH), pp. 3309–3312.
SEKE-2012-LiuCL #in the cloud: Singular Formulas for Compound Siphons, Complementary Siphons and Characteristic Vectors for Deadlock Prevention in Cloud Computing (GL, DYC, YNL), pp. 359–362.
SEKE-2012-QiXW #graph #interprocedural #reachability #slicing #source code: Slicing Concurrent Interprocedural Programs Based on Program Reachability Graphs (XQ, XX, PW), pp. 293–298.
SEKE-2012-XuT #automation #generative: Automated Generation of Concurrent Test Code from Function Nets (DX, JT), pp. 346–351.
OOPSLA-2012-Effinger-DeanLCGB #detection #named: IFRit: interference-free regions for dynamic data-race detection (LED, BL, LC, DG, HJB), pp. 467–484.
OOPSLA-2012-HuangZ #agile #debugging #execution #named #reduction: LEAN: simplifying concurrency bug reproduction via replay-supported execution reduction (JH, CZ), pp. 451–466.
OOPSLA-2012-HuangZ12a #execution #source code: Execution privatization for scheduler-oblivious concurrent programs (JH, CZ), pp. 737–752.
OOPSLA-2012-KaliberaMJV #approach #black box #comprehension: A black-box approach to understanding concurrency in DaCapo (TK, MM, REJ, JV), pp. 335–354.
OOPSLA-2012-MullerC #towards: Towards a practical secure concurrent language (SM, SC), pp. 57–74.
OOPSLA-2012-PrountzosMP #graph #named #source code: Elixir: a system for synthesizing concurrent graph programs (DP, RM, KP), pp. 375–394.
OOPSLA-2012-SartorE #hardware #java #manycore #performance #thread: Exploring multi-threaded Java application performance on multicore hardware (JBS, LE), pp. 281–296.
OOPSLA-2012-SuenagaFI #type system: Type-based safe resource deallocation for shared-memory concurrency (KS, RF, AI), pp. 1–20.
TOOLS-EUROPE-2012-MarrD #abstraction #identification #implementation #multi #virtual machine: Identifying a Unifying Mechanism for the Implementation of Concurrency Abstractions on Multi-language Virtual Machines (SM, TD), pp. 171–186.
PADL-2012-AlbertAG #execution #symbolic computation: Symbolic Execution of Concurrent Objects in CLP (EA, PA, MGZ), pp. 123–137.
PLDI-2012-HawkinsAFRS #data transformation #representation #synthesis: Concurrent data representation synthesis (PH, AA, KF, MCR, MS), pp. 417–428.
PLDI-2012-NagarakatteBMM #debugging #detection #manycore: Multicore acceleration of priority-based schedulers for concurrency bug detection (SN, SB, MMKM, MM), pp. 543–554.
PLDI-2012-PetrovVSD #detection #web: Race detection for web applications (BP, MTV, MS, JD), pp. 251–262.
PLDI-2012-PradelG #automation #detection #precise #safety #thread: Fully automatic and precise detection of thread safety violations (MP, TRG), pp. 521–530.
PLDI-2012-RamanZSVY #detection #parallel #precise #scalability: Scalable and precise dynamic datarace detection for structured parallelism (RR, JZ, VS, MTV, EY), pp. 531–542.
PLDI-2012-Turon #fine-grained #named: Reagents: expressing and composing fine-grained concurrency (AT), pp. 157–168.
POPL-2012-BattyMOSS #c #c++ #compilation: Clarifying and compiling C/C++ concurrency: from C++11 to POWER (MB, KM, SO, SS, PS), pp. 509–520.
POPL-2012-FarzanK #composition #reasoning #source code #verification: Verification of parameterized concurrent programs by modular reasoning about data and control (AF, ZK), pp. 297–308.
POPL-2012-LiangFF #program transformation #simulation #verification: A rely-guarantee-based simulation for verifying concurrent program transformations (HL, XF, MF), pp. 455–468.
POPL-2012-SmaragdakisESYF #detection #polynomial #predict: Sound predictive race detection in polynomial time (YS, JE, CS, JY, CF), pp. 387–400.
PPDP-2012-OlartePRC #approach #automation #constraints #linear #verification: A linear concurrent constraint approach for the automatic verification of access permissions (CO, EP, CR, NC), pp. 207–216.
QAPL-2012-Bernardo #bisimulation #markov #process: Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes (MB), pp. 122–136.
FSE-2012-AlbertFG #named: MayPar: a may-happen-in-parallel analyzer for concurrent objects (EA, AFM, SG), p. 14.
FSE-2012-FarzanMRS #predict #source code: Predicting null-pointer dereferences in concurrent programs (AF, PM, NR, FS), p. 47.
FSE-2012-GanaiLG #analysis #multi #named #source code #thread: DTAM: dynamic taint analysis of multi-threaded programs for relevancy (MKG, DL, AG), p. 46.
ICSE-2012-CaiC #detection #named #scalability: MagicFuzzer: Scalable deadlock detection for large-scale applications (YC, WKC), pp. 606–616.
SAC-2012-BistarelliCS #constraints #coordination #programming: A secure coordination of agents with nonmonotonic soft Concurrent Constraint Programming (SB, PC, FS), pp. 1551–1553.
SAC-2012-El-ShambakeyR #bound #embedded #manycore #realtime #trade-off: STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs (MES, BR), pp. 1602–1609.
ASPLOS-2012-VolosTSL #debugging #memory management #transaction: Applying transactional memory to concurrency bugs (HV, AJT, MMS, SL), pp. 211–222.
CASE-2012-BergagardF #multi #sequence: Deadlock avoidance for multi product manufacturing systems modeled as sequences of operations (PB, MF), pp. 515–520.
CASE-2012-HanXZLW #policy: Two-stage deadlock prevention policy based on resource-transition circuits (LH, KX, MZ, HL, FW), pp. 741–746.
CASE-2012-MatsumotoN #approach #clustering #composition #petri net #scheduling #tool support: Petri net decomposition approach to deadlock-free scheduling for dual-armed cluster tools (IM, TN), pp. 194–199.
CGO-2012-HongHYWHLWC #multi #named #thread: HQEMU: a multi-threaded and retargetable dynamic binary translator on multicores (DYH, CCH, PCY, JJW, WCH, PL, CMW, YCC), pp. 104–113.
DAC-2012-El-ShambakeyR #bound #embedded #realtime: STM concurrency control for embedded real-time software with tighter time bounds (MES, BR), pp. 437–446.
DAC-2012-GuoK #detection #encryption #fault #standard: Invariance-based concurrent error detection for advanced encryption standard (XG, RK), pp. 573–578.
DAC-2012-UrdahlSWK #abstraction #composition #verification: System verification of concurrent RTL modules by compositional path predicate abstraction (JU, DS, MW, WK), pp. 334–343.
DATE-2012-GaoWHZL #clustering #debugging #manycore: A clustering-based scheme for concurrent trace in debugging NoC-based multicore systems (JG, JW, YH, LZ, XL), pp. 27–32.
DATE-2012-Voyiatzis #logic #monitoring #multi: Input vector monitoring on line concurrent BIST based on multilevel decoding logic (IV), pp. 1251–1256.
ISMM-2012-IyengarGWM #parallel #scalability: Scalable concurrent and parallel mark (BI, EFG, MW, KM), pp. 61–72.
PDP-2012-CastilloFC #algorithm #complexity #detection #linear: A Dynamic Deadlock Detection/Resolution Algorithm with Linear Message Complexity (MC, FF, AC), pp. 175–179.
PDP-2012-DaniASB #named #parallel #predict #source code #thread: TCP: Thread Contention Predictor for Parallel Programs (AMD, BA, YNS, CB), pp. 19–26.
PDP-2012-FreyRE #algorithm #thread: SIMT Microscheduling: Reducing Thread Stalling in Divergent Iterative Algorithms (SF, GR, TE), pp. 399–406.
PPoPP-2012-BuhlerALC #performance #streaming: Efficient deadlock avoidance for streaming computation with filtering (JDB, KA, PL, RDC), pp. 235–246.
PPoPP-2012-ParkS: Concurrent breakpoints (CSP, KS), pp. 331–332.
PPoPP-2012-ProkopecBBO #performance: Concurrent tries with efficient non-blocking snapshots (AP, NGB, PB, MO), pp. 151–160.
ESOP-2012-BurckhardtGMY #correctness #library #memory management: Concurrent Library Correctness on the TSO Memory Model (SB, AG, MM, HY), pp. 87–107.
ESOP-2012-PerezCPT #linear #logic: Linear Logical Relations for Session-Based Concurrency (JAP, LC, FP, BT), pp. 539–558.
FASE-2012-HermannEEO #graph grammar: Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars (FH, HE, CE, FO), pp. 178–193.
FoSSaCS-2012-BouyerBMU #game studies #order: Concurrent Games with Ordered Objectives (PB, RB, NM, MU), pp. 301–315.
FoSSaCS-2012-Chatterjee #game studies #robust: Robustness of Structurally Equivalent Concurrent Parity Games (KC), pp. 270–285.
FoSSaCS-2012-Winskel #game studies: Bicategories of Concurrent Games — (GW), pp. 26–41.
STOC-2012-ChalermsookCEL #algorithm #approximate: Approximation algorithms and hardness of integral concurrent flow (PC, JC, AE, SL), pp. 689–708.
TACAS-2012-CairesV #logic #model checking #named #specification: SLMC: A Tool for Model Checking Concurrent Systems against Dynamical Spatial Logic Specifications (LC, HTV), pp. 485–491.
TACAS-2012-PopeeaR #composition #multi #proving #source code #termination #thread: Compositional Termination Proofs for Multi-threaded Programs (CP, AR), pp. 237–251.
CAV-2012-KahlonW #source code: Lock Removal for Concurrent Trace Programs (VK, CW), pp. 227–242.
CSL-2012-BirkedalST #logic: A Concurrent Logical Relation (LB, FS, JT), pp. 107–121.
ICLP-2012-AlbertAG #testing #towards: Towards Testing Concurrent Objects in CLP (EA, PA, MGZ), pp. 98–108.
ICLP-2012-VirsedaMT #constraints #functional #logic programming #semantics: A Concurrent Operational Semantics for Constraint Functional Logic Programming (RdVV, FPM, MMGT), pp. 154–163.
ICLP-J-2012-AreiasR #multi #thread #towards #using: Towards multi-threaded local tabling using a common table space (MA, RR), pp. 427–443.
ICLP-J-2012-GebserKS #multi #thread: Multi-threaded ASP solving with clasp (MG, BK, TS), pp. 525–545.
ICST-2012-ParkVH #approach #debugging: A Unified Approach for Localizing Non-deadlock Concurrency Bugs (SP, RWV, MJH), pp. 51–60.
ISSTA-2012-HongAPKH #source code #testing: Testing concurrent programs to achieve high synchronization coverage (SH, JA, SP, MK, MJH), pp. 210–220.
ISSTA-2012-YiDFF #java #thread: Cooperative types for controlling thread interference in Java (JY, TD, SNF, CF), pp. 232–242.
LICS-2012-ClairambaultGW #game studies: The Winning Ways of Concurrent Games (PC, JG, GW), pp. 235–244.
LICS-2012-SabelS #haskell: Conservative Concurrency in Haskell (DS, MSS), pp. 561–570.
VMCAI-2012-ChakiGS #multi #source code #thread #verification: Regression Verification for Multi-threaded Programs (SC, AG, OS), pp. 119–135.
ICDAR-2011-HamamuraINOS #clustering #optimisation #recognition #using #word: Concurrent Optimization of Context Clustering and GMM for Offline Handwritten Word Recognition Using HMM (TH, BI, TN, NO, SS), pp. 523–527.
SIGMOD-2011-DugganCPU #database #performance #predict: Performance prediction for concurrent database workloads (JD, UÇ, OP, EU), pp. 337–348.
VLDB-2011-BernsteinRWY: Optimistic Concurrency Control by Melding Trees (PAB, CWR, MW, XY), pp. 944–955.
VLDB-2012-LarsonBDFPZ11 #database #in memory: High-Performance Concurrency Control Mechanisms for Main-Memory Databases (PÅL, SB, CD, CF, JMP, MZ), pp. 298–309.
CSEET-2011-NanzTPM #assessment #education #empirical: Empirical assessment of languages for teaching concurrency: Methodology and application (SN, FT, MP, BM), pp. 477–481.
SCAM-J-2009-Giffhorn11 #source code: Advanced chopping of sequential and concurrent programs (DG), pp. 239–294.
ICSM-2011-SyerAH #identification #performance #thread: Identifying performance deviations in thread pools (MDS, BA, AEH), pp. 83–92.
FM-2011-AlbertGGJST #behaviour #bound #simulation #worst-case: Simulating Concurrent Behaviors with Worst-Case Cost Bounds (EA, SG, MGZ, EBJ, RS, SLTT), pp. 353–368.
CEFP-2011-Marlow #haskell #parallel #programming: Parallel and Concurrent Programming in Haskell (SM), pp. 339–401.
Haskell-2011-LeijenFB #functional: Prettier concurrency: purely functional concurrent revisions (DL, MF, SB), pp. 83–94.
VISSOFT-2011-LonnbergBM #dependence #graph #source code #visualisation: Visualising concurrent programs with dynamic dependence graphs (JL, MBA, LM), pp. 1–4.
ECIR-2011-DuanZ #modelling #retrieval #thread: Exploiting Thread Structures to Improve Smoothing of Language Models for Forum Post Retrieval (HD, CZ), pp. 350–361.
SEKE-2011-El-KharboutlyG #analysis #architecture #probability #reliability #using: Architecture-based Reliability Analysis of Concurrent Software Applications using Stochastic Reward Nets (REK, SSG), pp. 635–639.
SEKE-2011-Kaiser #debugging #higher-order #using: Constructing Subtle Concurrency Bugs Using Synchronization-Centric Second-Order Mutation Operators (LWGK), pp. 244–249.
SEKE-2011-SoundarajanBK #aspect-oriented #formal method #reuse: Formalizing Reusable Aspect-Oriented Concurrency Control (NS, DB, RK), pp. 111–114.
SEKE-2011-SouzaSMCSZ #quality #reachability #testing #using: Using Coverage and Reachability Testing to Improve Concurrent Program Testing Quality (SdRSdS, PSLdS, MCCM, MSC, AdSS, EZ), pp. 207–212.
OOPSLA-2011-LiSD #analysis #detection #named: SOS: saving time in dynamic race detection with stationary analysis (DL, WSa, MBD), pp. 35–50.
OOPSLA-2011-PintoDDGW #abstraction: A simple abstraction for complex concurrent indexes (PdRP, TDY, MD, PG, MJW), pp. 845–864.
OOPSLA-2011-ShachamBASVY #testing: Testing atomicity of composed concurrent operations (OS, NGB, AA, MS, MTV, EY), pp. 51–64.
PADL-2011-PetricekS #control flow #named #parallel #programming: Joinads: A Retargetable Control-Flow Construct for Reactive, Parallel and Concurrent Programming (TP, DS), pp. 205–219.
PLDI-2011-LuciaWC #comprehension #execution #fault #using: Isolating and understanding concurrency errors using reconstructed execution fragments (BL, BPW, LC), pp. 378–388.
PLDI-2011-Sevcik #optimisation #source code: Safe optimisations for shared-memory concurrent programs (JS), pp. 306–316.
PLDI-2011-ZengWL #data type #monitoring #named #using: Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures (QZ, DW, PL), pp. 367–377.
POPL-2011-AttiyaGHKMV #algorithm #order: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.
POPL-2011-BattyOSSW #c++: Mathematizing C++ concurrency (MB, SO, SS, PS, TW), pp. 55–66.
POPL-2011-GordonHHJS #verification: Robin Milner 1934--2010: verification, languages, and concurrency (ADG, RH, JH, AJ, PS), pp. 473–474.
POPL-2011-GuptaPR #abstraction #multi #refinement #source code #thread #verification: Predicate abstraction and refinement for verifying multi-threaded programs (AG, CP, AR), pp. 331–344.
POPL-2011-JacobsP #composition #fine-grained #specification: Expressive modular fine-grained concurrency specification (BJ, FP), pp. 271–282.
POPL-2011-SevcikVNJS #compilation: Relaxed-memory concurrency and verified compilation (JS, VV, FZN, SJ, PS), pp. 43–54.
POPL-2011-TuronW #logic: A separation logic for refining concurrent objects (AJT, MW), pp. 247–258.
PPDP-2011-BlanchetteWBOS #c++: Nitpicking C++ concurrency (JCB, TW, MB, SO, SS), pp. 113–124.
PPDP-2011-SabelS #haskell #semantics: A contextual semantics for concurrent Haskell with futures (DS, MSS), pp. 101–112.
SAS-2011-BouajjaniEP #on the #source code: On Sequentializing Concurrent Programs (AB, ME, GP), pp. 129–145.
SAS-2011-HuangZ #debugging #performance #source code: An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs (JH, CZ), pp. 163–179.
SAS-2011-MightH #abstract interpretation #higher-order #product line #source code #static analysis: A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.
ASE-2011-GanaiAWGB #multi #named #predict #testing #thread: BEST: A symbolic testing tool for predicting multi-threaded program failures (MKG, NA, CW, AG, GB), pp. 596–599.
ASE-2011-WesongaMR #fault #source code #visualisation: Guided test visualization: Making sense of errors in concurrent programs (SW, EGM, NR), pp. 624–627.
ICSE-2011-AraujoBL #contract #java #modelling #runtime: Enabling the runtime assertion checking of concurrent contracts for the Java modeling language (WA, LCB, YL), pp. 786–795.
ICSE-2011-CordeiroF #bound #model checking #multi #smt #thread #using #verification: Verifying multi-threaded software using smt-based context-bounded model checking (LC, BF), pp. 331–340.
ICSE-2011-Kumar #distributed #mining #specification: Specification mining in concurrent and distributed systems (SK), pp. 1086–1089.
ICSE-2011-Kumar11a #distributed #mining #specification: Specification mining in concurrent and distributed systems (SK), pp. 1161–1163.
ICSE-2011-OhHVP #debugging #execution #framework #multi #named #thread: LIME: a framework for debugging load imbalance in multi-threaded execution (JO, CJH, GV, MP), pp. 201–210.
ICSE-2011-ShengVEHCZ #detection #lightweight #named: RACEZ: a lightweight and non-invasive race detection tool for production applications (TS, NV, SE, RH, WC, WZ), pp. 401–410.
ICSE-2011-TanZP #debugging #detection #mining #named: aComment: mining annotations from comments and code to detect interrupt related concurrency bugs (LT, YZ, YP), pp. 11–20.
ICSE-2011-WangSG #testing: Coverage guided systematic concurrency testing (CW, MS, AG), pp. 221–230.
SAC-2011-ShinLSL #monitoring #multi #predict #scheduling #thread: Predictable multithread scheduling with cycle-accurate thread progress monitor (YS, SL, MS, SL), pp. 627–628.
SLE-2011-Wojciechowski #communication #scripting language: Typed First-Class Communication Channels and Mobility for Concurrent Scripting Languages (PTW), pp. 378–387.
ASPLOS-2011-GaoZCZQ #debugging #named #towards #type system: 2ndStrike: toward manifesting hidden concurrency typestate bugs (QG, WZ, ZC, MZ, FQ), pp. 239–250.
ASPLOS-2011-NguyenP #algorithm: Synthesizing concurrent schedulers for irregular algorithms (DN, KP), pp. 333–344.
ASPLOS-2011-ZhangLOSJLR #debugging #detection #fault #named: ConSeq: detecting concurrency bugs through sequential errors (WZ, JL, RO, JS, GJ, SL, TWR), pp. 251–264.
CASE-2011-LeeL #clustering #multi: Concurrent processing of multiple wafer types in a single-armed cluster tool (JHL, TEL), pp. 102–107.
CASE-2011-NazeemR #classification #design #policy #resource management: Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory (AN, SAR), pp. 405–412.
DAC-2011-AdirGLNSSZ #multi #named #thread: Threadmill: a post-silicon exerciser for multi-threaded processors (AA, MG, SL, AN, GS, VS, AZ), pp. 860–865.
DAC-2011-KandemirYK #clustering #parallel #thread: A helper thread based dynamic cache partitioning scheme for multithreaded applications (MTK, TY, EK), pp. 954–959.
DATE-2011-Al-DujailyMXYP #detection #network #runtime #transitive #using: Run-time deadlock detection in networks-on-chip using coupled transitive closure networks (RAD, TSTM, FX, AY, MP), pp. 497–502.
DATE-2011-ChaixAZN #adaptation #fault tolerance: A fault-tolerant deadlock-free adaptive routing for on chip interconnects (FC, DA, NEZ, MN), pp. 909–912.
DATE-2011-GhermanMECB #fault #predict #self: Error prediction based on concurrent self-test and reduced slack time (VG, JM, SE, SC, YB), pp. 1626–1631.
HPCA-2011-BrownPT #migration #performance #predict #set #thread: Fast thread migration via cache working set prediction (JAB, LP, DMT), pp. 193–204.
HPCA-2011-FungA #control flow #performance #thread: Thread block compaction for efficient SIMT control flow (WWLF, TMA), pp. 25–36.
HPCA-2011-RanjanLMG #clustering #multi #named #thread: Fg-STP: Fine-Grain Single Thread Partitioning on Multicores (RR, FL, PM, AG), pp. 15–24.
HPDC-2011-Garcia-YaguezFG #thread: Exclusive squashing for thread-level speculation (ÁGY, DRLF, AGE), pp. 275–276.
ISMM-2011-TeneIW #named: C4: the continuously concurrent compacting collector (GT, BI, MW), pp. 79–88.
PDP-2011-AldeaFG #compilation #framework #thread #towards: Towards a Compiler Framework for Thread-Level Speculation (SA, DRLF, AGE), pp. 267–271.
PDP-2011-OzTKT #architecture #manycore #thread: Quantifying Thread Vulnerability for Multicore Architectures (IO, HRT, MTK, OT), pp. 32–39.
PDP-2011-VerbeekS #algorithm #network #performance #proving: A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free (FV, JS), pp. 3–10.
PPoPP-2011-Ding #parallel #programming: Two examples of parallel programming without concurrency constructs (PP-CC) (CD), pp. 299–300.
PPoPP-2011-FischerMR #modelling: Symbolically modeling concurrent MCAPI executions (TF, EM, NR), pp. 307–308.
PPoPP-2011-KarmaniMM #contract #parallel #thread: Thread contracts for safe parallelism (RKK, PM, BMM), pp. 125–134.
PPoPP-2011-LuchangcoM #transaction: Transaction communicators: enabling cooperation among concurrent transactions (VL, VJM), pp. 169–178.
ESOP-2011-BurckhardtL #semantics: Semantics of Concurrent Revisions (SB, DL), pp. 116–135.
ESOP-2011-HoborG #logic: Barriers in Concurrent Separation Logic (AH, CG), pp. 276–296.
FoSSaCS-2011-AristizabalBPPV #constraints #programming #similarity: Deriving Labels and Bisimilarity for Concurrent Constraint Programming (AA, FB, CP, LFP, FDV), pp. 138–152.
CAV-2011-CernyCHRS #source code #synthesis: Quantitative Synthesis for Concurrent Programs (PC, KC, TAH, AR, RS), pp. 243–259.
CAV-2011-DonaldsonKKW #abstraction #source code #symmetry: Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs (AFD, AK, DK, TW), pp. 356–371.
CAV-2011-GuptaPR #constraints #multi #named #source code #thread #verification: Threader: A Constraint-Based Verifier for Multi-threaded Programs (AG, CP, AR), pp. 412–417.
CSL-2011-MoreNS #axiom #independence #semantics: Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence (SMM, PN, BS), pp. 443–457.
ICLP-J-2011-CominiTV #constraints #source code: Abstract diagnosis for timed concurrent constraint programs (MC, LT, AV), pp. 487–502.
ICLP-J-2011-Haemmerle #constraints #linear #logic: Observational equivalences for linear logic concurrent constraint languages (RH), pp. 469–485.
ICLP-J-2011-HallerstedeL #constraints #specification: Constraint-based deadlock checking of high-level specifications (SH, ML), pp. 767–782.
ICST-2011-LuoDQ #detection #manycore #performance: Multicore SDK: A Practical and Efficient Deadlock Detector for Real-World Applications (ZDL, RD, YQ), pp. 309–318.
ICTSS-2011-PeleskaHLLSSVZ #benchmark #metric #realtime #testing: A Real-World Benchmark Model for Testing Concurrent Real-Time Systems in the Automotive Domain (JP, AH, FL, HL, HS, PS, EV, CZ), pp. 146–161.
ISSTA-2011-BurnimSS #memory management #modelling #source code #testing: Testing concurrent programs on relaxed memory models (JB, KS, CS), pp. 122–132.
ISSTA-2011-HuangZ #persuasion #predict: Persuasive prediction of concurrency access anomalies (JH, CZ), pp. 144–154.
LICS-2011-RideauW: Concurrent Strategies (SR, GW), pp. 409–418.
VMCAI-2011-GawlitzaLMSW #analysis #process #reachability #source code: Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.
SIGMOD-2010-JonesAM #database #in memory #memory management: Low overhead concurrency control for partitioned main memory databases (EPCJ, DJA, SM), pp. 603–614.
ICSM-2010-JalbertB #clone detection #debugging #detection #identification #using: Using clone detection to identify bugs in concurrent software (KJ, JSB), pp. 1–5.
PASTE-2010-FlanaganF #dynamic analysis #framework #source code: The RoadRunner dynamic analysis framework for concurrent programs (CF, SNF), pp. 1–8.
PASTE-2010-HaC #communication #dynamic analysis: Opportunities for concurrent dynamic analysis with explicit inter-core communication (JH, SPC), pp. 17–20.
SCAM-2010-KesterMB #debugging #how #question #static analysis: How Good is Static Analysis at Finding Concurrency Bugs? (DK, MM, JSB), pp. 115–124.
SCAM-2010-LuoHDQ #debugging #effectiveness #java #static analysis: Effective Static Analysis to Find Concurrency Bugs in Java (ZDL, LH, RD, YQ), pp. 135–144.
WCRE-2010-MilanovaL #comprehension #java #source code #static analysis: Static Analysis for Understanding Shared Objects in Open Concurrent Java Programs (AM, YL), pp. 45–54.
ICALP-v1-2010-YaoYZ: Concurrent Knowledge Extraction in the Public-Key Model (ACCY, MY, YZ), pp. 702–714.
FLOPS-2010-Sagonas #detection #erlang #fault #source code #static analysis #using: Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs (KFS), pp. 13–18.
Haskell-2010-LaunchburyE #distributed #haskell: Concurrent orchestration in Haskell (JL, TE), pp. 79–90.
ICFP-2010-MazurakZ #linear #logic #named: Lolliproc: to concurrency from classical linear logic via curry-howard and control (KM, SZ), pp. 39–50.
IFL-2010-HerhutJSPG #case study #experience: Concurrent Non-deferred Reference Counting on the Microgrid: First Experiences (SH, CJ, SBS, RP, CG), pp. 185–202.
ICGT-2010-Esparza #tool support: A False History of True Concurrency: From Petri to Tools (JE), pp. 1–2.
SOFTVIS-2010-JohnsonM #execution #named #source code #visualisation: Beat: a tool for visualizing the execution of object orientated concurrent programs (PJ, SM), pp. 225–226.
SOFTVIS-2010-MaheswaraBC #interactive #named #thread #visualisation: TIE: an interactive visualization of thread interleavings (GM, JSB, CC), pp. 215–216.
ICEIS-ISAS-2010-BeestSW #process: Assessing the Interference in Concurrent Business Processes (NRTPvB, NBS, JCW), pp. 261–270.
CIKM-2010-BonacicGMPT #multi #performance #thread: Building efficient multi-threaded search nodes (CB, CG, MM, MPM, FT), pp. 1249–1258.
CIKM-2010-RonenS10a #network #protocol #social: Concurrent atomic protocols for making and changing decisions in social networks (RR, OS), pp. 1337–1340.
CIKM-2010-ZhaoBCGWZ #learning #online #recommendation #thread: Learning a user-thread alignment manifold for thread recommendation in online forum (JZ, JB, CC, ZG, CW, CZ), pp. 559–568.
KDIR-2010-SaidW #clustering #online #thread: Clustering of Thread Posts in Online Discussion Forums (DAS, NMW), pp. 314–319.
KEOD-2010-GibbsC #ontology #question: Concurrency Conundrums — An Ontological Solution? (CG, YC), pp. 305–310.
SEKE-2010-LuG #analysis #architecture #performance #thread #web: Performance Analysis of a Web Server with Dynamic Thread Pool Architecture (JL, SSG), pp. 99–105.
ECOOP-2010-Dinsdale-YoungDGPV: Concurrent Abstract Predicates (TDY, MD, PG, MJP, VV), pp. 504–528.
ECOOP-2010-Owens #abstraction #implementation #reasoning: Reasoning about the Implementation of Concurrency Abstractions on x86-TSO (SO), pp. 478–503.
ECOOP-2010-SchaferDSTT #java #refactoring: Correct Refactoring of Concurrent Java Code (MS, JD, MS, ET, FT), pp. 225–249.
ECOOP-2010-SchaferP #component #named: JCoBox: Generalizing Active Objects to Concurrent Components (JS, APH), pp. 275–299.
OOPSLA-2010-BurckhardtBL #programming: Concurrent programming with revisions and isolation types (SB, AB, DL), pp. 691–707.
OOPSLA-2010-JinTLL #debugging: Instrumentation and sampling strategies for cooperative concurrency bug isolation (GJ, AVT, BL, SL), pp. 241–255.
OOPSLA-2010-RajanKR #composition #design pattern: Concurrency by modularity: design patterns, a case in point (HR, SMK, WR), pp. 790–805.
OOPSLA-2010-ShiPYLZCZ #debugging #detection #invariant: Do I use the wrong definition?: DeFuse: definition-use invariants for detecting concurrency and sequential bugs (YS, SP, ZY, SL, YZ, WC, WZ), pp. 160–174.
PADL-2010-MarquesSC #implementation #performance: A Simple and Efficient Implementation of Concurrent Local Tabling (RM, TS, JCC), pp. 264–278.
PLDI-2010-KamruzzamanST #distributed #performance #thread: Software data spreading: leveraging distributed caches to improve single thread performance (MK, SS, DMT), pp. 460–470.
PLDI-2010-MarinoSMMN #memory management #named #performance #programming language: DRFX: a simple and efficient memory model for concurrent programming languages (DM, AS, TDM, MM, SN), pp. 351–362.
POPL-2010-MartinHCAC #c #c++ #policy #source code: Dynamically checking ownership policies in concurrent c/c++ programs (JPM, MH, MC, PA, MC), pp. 457–470.
PPDP-2010-Martinez #constraints #linear #programming #semantics: Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules (TM), pp. 57–66.
SAS-2010-BellAW #logic #parallel #pipes and filters: Concurrent Separation Logic for Pipelined Parallelization (CJB, AWA, DW), pp. 151–166.
SAS-2010-FarzanK #analysis #composition #source code: Compositional Bitvector Analysis for Concurrent Programs with Nested Locks (AF, ZK), pp. 253–270.
SIGAda-2010-Pettit #ada #design #embedded #realtime #uml #using: Designing real-time, concurrent, and embedded software systems using UML and Ada (RGPI), pp. 7–8.
FSE-2010-HuangLZ #java #lightweight #multi #named #source code: LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 207–216.
FSE-2010-HuangLZ10a #java #lightweight #multi #named #source code: LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 385–386.
FSE-2010-JalbertS #debugging #effectiveness #source code: A trace simplification technique for effective debugging of concurrent programs (NJ, KS), pp. 57–66.
FSE-2010-SinhaW #program analysis #staged: Staged concurrent program analysis (NS, CW), pp. 47–56.
ICSE-2010-Cordeiro #bound #embedded #model checking #multi #smt #thread: SMT-based bounded model checking for multi-threaded software in embedded systems (LC), pp. 373–376.
ICSE-2010-DemskyL #named: Views: object-inspired concurrency control (BD, PL), pp. 395–404.
ICSE-2010-Elmas #abstraction #named #proving #reduction #verification: QED: a proof system based on reduction and abstraction for the static verification of concurrent software (TE), pp. 507–508.
ICSE-2010-HarperZM #case study #experience #research: Experiences in initiating concurrency software research efforts (KEH, JZ, SM), pp. 139–148.
ICSE-2010-ParkVH #fault #locality #named #source code: Falcon: fault localization in concurrent programs (SP, RWV, MJH), pp. 245–254.
ICSE-2010-Rakamaric #named #source code: STORM: static unit checking of concurrent programs (ZR), pp. 519–520.
ICSE-2010-RungtaM #debugging #slicing #source code: Slicing and dicing bugs in concurrent programs (NR, EM), pp. 195–198.
SAC-2010-KerfootM #aspect-oriented #contract: Checking concurrent contracts with aspects (EK, SM), pp. 2523–2530.
GPCE-2010-LongMSR: Implicit invocation meets safe, implicit concurrency (YL, SLM, TS, HR), pp. 63–72.
ASPLOS-2010-RamanKMJA #parallel #thread #transaction #using: Speculative parallelization using software multi-threaded transactions (AR, HK, TRM, TBJ, DIA), pp. 65–76.
ASPLOS-2010-WeeratungeZJ #debugging #manycore: Analyzing multicore dumps to facilitate concurrency bug reproduction (DW, XZ, SJ), pp. 155–166.
ASPLOS-2010-ZhangSL #approach #debugging #detection #named: ConMem: detecting severe concurrency bugs through an effect-oriented approach (WZ, CS, SL), pp. 179–192.
CASE-2010-HuZLW #assembly #automation #flexibility: Deadlock-free control of ratio-enforced automated manufacturing systems with flexible routes and assembly operations (HH, MZ, ZL, NW), pp. 459–464.
DAC-2010-CongLR #named: ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip (JC, CL, GR), pp. 443–448.
DAC-2010-LiuKLC #bound #multi #thread: Multi-threaded collision-aware global routing with bounded-length maze routing (WHL, WCK, YLL, KYC), pp. 200–205.
DATE-2010-VerbeekS #specification: Formal specification of networks-on-chips: deadlock and evacuation (FV, JS), pp. 1701–1706.
HPDC-2010-MoiseAB #framework: Improving the Hadoop map/reduce framework to support concurrent appends through the BlobSeer BLOB management system (DM, GA, LB), pp. 834–840.
ISMM-2010-HellyerJH #locality: The locality of concurrent write barriers (LH, REJ, ALH), pp. 83–92.
ISMM-2010-Siebert #garbage collection #parallel #realtime: Concurrent, parallel, real-time garbage-collection (FS), pp. 11–20.
LCTES-2010-BrandtSS #specification: Translating concurrent action oriented specifications to synchronous guarded actions (JB, KS, SKS), pp. 47–56.
OSDI-2010-EricksonMBO #detection #effectiveness #kernel: Effective Data-Race Detection for the Kernel (JE, MM, SB, KO), pp. 151–162.
PDP-2010-ZarzaLFL10a #fault #multi #network: Deadlock Avoidance for Interconnection Networks with Multiple Dynamic Faults (GZ, DL, DF, EL), pp. 276–280.
PPoPP-2010-BronsonCCO: A practical concurrent binary search tree (NGB, JC, HC, KO), pp. 257–268.
PPoPP-2010-CedermanT #composition: Supporting lock-free composition of concurrent data objects (DC, PT), pp. 339–340.
PPoPP-2010-ChandramowlishwaranKV #algebra #linear #parallel #programming: Applying the concurrent collections programming model to asynchronous parallel dense linear algebra (AC, KK, RWV), pp. 345–346.
PPoPP-2010-CoonsBM #effectiveness #library #named #testing: GAMBIT: effective unit testing for concurrency libraries (KEC, SB, MM), pp. 15–24.
PPoPP-2010-RadojkovicCVPCNV #network #parallel #thread: Thread to strand binding of parallel network applications in massive multi-threaded systems (PR, VC, JV, AP, FJC, MN, MV), pp. 191–202.
PPoPP-2010-SutherlandS #composition #thread: Composable thread coloring (DFS, WLS), pp. 233–244.
ESOP-2010-DeshmukhRRV #logic #proving: Logical Concurrency Control from Sequential Proofs (JVD, GR, VPR, KV), pp. 226–245.
ESOP-2010-FerreiraFS #logic #memory management #modelling: Parameterized Memory Models and Concurrent Separation Logic (RF, XF, ZS), pp. 267–286.
ESOP-2010-LeinoMS: Deadlock-Free Channels and Locks (KRML, PM, JS), pp. 407–426.
FASE-2010-ChatterjeeARS #multi #source code #thread: Analyzing the Impact of Change in Multi-threaded Programs (KC, LdA, VR, CS), pp. 293–307.
FASE-2010-LuoZZH #approach #lightweight: A Lightweight and Portable Approach to Making Concurrent Failures Reproducible (QL, SZ, JZ, MH), pp. 323–337.
TACAS-2010-BallBCMQ #performance #testing: Preemption Sealing for Efficient Concurrency Testing (TB, SB, KEC, MM, SQ), pp. 420–434.
TACAS-2010-DragerKFW #infinity #model checking #named: SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems (KD, AK, BF, HW), pp. 271–274.
WRLA-2010-KatelmanKM #analysis #semantics: Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits (MK, SK, JM), pp. 140–156.
WRLA-2010-Velardo #framework #multi #semantics: Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding (FRV), pp. 191–207.
CAV-2010-CernyRZCA #implementation #model checking: Model Checking of Linearizability of Concurrent List Implementations (PC, AR, DZ, SC, RA), pp. 465–479.
CAV-2010-CohenMST #invariant #source code #verification: Local Verification of Global Invariants in Concurrent Programs (EC, MM, WS, ST), pp. 480–494.
CAV-2010-KahlonW #debugging #detection #graph #precise #source code: Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs (VK, CW), pp. 434–449.
CAV-2010-KaiserKW #detection #source code: Dynamic Cutoff Detection in Parameterized Concurrent Programs (AK, DK, TW), pp. 645–659.
CAV-2010-KunduGW #analysis #named #testing: Contessa: Concurrency Testing Augmented with Symbolic Analysis (SK, MKG, CW), pp. 127–131.
CAV-2010-Michael #algorithm #memory management: Memory Management in Concurrent Algorithms (MMM), p. 23.
CAV-2010-TorreMP #interface #linear #model checking #source code #using: Model-Checking Parameterized Concurrent Programs Using Linear Interfaces (SLT, PM, GP), pp. 629–644.
ICLP-2010-Demeyer10 #declarative #program analysis #programming: Program Analysis to Support Concurrent Programming in Declarative Languages (RD), pp. 248–254.
ICLP-2010-Martinez10 #constraints #design #implementation #linear #logic programming #programming language: Design and Implementation of a Concurrent Logic Programming Language with Linear Logic Constraints (TM), pp. 277–280.
ICLP-2010-P10 #constraints #programming #similarity: Bisimilarity in Concurrent Constraint Programming (AAAP), pp. 236–240.
ISSTA-2010-WeeratungeZSJ #debugging #slicing #using: Analyzing concurrency bugs using dual slicing (DW, XZ, WNS, SJ), pp. 253–264.
VMCAI-2010-Leino #source code #verification: Verifying Concurrent Programs with Chalice (KRML), p. 2.
DocEng-2009-BattleB #behaviour #documentation #modelling #state machine: Modelling composite document behaviour with concurrent hierarchical state machines (SB, HB), pp. 25–28.
VLDB-2009-CandeaPV #predict #scalability: A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses (GC, NP, RV), pp. 277–288.
VLDB-2009-DasAAA #architecture #data type #manycore #thread: Thread Cooperation in Multicore Architectures for Frequency Counting over Multiple Data Streams (SD, SA, DA, AEA), pp. 217–228.
ITiCSE-2009-CasselLMW #ontology #parallel: Concurrency and parallelism in the computing ontology (LNC, RJL, ADM, MW), p. 402.
CSMR-2009-LuciaFST #fine-grained #modelling #uml #version control: Concurrent Fine-Grained Versioning of UML Models (ADL, FF, GS, GT), pp. 89–98.
SCAM-2009-Giffhorn #source code: Chopping Concurrent Programs (DG), pp. 13–22.
ICALP-v2-2009-GriponS #game studies #probability: Qualitative Concurrent Stochastic Games with Imperfect Information (VG, OS), pp. 200–211.
LATA-2009-GauwinNT #bound #query: Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
FM-2009-JohnsenKY #composition #distributed #evolution: Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects (EBJ, MK, ICY), pp. 596–611.
FM-2009-WangKGG #analysis #predict #source code: Symbolic Predictive Analysis for Concurrent Programs (CW, SK, MKG, AG), pp. 256–272.
IFM-2009-BoitenD #modelling #refinement #relational: Modelling Divergence in Relational Concurrent Refinement (EAB, JD), pp. 183–199.
SEFM-2009-ChandrasekaranM #component #coordination #specification: Specifying Interacting Components with Coordinated Concurrent Scenarios (PC, MM), pp. 61–69.
SEFM-2009-Jeannet #interprocedural #relational #source code #verification: Relational Interprocedural Verification of Concurrent Programs (BJ), pp. 83–92.
ICFP-2009-Chaudhuri #haskell #library #ml: A concurrent ML library in concurrent Haskell (AC), pp. 269–280.
ICFP-2009-ReppyRX #ml #parallel: Parallel concurrent ML (JHR, CVR, YX), pp. 257–268.
ICFP-2009-ZiarekSJ #communication: Partial memoization of concurrency and communication (LZ, KCS, SJ), pp. 161–172.
CHI-2009-BlanchO #performance: Rake cursor: improving pointing performance with concurrent input channels (RB, MO), pp. 1415–1418.
CHI-2009-SalvucciTB #formal method #multi #performance #towards: Toward a unified theory of the multitasking continuum: from concurrent performance to task switching, interruption, and resumption (DDS, NT, JPB), pp. 1819–1828.
HCI-NT-2009-RaoCJB #exclamation #how #people: “You’ve Got IMs!” How People Manage Concurrent Instant Messages (SR, JC, RJ, RB), pp. 500–509.
CIKM-2009-SeoCS #community #online #thread #using: Online community search using thread structure (JS, WBC, DAS), pp. 1907–1910.
SIGIR-2009-ElsasC #evaluation #online #retrieval #thread: It pays to be picky: an evaluation of thread retrieval in online forums (JLE, JGC), pp. 714–715.
MoDELS-2009-ShoushaBL #analysis #detection #uml: A UML/MARTE Model Analysis Method for Detection of Data Races in Concurrent Systems (MS, LCB, YL), pp. 47–61.
MoDELS-2009-ShoushaBL #analysis #detection #uml: A UML/MARTE Model Analysis Method for Detection of Data Races in Concurrent Systems (MS, LCB, YL), pp. 47–61.
OOPSLA-2009-BloomFNORSVW #named #robust #virtual machine: Thorn: robust, concurrent, extensible scripting on the JVM (BB, JF, NN, JÖ, GR, RS, JV, TW), pp. 117–136.
OOPSLA-2009-HaABM #dynamic analysis #framework #hardware #manycore: A concurrent dynamic analysis framework for multicore hardware (JH, MA, SMB, KSM), pp. 155–174.
TOOLS-EUROPE-2009-Vitek #modelling #programming #realtime: Programming Models for Concurrency and Real-Time (JV), p. 17.
PADL-2009-SuleimanM #implementation #parallel #prolog #thread: Implementing Thread Cancellation in Multithreaded Prolog Systems (AS, JM), pp. 122–136.
PLDI-2009-AndersonGN #data type #lightweight: Lightweight annotations for controlling sharing in concurrent data structures (ZRA, DG, MN), pp. 98–109.
PLDI-2009-FlanaganF #detection #named #performance #precise: FastTrack: efficient and precise dynamic race detection (CF, SNF), pp. 121–133.
PLDI-2009-MarinoMN #detection #effectiveness #lightweight #named: LiteRace: effective sampling for lightweight data-race detection (DM, MM, SN), pp. 134–143.
PLDI-2009-NeamtiuH #multi #source code #thread: Safe and timely updates to multi-threaded programs (IN, MWH), pp. 13–24.
POPL-2009-WangLKKM #formal method: The theory of deadlock avoidance via discrete control (YW, SL, TK, MK, SAM), pp. 252–263.
PPDP-2009-FalaschiOP #abstract interpretation #constraints #framework #source code: A framework for abstract interpretation of timed concurrent constraint programs (MF, CO, CP), pp. 207–218.
SAS-2009-SeidlV #analysis #detection: Region Analysis for Race Detection (HS, VV), pp. 171–187.
SIGAda-2009-Barkstrom #ada #algorithm #multi #on the #problem #using: On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms (BRB), pp. 61–72.
ASE-2009-DeshmukhES #analysis #library: Symbolic Deadlock Analysis in Concurrent Libraries and Their Clients (JVD, EAE, SS), pp. 480–491.
ASE-2009-KimYS #detection #heuristic #memory management #model checking #precise #using: Precise Data Race Detection in a Relaxed Memory Model Using Heuristic-Based Model Checking (KK, TYK, BAS), pp. 495–499.
ESEC-FSE-2009-KahlonSKZ #detection #source code: Static data race detection for concurrent programs with asynchronous calls (VK, NS, EK, YZ), pp. 13–22.
ESEC-FSE-2009-ShermanDE #source code #testing: Saturation-based testing of concurrent programs (ES, MBD, SGE), pp. 53–62.
ESEC-FSE-2009-WangCGY: Symbolic pruning of concurrent program executions (CW, SC, AG, YY), pp. 23–32.
ICSE-2009-DigME #java #library #refactoring: Refactoring sequential Java code for concurrency via concurrent libraries (DD, JM, MDE), pp. 397–407.
ICSE-2009-NaikPSG #detection #effectiveness: Effective static deadlock detection (MN, CSP, KS, DG), pp. 386–396.
SAC-2009-CapozuccaG #design #object-oriented #realtime #reliability: Designing reliable real-time concurrent object-oriented software systems (AC, NG), pp. 1996–1997.
SAC-2009-VasudevanE #compilation #manycore: Celling SHIM: compiling deterministic concurrency to a heterogeneous multicore (NV, SAE), pp. 1626–1631.
CASE-2009-WangLNRKML #parallel #source code #thread: Maximally permissive deadlock avoidance for multithreaded computer programs (YW, HL, AN, SAR, TK, SAM, SL), pp. 37–41.
CC-2009-GaoLXN #predict #recursion #source code #thread: Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction (LG, LL, JX, TFN), pp. 78–93.
CC-2009-VasudevanTDE #analysis #source code: Compile-Time Analysis and Specialization of Clocks in Concurrent Programs (NV, OT, JD, SAE), pp. 48–62.
CGO-2009-DuanFWZY #c #c++ #consistency #detection #source code: Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs (YD, XF, LW, CZ, PCY), pp. 25–34.
DAC-2009-KandemirOM #thread: Dynamic thread and data mapping for NoC based CMPs (MTK, ÖÖ, SPM), pp. 852–857.
DAC-2009-Leiserson #framework #platform: The Cilk++ concurrency platform (CEL), pp. 522–527.
DAC-2009-WenCCS #architecture #debugging #detection #manycore #named: NUDA: a non-uniform debugging architecture and non-intrusive race detection for many-core (CNW, SHC, TFC, APS), pp. 148–153.
DATE-2009-Anghel #development #topic: HOT TOPIC — Concurrent SoC development and end-to-end planning (LA), p. 430.
DATE-2009-BolzaniCMMP #design #industrial #power management: Enabling concurrent clock and power gating in an industrial design flow (LMVB, AC, AM, EM, MP), pp. 334–339.
DATE-2009-ChangHL #adaptation #embedded #manycore #named #testing: pTest: An adaptive testing tool for concurrent software on embedded multicore processors (SWC, KYH, JKL), pp. 1012–1017.
DATE-2009-HongNKO #multi #process #thread: Process variation aware thread mapping for Chip Multiprocessors (SH, SHKN, MTK, ÖÖ), pp. 821–826.
DATE-2009-SahuBP #estimation #framework #multi #performance #thread: A generic platform for estimation of multi-threaded program performance on heterogeneous multiprocessors (AS, MB, PRP), pp. 1018–1023.
HPDC-2009-HironakaST #performance #using: High performance wide-area overlay using deadlock-free routing (KH, HS, KT), pp. 81–90.
PDP-2009-CasconOHDR #interface #multi #network #thread #using: A Multi-Threaded Network Interface Using Network Processors (PC, JO, WMH, AFD, IR), pp. 196–200.
PPoPP-2009-KejariwalC #analysis #parallel #source code #thread: Parallelization spectroscopy: analysis of thread-level parallelism in hpc programs (AK, CC), pp. 293–294.
PPoPP-2009-MarkstrumFM #refactoring #towards: Towards concurrency refactoring for x10 (SM, RMF, TDM), pp. 303–304.
ESOP-2009-FilipovicORY #abstraction: Abstraction for Concurrent Objects (IF, PWO, NR, HY), pp. 252–266.
ESOP-2009-LeinoM #multi #source code #thread #verification: A Basis for Verifying Multi-threaded Programs (KRML, PM), pp. 378–393.
FASE-2009-ChocklerFGN #source code: Cross-Entropy-Based Replay of Concurrent Programs (HC, EF, BG, SN), pp. 201–215.
FoSSaCS-2009-AbbesB #algebra #probability: Concurrency, σ-Algebras, and Probabilistic Fairness (SA, AB), pp. 380–394.
FoSSaCS-2009-BolligGH #recursion #source code: Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
FoSSaCS-2009-Gutierrez #bisimulation #game studies #logic: Logics and Bisimulation Games for Concurrency, Causality and Conflict (JG), pp. 48–62.
STOC-2009-LinPV #framework #security: A unified framework for concurrent security: universal composability from stand-alone non-malleability (HL, RP, MV), pp. 179–188.
TACAS-2009-AtigBQ #analysis #bound #source code #thread: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (MFA, AB, SQ), pp. 107–123.
TACAS-2009-KahlonSG #reduction #semantics #source code #thread: Semantic Reduction of Thread Interleavings in Concurrent Programs (VK, SS, AG), pp. 124–138.
CAV-2009-BaslerMWK #abstraction: Symbolic Counter Abstraction for Concurrent Software (GB, MM, TW, DK), pp. 64–78.
CAV-2009-BensalemBNS #composition #detection #named #verification: D-Finder: A Tool for Compositional Deadlock Detection and Verification (SB, MB, THN, JS), pp. 614–619.
CAV-2009-JoshiNPS #framework #named #source code #testing: CalFuzzer: An Extensible Active Testing Framework for Concurrent Programs (PJ, MN, CSP, KS), pp. 675–681.
CAV-2009-LahiriQR #detection #fault #precise #smt #using: Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers (SKL, SQ, ZR), pp. 509–524.
CAV-2009-TorreMP #bound #reachability: Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (SLT, PM, GP), pp. 477–492.
CAV-2009-WintersteigerHM #approach #smt: A Concurrent Portfolio Approach to SMT Solving (CMW, YH, LMdM), pp. 715–720.
CSL-2009-TurnerW: Nominal Domain Theory for Concurrency (DT, GW), pp. 546–560.
ICLP-2009-CampliB #constraints: Capturing Fair Computations on Concurrent Constraint Language (PC, SB), pp. 559–560.
ICLP-2009-HildebrandtL #constraints #pattern matching #programming: Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming (TTH, HAL), pp. 417–431.
LICS-2009-HansenKM #game studies #reachability: Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
MBT-2009-KimHHK #debugging #kernel #modelling #testing: Model-based Kernel Testing for Concurrency Bugs through Counter Example Replay (MK, SH, CH, TK), pp. 21–36.
VMCAI-2009-Gupta #model checking #source code: Model Checking Concurrent Programs (AG), p. 2.
ITiCSE-2008-ErnstS #manycore #student: Concurrent CS: preparing students for a multicore world (DJE, DES), pp. 230–234.
SIGITE-2008-Wang #education #security #thread: A security thread in a thread-based curriculum (AJAW), pp. 193–200.
ICPC-2008-FlemingKSDX #comprehension #maintenance: Refining Existing Theories of Program Comprehension During Maintenance for Concurrent Software (SDF, EK, REKS, LKD, SX), pp. 23–32.
ICSM-2008-BaroneLFRST #named #version control: COMOVER: Concurrent model versioning (IB, ADL, FF, ER, GS, GT), pp. 462–463.
ICSM-2008-TallamTG #detection #parallel #slicing #source code #thread: Dynamic slicing of multithreaded programs for race detection (ST, CT, RG), pp. 97–106.
CIAA-2008-Yen #petri net: Concurrency, Synchronization, and Conflicts in Petri Nets (HCY), pp. 33–35.
ICALP-C-2008-OstrovskyPV: Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (RO, GP, IV), pp. 548–559.
LATA-2008-Kahramanogullari #linear #logic #on the: On Linear Logic Planning and Concurrency (OK), pp. 250–262.
FM-2008-MateescuT #model checking: A Model Checking Language for Concurrent Value-Passing Systems (RM, DT), pp. 148–164.
AFP-2008-JonesS08 #haskell #parallel #programming #tutorial: A Tutorial on Parallel and Concurrent Programming in Haskell (SLPJ, SS), pp. 267–305.
ICEIS-ISAS2-2008-Nikovski #mining #process #representation #workflow: Workflow Trees for Representation and Mining of Implicitly Concurrent Business Processes (DN), pp. 30–36.
MoDELS-2008-ShoushaBL #algorithm #analysis #search-based #uml: A UML/SPT Model Analysis Methodology for Concurrent Systems Based on Genetic Algorithms (MS, LCB, YL), pp. 475–489.
MoDELS-2008-ShoushaBL #algorithm #analysis #search-based #uml: A UML/SPT Model Analysis Methodology for Concurrent Systems Based on Genetic Algorithms (MS, LCB, YL), pp. 475–489.
ECOOP-2008-ZhangJ #java: Externalizing Java Server Concurrency with CAL (CZ, HAJ), pp. 362–386.
AdaEurope-2008-Evequoz #performance #using #word: Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives (CE), pp. 59–72.
AdaEurope-2008-KaiserPP #metric: Concurrent Program Metrics Drawn by Quasar (CK, CP, JFPP), pp. 101–114.
AdaEurope-2008-Pettit #analysis #architecture: Increasing Confidence in Concurrent Software through Architectural Analysis (RGPI), pp. 199–210.
PEPM-2008-EdwardsZ #recursion: Static elaboration of recursion for concurrent software (SAE, JZ), pp. 71–80.
PLDI-2008-BoehmA #c++ #memory management: Foundations of the C++ concurrency memory model (HJB, SVA), pp. 68–78.
PLDI-2008-ChughVJL #analysis #data flow #detection #source code #using: Dataflow analysis for concurrent programs using datarace detection (RC, JWV, RJ, SL), pp. 316–326.
PLDI-2008-PizloPS #case study #garbage collection #realtime: A study of concurrent real-time garbage collectors (FP, EP, BS), pp. 33–44.
PLDI-2008-Sen #random testing #source code #testing: Race directed random testing of concurrent programs (KS), pp. 11–21.
PLDI-2008-Solar-LezamaJB #data type #sketching: Sketching concurrent data structures (ASL, CGJ, RB), pp. 136–148.
PLDI-2008-VechevY #fine-grained: Deriving linearizable fine-grained concurrent objects (MTV, EY), pp. 125–135.
POPL-2008-Fontana #biology #modelling: Systems biology, models, and concurrency (WF), pp. 1–2.
POPL-2008-NeamtiuHFP #programming: Contextual effects for version-consistent dynamic software updating and safe concurrent programming (IN, MH, JSF, PP), pp. 37–49.
QAPL-2008-Bortolussi #approximate #constraints #equation #on the #probability #programming: On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation (LB), pp. 163–180.
SAS-2008-LammichM #analysis #monitoring #source code #thread: Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors (PL, MMO), pp. 205–220.
SAS-2008-ManevichLSRB #analysis #composition: Heap Decomposition for Concurrent Shape Analysis (RM, TLA, MS, GR, JB), pp. 363–377.
SAS-2008-NanzNN #abstraction #behaviour: Modal Abstractions of Concurrent Behaviour (SN, FN, HRN), pp. 159–173.
ASE-2008-Yom-TovTUH #automation #debugging #random #source code: Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections (EYT, RT, SU, SH), pp. 307–316.
FSE-2008-DragertDR #generative #using: Generation of concurrency control code using discrete-event systems theory (CD, JD, KR), pp. 146–157.
FSE-2008-ParkS #detection #random #source code: Randomized active atomicity violation detection in concurrent programs (CSP, KS), pp. 135–145.
ICSE-2008-FlemingKSXD #case study #maintenance #student: A study of student strategies for the corrective maintenance of concurrent software (SDF, EK, REKS, SX, LKD), pp. 759–768.
SAC-2008-GrovPMI #component #coordination: Preserving coordination properties when transforming concurrent system components (GG, RFP, GM, AI), pp. 126–127.
SAC-2008-OlarteV #constraints #security #semantics: Universal concurrent constraint programing: symbolic semantics and applications to security (CO, FDV), pp. 145–150.
ASPLOS-2008-LuPSZ #debugging #learning: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics (SL, SP, ES, YZ), pp. 329–339.
ASPLOS-2008-OttoniA #communication #multi #optimisation #scheduling #thread: Communication optimizations for global multi-threaded instruction scheduling (GO, DIA), pp. 222–232.
ASPLOS-2008-SulemanQP #execution #multi #power management #thread: Feedback-driven threading: power-efficient and high-performance execution of multi-threaded workloads on CMPs (MAS, MKQ, YNP), pp. 277–286.
ASPLOS-2008-WegielK #memory management #parallel: The mapping collector: virtual memory support for generational, parallel, and concurrent compaction (MW, CK), pp. 91–102.
CASE-2008-KhaledMM #architecture #collaboration: A Service Oriented Architecture for CAX concurrent collaboration (AK, YM, JM), pp. 650–655.
CASE-2008-MunguiaR #agile: A concurrent Rapid Manufacturing advice system (JM, CR), pp. 947–952.
CC-2008-LiuLS #named: Coqa: Concurrent Objects with Quantized Atomicity (YDL, XL, SFS), pp. 260–275.
DAC-2008-LukasiewyczGHTRL #integration #network #optimisation: Concurrent topology and routing optimization in automotive network integration (ML, MG, CH, JT, RR, BL), pp. 626–629.
DAC-2008-TurumellaS #thread #verification: Assertion-based verification of a 32 thread SPARCTM CMT microprocessor (BT, MS), pp. 256–261.
DATE-2008-ChoudhuryM #approximate #detection #fault #logic: Approximate logic circuits for low overhead, non-intrusive concurrent error detection (MRC, KM), pp. 903–908.
DATE-2008-EdwardsVT #compilation #memory management #message passing #multi #programming #thread: Programming Shared Memory Multiprocessors with Deterministic Message-Passing Concurrency: Compiling SHIM to Pthreads (SAE, NV, OT), pp. 1498–1503.
DATE-2008-LiMM #named #self #using: CASP: Concurrent Autonomous Chip Self-Test Using Stored Test Patterns (YL, SM, SM), pp. 885–890.
DATE-2008-StrikGW #design #process: Subsystem Exchange in a Concurrent Design Process Environment (MS, AG, PW), pp. 953–958.
DATE-2008-VemuJAPG #detection #fault #logic #low cost: A low-cost concurrent error detection technique for processor control logic (RV, AJ, JAA, SP, RG), pp. 897–902.
HPCA-2008-RashidH #parallel #source code #thread: Supporting highly-decoupled thread-level redundancy for parallel programs (MWR, MCH), pp. 393–404.
LCTES-2008-AuerbachBGSV #flexibility #graph #java #programming #strict #thread: Flexible task graphs: a unified restricted thread programming model for java (JSA, DFB, RG, JHS, JV), pp. 1–11.
OSDI-2008-JulaTZC: Deadlock Immunity: Enabling Systems to Defend Against Deadlocks (HJ, DMT, CZ, GC), pp. 295–308.
OSDI-2008-MusuvathiQBBNN #source code: Finding and Reproducing Heisenbugs in Concurrent Programs (MM, SQ, TB, GB, PAN, IN), pp. 267–280.
OSDI-2008-WangKKLM #named #parallel #source code #thread: Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs (YW, TK, MK, SL, SAM), pp. 281–294.
PDP-2008-KadidloS #correlation #image #parallel #thread: Exploiting Data- and Thread-Level Parallelism for Image Correlation (JK, AS), pp. 407–413.
PPoPP-2008-AnsariKJLKW #adaptation #algorithm #case study #experience #memory management #transaction #using: Experiences using adaptive concurrency in transactional memory with Lee’s routing algorithm (MA, CK, KJ, ML, CCK, IW), pp. 261–262.
PPoPP-2008-DingC #profiling: All-window profiling of concurrent executions (CD, TMC), pp. 265–266.
PPoPP-2008-GiacomoniMV #parallel #performance #pipes and filters #queue: FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue (JG, TM, MV), pp. 43–52.
PPoPP-2008-McGacheyAHMSS #garbage collection #memory management #transaction: Concurrent GC leveraging transactional memory (PM, ARAT, RLH, VM, BS, TS), pp. 217–226.
PPoPP-2008-PraunBC #analysis #dependence #modelling #using: Modeling optimistic concurrency using quantitative dependence analysis (CvP, RB, CC), pp. 185–196.
PPoPP-2008-ZhaiWYH #compilation #optimisation #thread: Compiler optimizations for parallelizing general-purpose applications under thread-level speculation (AZ, SW, PCY, GH), pp. 271–272.
ESOP-2008-BuscemiM #bisimulation #constraints #π-calculus: Open Bisimulation for the Concurrent Constraint π-Calculus (MGB, UM), pp. 254–268.
ESOP-2008-HoborAN #logic #semantics: Oracle Semantics for Concurrent Separation Logic (AH, AWA, FZN), pp. 353–367.
FoSSaCS-2008-HasuoJS #algebra: The Microcosm Principle and Concurrency in Coalgebra (IH, BJ, AS), pp. 246–260.
TACAS-2008-ClarkeTV #abstraction #framework #model checking #proving: Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems (EMC, MT, HV), pp. 33–47.
TACAS-2008-LalTKR #analysis #bound #interprocedural #source code: Interprocedural Analysis of Concurrent Programs Under a Context Bound (AL, TT, NK, TWR), pp. 282–298.
TACAS-2008-TorreMP #analysis #bound #queue: Context-Bounded Analysis of Concurrent Queue Systems (SLT, PM, GP), pp. 299–314.
CAV-2008-BerdineLMRS #analysis #quantifier #thread: Thread Quantification for Concurrent Shape Analysis (JB, TLA, RM, GR, SS), pp. 399–413.
CAV-2008-CohenN #linear #proving #source code: Local Proofs for Linear-Time Properties of Concurrent Programs (AC, KSN), pp. 149–161.
CAV-2008-FarzanM #monitoring #source code: Monitoring Atomicity in Concurrent Programs (AF, PM), pp. 52–65.
CAV-2008-LalR #analysis #bound: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis (AL, TWR), pp. 37–51.
ICLP-2008-ArandaPRV #behaviour #constraints #probability #programming: Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming (JA, JAP, CR, FDV), pp. 682–686.
ICLP-2008-Beauxis #modelling #probability #security: Probabilistic and Concurrent Models for Security (RB), pp. 801–802.
ICLP-2008-MarquesS #evaluation #source code: Concurrent and Local Evaluation of Normal Programs (RM, TS), pp. 206–222.
ICLP-2008-PerezR #constraints #nondeterminism #programming: Non-determinism and Probabilities in Timed Concurrent Constraint Programming (JAP, CR), pp. 677–681.
ICST-2008-DantasBC #automation #multi #testing #thread: Improving Automated Testing of Multi-threaded Software (AD, FVB, WC), pp. 521–524.
ICST-2008-LeiWL #consistency #diagrams #java #nondeterminism #process #source code #testing #uml: UML Activity Diagram Based Testing of Java Concurrent Programs for Data Race and Inconsistency (BL, LW, XL), pp. 200–209.
IJCAR-2008-Schack-NielsenS #deduction #framework #logic #named: Celf — A Logical Framework for Deductive and Concurrent Systems (ASN, CS), pp. 320–326.
ISSTA-2008-BoddenH #aspectj #detection #effectiveness #named #using: Racer: effective race detection using aspectj (EB, KH), pp. 155–166.
ISSTA-2008-TianNGT #detection #recognition: Dynamic recognition of synchronization operations for improved data race detection (CT, VN, RG, ST), pp. 143–154.
LICS-2008-Kahlon #abstraction #analysis #approach #data flow #source code: Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs (VK), pp. 181–192.
TestCom-FATES-2008-WangH #analysis #generative #realtime #testing: Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis (FW, GDH), pp. 234–249.
VLDB-2007-LeeZL #approach #distributed #integration #query #throughput: Request Window: an Approach to Improve Throughput of RDBMS-based Data Integration System by Utilizing Data Sharing Across Concurrent Distributed Queries (RL, MZ, HL), pp. 1219–1230.
VLDB-2007-RomanK #behaviour #logic #reasoning #semantics #transaction #web #web service: Reasoning about the Behavior of Semantic Web Services with Concurrent Transaction Logic (DR, MK), pp. 627–638.
ITiCSE-2007-Ben-Ari #education #nondeterminism: Teaching concurrency and nondeterminism with spin (MBA), pp. 363–364.
ITiCSE-2007-OechsleB #automation #thread: Checking automatically the output of concurrent threads (RO, KB), pp. 43–47.
ICPC-2007-XieKS #comprehension #diagrams #empirical #evaluation #interactive #sequence chart #thread #uml: Empirical Evaluation of a UML Sequence Diagram with Adornments to Support Understanding of Thread Interactions (SX, EK, REKS), pp. 123–134.
SCAM-2007-GiffhornH #algorithm #evaluation #slicing #source code: An Evaluation of Slicing Algorithms for Concurrent Programs (DG, CH), pp. 17–26.
ICALP-2007-LuttgenV #exclamation #logic #simulation: Ready Simulation for Concurrency: It’s Logical! (GL, WV), pp. 752–763.
IFM-2007-Bruckner #realtime #slicing #specification #verification: Slicing Concurrent Real-Time System Specifications for Verification (IB), pp. 54–74.
SEFM-2007-BeckertK #deduction #logic #source code #verification: A Dynamic Logic for Deductive Verification of Concurrent Programs (BB, VK), pp. 141–150.
SEFM-2007-Cook #automation #proving #source code: Automatically Proving Concurrent Programs Correct (BC), pp. 269–272.
Haskell-2007-LiMJT #haskell #lightweight: Lightweight concurrency primitives for GHC (PL, SM, SLPJ, APT), pp. 107–118.
DHM-2007-ZhengLZK #assessment #experience #usability #user interface #visualisation: Visualizing User Experience Through “Perceptual Maps”: Concurrent Assessment of Perceived Usability and Subjective Appearance in Car Infotainment Systems (XSZ, JJWL, SZ, CK), pp. 536–545.
HCI-IDU-2007-Jensen #comparison: Evaluating in a Healthcare Setting: A Comparison Between Concurrent and Retrospective Verbalisation (JJJ), pp. 508–516.
HCI-MIE-2007-Wheatley #communication #design #evaluation: User-Centered Design and Evaluation of a Concurrent Voice Communication and Media Sharing Application (DW), pp. 990–999.
SEKE-2007-YasudaM: Tree Hash Under Concurrency Control (KY, TM), pp. 574–579.
ECOOP-2007-Armstrong #erlang #named: Erlang — Software for a Concurrent World (JA), p. 1.
AdaEurope-2007-KaiserPP #ada #modelling: Modelling Remote Concurrency with Ada (CK, CP, JFPP), pp. 192–207.
PADL-2007-Russo #library: The Joins Concurrency Library (CVR), pp. 260–274.
PLDI-2007-BurckhardtAM #consistency #data type #memory management #modelling #named: CheckFence: checking consistency of concurrent data types on relaxed memory models (SB, RA, MMKM), pp. 12–21.
PLDI-2007-CookPR #proving #termination #thread: Proving thread termination (BC, AP, AR), pp. 320–330.
PLDI-2007-LiZ #evaluation #implementation #monad #network #scalability #thread: Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives (PL, SZ), pp. 189–199.
PLDI-2007-VechevYBR #automation #named: CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors (MTV, EY, DFB, NR), pp. 456–467.
POPL-2007-NaikA #alias #detection: Conditional must not aliasing for static race detection (MN, AA), pp. 327–338.
QAPL-2007-BortolussiP #constraints #difference #equation #probability #programming: Stochastic Concurrent Constraint Programming and Differential Equations (LB, AP), pp. 27–42.
SAS-2007-CalcagnoPV #composition #fine-grained #safety: Modular Safety Checking for Fine-Grained Concurrency (CC, MJP, VV), pp. 233–248.
ASE-2007-ChenM #source code #testing #using: Testing concurrent programs using value schedules (JC, SM), pp. 313–322.
ASE-2007-PughA #testing: Unit testing concurrent software (WP, NA), pp. 513–516.
ASE-2007-Sen #effectiveness #random testing #source code #testing: Effective random testing of concurrent programs (KS), pp. 323–332.
ASE-2007-WitkowskiBKW #linux #model checking: Model checking concurrent linux device drivers (TW, NB, DK, GW), pp. 501–504.
ESEC-FSE-2007-VoungJL #detection #named: RELAY: static race detection on millions of lines of code (JWV, RJ, SL), pp. 205–214.
ICSE-2007-XieKS #comprehension #concept #design #diagrams #evaluation: Design and Evaluation of a Diagrammatic Notation to Aid in the Understanding of Concurrency Concepts (SX, EK, REKS), pp. 727–731.
SAC-2007-SoaresB #aspect-oriented #composition #reuse #towards: Towards reusable and modular aspect-oriented concurrency control (SS, PB), pp. 1293–1294.
SAC-2007-YiMLKJ #multi #named #operating system #stack #thread: SESAME: space-efficient stack allocation mechanism for multi-threaded sensor operating systems (SY, HM, SL, YK, IJ), pp. 1201–1202.
CASE-2007-ReveliotisR0 #algebra #correctness #policy #programming #verification: Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies through Mathematical Programming (SR, ER, JYC), pp. 200–206.
DAC-2007-BhojwaniM #online #protocol #robust: A Robust Protocol for Concurrent On-Line Test (COLT) of NoC-based Systems-on-a-Chip (PB, RNM), pp. 670–675.
DAC-2007-OstlerC #algorithm #approximate #architecture #multi #network #thread: Approximation Algorithm for Data Mapping on Block Multi-threaded Network Processor Architectures (CO, KSC), pp. 801–804.
DAC-2007-RizzoM: Concurrent Wire Spreading, Widening, and Filling (OR, HM), pp. 350–353.
HPCA-2007-ShaferCMRCZW #monitoring #network #virtual machine: Concurrent Direct Network Access for Virtual Machine Monitors (JS, DC, AM, SR, ALC, WZ, PW), pp. 306–317.
HPCA-2007-ZhouTZ #detection #named: HARD: Hardware-Assisted Lockset-based Race Detection (PZ, RT, YZ), pp. 121–132.
HPDC-2007-SongMD #memory management #scheduling #thread: Feedback-directed thread scheduling with memory considerations (FS, SM, JD), pp. 97–106.
ISMM-2007-OHearn #logic #resource management: Separation logic and concurrent resource management (PWO), p. 1.
ISMM-2007-XianSJ #garbage collection #performance #policy #scheduling #thread: Allocation-phase aware thread scheduling policies to improve garbage collection performance (FX, WSa, HJ), pp. 79–90.
PDP-2007-AlonsoGT #e-commerce #quality #scheduling #thread: Differentiated Quality of Service for e-Commerce Applications through Connection Scheduling based on System-Level Thread Priorities (JA, JG, JT), pp. 72–76.
PPoPP-2007-JohnsonEV #composition #empirical #optimisation #thread: Speculative thread decomposition through empirical optimization (TAJ, RE, TNV), pp. 205–214.
PPoPP-2007-KejariwalTGLKBNVP #analysis #cpu #performance #specification #thread #using: Tight analysis of the performance potential of thread speculation using spec CPU 2006 (AK, XT, MG, WL, SK, UB, AN, AVV, CDP), pp. 215–225.
PPoPP-2007-MuhlenfeldW #c++ #detection #fault #multi #thread: Fault detection in multi-threaded c++ server applications (AM, FW), pp. 142–143.
PPoPP-2007-SaraswatSP #architecture #named #programming: X10: concurrent programming for modern architectures (VAS, VS, CvP), p. 271.
PPoPP-2007-UpadhyayaPM: Expressing and exploiting concurrency in networked applications with aspen (GU, VSP, SPM), pp. 13–23.
PPoPP-2007-ZhangSZSG: Optimized lock assignment and allocation: a method for exploiting concurrency among critical sections (YZ, VCS, WZ, VS, GRG), pp. 146–147.
SOSP-2007-KluesHLWCGL #energy: Integrating concurrency control and energy management in device drivers (KK, VH, CL, AW, DEC, DG, PL), pp. 251–264.
SOSP-2007-LuPHMJLPZ #automation #correlation #debugging #detection #multi #named #semantics: MUVI: automatically inferring multi-variable access correlations and detecting related semantic and concurrency bugs (SL, SP, CH, XM, WJ, ZL, RAP, YZ), pp. 103–116.
ESOP-2007-AcciaiBD #calculus #transaction: A Concurrent Calculus with Atomic Transactions (LA, MB, SDZ), pp. 48–63.
ESOP-2007-FengFS #logic #on the #reasoning: On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning (XF, RF, ZS), pp. 173–188.
ESOP-2007-SuenagaK #analysis #calculus #type system: Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts (KS, NK), pp. 490–504.
FASE-2007-SanchezSM #distributed #product line #protocol: A Family of Distributed Deadlock Avoidance Protocols and Their Reachable State Spaces (CS, HBS, ZM), pp. 155–169.
TACAS-2007-FarzanM #analysis #data flow #source code: Causal Dataflow Analysis for Concurrent Programs (AF, PM), pp. 102–116.
TACAS-2007-HerbreteauST: Unfolding Concurrent Well-Structured Transition Systems (FH, GS, TQT), pp. 706–720.
CAV-2007-KahlonYSG #detection #performance #source code: Fast and Accurate Static Data-Race Detection for Concurrent Programs (VK, YY, SS, AG), pp. 226–239.
ICLP-2007-FalaschiOPV #constraints #declarative #source code: Declarative Diagnosis of Temporal Concurrent Constraint Programs (MF, CO, CP, FV), pp. 271–285.
ICLP-2007-Naish #analysis: Resource-Oriented Deadlock Analysis (LN), pp. 302–316.
ICLP-2007-OlartePV #constraints #programming: Universal Timed Concurrent Constraint Programming (CO, CP, FV), pp. 464–465.
ISSTA-2007-TzorefUY #automation #debugging: Instrumenting where it hurts: an automatic concurrent debugging technique (RT, SU, EYT), pp. 27–38.
ICALP-v2-2006-EtessamiY #game studies #probability #recursion: Recursive Concurrent Stochastic Games (KE, MY), pp. 324–335.
ICFP-2006-DowseB #modelling: Modelling deterministic concurrent I/O (MD, AB), pp. 148–159.
ICFP-2006-Shapiro #proving #source code: Practical proofs of concurrent programs (MS), p. 123.
ICFP-2006-ZiarekSJ #abstraction #composition #functional #named #source code: Stabilizers: a modular checkpointing abstraction for concurrent functional programs (LZ, PS, SJ), pp. 136–147.
ICEIS-ISAS-2006-ChengX #approach #behaviour #detection #formal method #online: A Formal Approach to Detecting Shilling Behaviors in Concurrent Online Auctions (YTC, HX), pp. 375–381.
ICPR-v1-2006-CaparG #performance #recognition #segmentation: Concurrent Segmentation and Recognition with Shape-Driven Fast Marching Methods (AÇ, MG), pp. 155–158.
ICPR-v1-2006-GimelfarbLMD #image: Concurrent Stereo under Photometric Image Distortions (GLG, JL, JM, PD), pp. 111–114.
SEKE-2006-Sarna-StarostaSD #approach #modelling #multi #thread: A Model-based Design-for-Verification Approach to Checking for Deadlock in Multi-threaded Applications (BSS, REKS, LKD), pp. 120–125.
SIGIR-2006-ShenYSC #detection #thread: Thread detection in dynamic text message streams (DS, QY, JTS, ZC), pp. 35–42.
ECOOP-2006-Yonezawa #mobile: Early Concurrent/Mobile Objects (AY), pp. 198–202.
LOPSTR-2006-MusuvathiQ #named #testing: CHESS: Systematic Stress Testing of Concurrent Software (MM, SQ), pp. 15–16.
PLDI-2006-KermanyP #incremental #parallel: The Compressor: concurrent, incremental, and parallel compaction (HK, EP), pp. 354–363.
PLDI-2006-NaikAW #detection #effectiveness #java: Effective static race detection for Java (MN, AA, JW), pp. 308–319.
PLDI-2006-PratikakisFH #analysis #correlation #detection #named: LOCKSMITH: context-sensitive correlation analysis for race detection (PP, JSF, MWH), pp. 320–331.
PLDI-2006-VechevYB #algorithm #garbage collection: Correctness-preserving derivation of concurrent garbage collection algorithms (MTV, EY, DFB), pp. 341–353.
QAPL-2006-Bortolussi #constraints #probability #programming: Stochastic Concurrent Constraint Programming (LB), pp. 65–80.
ASE-2006-EstublierG #re-engineering: Concurrent Engineering support in Software Engineering (JE, SG), pp. 209–220.
ICSE-2006-Gomaa #design #distributed #realtime #uml: Designing concurrent, distributed, and real-time applications with UML (HG), pp. 1059–1060.
ICSE-2006-PettitG #behaviour #design pattern #modelling: Modeling behavioral design patterns of concurrent objects (RGPI, HG), pp. 202–211.
ICSE-2006-StrooperW #component #java #testing: Testing concurrent java components (PAS, LW), pp. 1075–1076.
SAC-2006-LiH #multi #thread: A concurrent reactive Esterel processor based on multi-threading (XL, RvH), pp. 912–917.
SAC-2006-RuizCCP #algebra #analysis #e-commerce #process #protocol #set #using: Analysis of the SET e-commerce protocol using a true concurrency process algebra (MCR, DC, FC, JJP), pp. 879–886.
GPCE-2006-DouenceBNS #aspect-oriented: Concurrent aspects (RD, DLB, JN, MS), pp. 79–88.
ASPLOS-2006-LiBH #embedded #multi #thread: Mapping esterel onto a multi-threaded embedded processor (XL, MB, RvH), pp. 303–314.
CASE-2006-XingTXH #complexity #flexibility #policy #polynomial: Optimal Polynomial Complexity Deadlock Avoidance Policies for Manufacturing Systems with Flexible Routings (KX, FT, HX, BH), pp. 448–453.
DAC-2006-LiZJ #named #network #proximity: DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip (ML, QAZ, WBJ), pp. 849–852.
DATE-2006-AlmukhaizimM #detection #fault: Berger code-based concurrent error detection in asynchronous burst-mode machines (SA, YM), pp. 71–72.
DATE-2006-HosseinabadyBBN #testing: A concurrent testing method for NoC switches (MH, AB, MNB, ZN), pp. 1171–1176.
DATE-2006-KulkarniB #framework #memory management #platform #thread: Memory centric thread synchronization on platform FPGAs (CK, GJB), pp. 959–964.
DATE-2006-Stanley-MarbellLR #adaptation #embedded #library #multi #thread: Adaptive data placement in an embedded multiprocessor thread library (PSM, KL, AR), pp. 698–699.
DATE-2006-ZengI #testing #using: Concurrent core test for SOC using shared test set and scan chain disable (GZ, HI), pp. 1045–1050.
HPCA-2006-GontmakherMSS #thread: Speculative synchronization and thread management for fine granularity threads (AG, AM, AS, GS), pp. 278–287.
HPCA-2006-KumarA #detection #fault #performance: Reducing resource redundancy for concurrent error detection techniques in high performance microprocessors (SK, AA), pp. 212–221.
HPCA-2006-Prvulovic #detection #effectiveness #named: CORD: cost-effective (and nearly overhead-free) order-recording and data race detection (MP), pp. 232–243.
LCTES-2006-ZhuangP #analysis #compilation #effectiveness #network #thread: Effective thread management on network processors with compiler analysis (XZ, SP), pp. 72–82.
PDP-2006-PrietoVFC #algorithm #distributed: An O(n) Distributed Deadlock Resolution Algorithm (MP, JEV, FF, AC), pp. 48–55.
PPoPP-2006-ManassievMA #clustering #distributed #memory management #transaction: Exploiting distributed version concurrency in a transactional memory cluster (KM, MM, CA), pp. 198–208.
PPoPP-2006-WangS #detection #fault #performance #runtime #source code: Accurate and efficient runtime detection of atomicity errors in concurrent programs (LW, SDS), pp. 137–146.
FASE-2006-AichernigD #fault #testing: From Faults Via Test Purposes to Test Cases: On the Fault-Based Testing of Concurrent Systems (BKA, CCD), pp. 324–338.
TACAS-2006-ChakiCKRT #c #message passing #recursion #source code #verification: Verifying Concurrent Message-Passing C Programs with Recursive Calls (SC, EMC, NK, TWR, TT), pp. 334–349.
TACAS-2006-DwyerHHRRW #effectiveness #object-oriented #reduction #slicing #source code: Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs (MBD, JH, MH, VPR, R, TW), pp. 73–89.
TACAS-2006-GhicaM #composition #higher-order #source code: Compositional Model Extraction for Higher-Order Concurrent Programs (DRG, ASM), pp. 303–317.
CAV-2006-BurckhardtAM #bound #case study #data type #memory management #model checking #modelling: Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study (SB, RA, MMKM), pp. 489–502.
CAV-2006-ColvinGLM #algorithm #lazy evaluation #set #verification: Formal Verification of a Lazy Concurrent List-Based Set Algorithm (RC, LG, VL, MM), pp. 475–488.
CAV-2006-KahlonGS #model checking #on the fly #partial order #source code #transaction #using: Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions (VK, AG, NS), pp. 286–299.
CSL-2006-Chatterjee #game studies: Concurrent Games with Tail Objectives (KC), pp. 256–270.
ICLP-2006-LopezPPRV #constraints #declarative #framework #programming #security: A Declarative Framework for Security: Secure Concurrent Constraint Programming (HAL, CP, JAP, CR, FDV), pp. 449–450.
LICS-2006-HaymanW #independence #logic: Independence and Concurrent Separation Logic (JH, GW), pp. 147–156.
TestCom-2006-CsorbaPDC #analysis #performance: Performance Analysis of Concurrent PCOs in TTCN-3 (MJC, SP, SD, GC), pp. 149–160.
CBSE-2005-BehrendsSD #component #design #multi #thread: A Component-Oriented Model for the Design of Safe Multi-threaded Applications (RB, REKS, LKD), pp. 251–266.
IWPC-2005-Reiss05a #java #monitoring #performance #thread: Efficient Monitoring and Display of Thread State in Java (SPR), pp. 247–256.
ICALP-2005-CrescenzoV: Concurrent Zero Knowledge in the Public-Key Model (GDC, IV), pp. 816–827.
ICALP-2005-JainHT #problem: The Generalized Deadlock Resolution Problem (KJ, MTH, KT), pp. 853–865.
ICALP-2005-PersianoV #constant: Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds (GP, IV), pp. 228–240.
FM-2005-CampbellGNSTV #object-oriented #specification #testing: Testing Concurrent Object-Oriented Systems with Spec Explorer (CC, WG, LN, WS, NT, MV), pp. 542–547.
SEFM-2005-JacobsPLS #invariant: Safe Concurrency for Aggregate Objects with Invariants (BJ, FP, KRML, WS), pp. 137–147.
SEFM-2005-JinH #process #towards: Towards A Truly Concurrent Model for Processes Sharing Resources (NJ, JH), pp. 231–239.
ICFP-2005-FengS #assembly #composition #termination #thread #verification: Modular verification of concurrent assembly code with dynamic thread creation and termination (XF, ZS), pp. 254–267.
IFL-2005-HuchK #composition #haskell #implementation #memory management #transaction: A High-Level Implementation of Composable Memory Transactions in Concurrent Haskell (FH, FK), pp. 124–141.
ICEIS-v1-2005-KaurSS #algorithm #database #distributed #multi: Secure Concurrency Control Algorithm for Multilevel Secure Distributed Database Systems (NK, RS, HKS), pp. 267–272.
ICML-2005-RohanimaneshM #approach #generative #markov #named #process: Coarticulation: an approach for generating concurrent plans in Markov decision processes (KR, SM), pp. 720–727.
SEKE-2005-VoP #detection #java: A Deadlock Detector for Synchronous Java (DDV, CP), pp. 537–542.
ECOOP-2005-RodriguezDFHLR #composition #ml #multi #source code #specification #thread #verification: Extending JML for Modular Specification and Verification of Multi-threaded Programs (ER, MBD, CF, JH, GTL, R), pp. 551–576.
ECOOP-2005-VechevBCG #evaluation: Derivation and Evaluation of Concurrent Collectors (MTV, DFB, PC, DG), pp. 577–601.
ECOOP-2005-WilliamsTE #detection #java #library: Static Deadlock Detection for Java Libraries (AW, WT, MDE), pp. 602–629.
PLDI-2005-ElmasTQ #detection #named #runtime #source code #verification: VYRD: verifYing concurrent programs by runtime refinement-violation detection (TE, ST, SQ), pp. 27–37.
PPDP-2005-LopezPPW #linear #logic programming #monad: Monadic concurrent linear logic programming (PL, FP, JP, KW), pp. 35–46.
RE-2005-SongMHRN #named #process #prototype #requirements #workflow: S-RaP: A Concurrent Prototyping Process for Refining Workflow-Oriented Requirements (XS, GM, BH, AR, CN), pp. 416–420.
ASE-2005-AgarwalSWS #detection #runtime #using: Optimized run-time race detection and atomicity checking using partial discovered types (RA, AS, LW, SDS), pp. 233–242.
ASE-2005-Betin-CanBLLT #design #verification: Application of design for verification with concurrency controllers to air traffic control software (ABC, TB, ML, BL, ST), pp. 14–23.
LDTA-2005-CassidyCDD #analysis: Source Transformation for Concurrency Analysis (TC, JRC, TRD, JD), pp. 57–75.
CASE-2005-WeiL #policy #programming #using: A deadlock prevention policy for FMS using mathematical programming (NW, ZL), pp. 399–403.
CC-2005-PazPB #garbage collection: Age-Oriented Concurrent Garbage Collection (HP, EP, SMB), pp. 121–136.
CGO-2005-NandivadaD: Compile-Time Concurrent Marking Write Barrier Removal (VKN, DD), pp. 37–48.
DAC-2005-ChenDHSW #analysis #design #simulation: Simulation based deadlock analysis for system level designs (XC, AD, HH, ALSV, YW), pp. 260–265.
DAC-2005-SahooJIDE #multi #reachability #thread: Multi-threaded reachability (DS, JJ, SKI, DLD, EAE), pp. 467–470.
DATE-2005-AlmukhaizimM #detection #fault: Concurrent Error Detection in Asynchronous Burst-Mode Controllers (SA, YM), pp. 1272–1277.
DATE-2005-CarterOS #fault #modelling #testing: Circuit-Level Modeling for Concurrent Testing of Operational Defects due to Gate Oxide Breakdown (JRC, SO, DJS), pp. 300–305.
DATE-2005-Dean #integration #realtime #synthesis #thread: Software Thread Integration and Synthesis for Real-Time Applications (AGD), pp. 68–69.
DATE-2005-RosselloCBKS #performance: A Fast Concurrent Power-Thermal Model for Sub-100nm Digital ICs (JLR, VC, SAB, AK, JS), pp. 206–211.
LCTES-2005-SoD #integration #pipes and filters #thread: Complementing software pipelining with software thread integration (WS, AGD), pp. 137–146.
PPoPP-2005-PrabhuO #parallel #specification #thread: Exposing speculative thread parallelism in SPEC2000 (MKP, KO), pp. 142–152.
WRLA-2004-CiobanuL05 #communication: Communicating Concurrent Objects in HiddenCCS (GC, DL), pp. 353–373.
WRLA-2004-JohnsenOA05 #runtime: A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls (EBJ, OO, EWA), pp. 375–392.
FASE-2005-RodriguesRU #component #predict #reliability #using: Using Scenarios to Predict the Reliability of Concurrent Component-Based Software Systems (GNR, DSR, SU), pp. 111–126.
STOC-2005-KalaiLP #composition #protocol: Concurrent general composition of secure protocols in the timing model (YTK, YL, MP), pp. 644–653.
TACAS-2005-QadeerR #bound #model checking: Context-Bounded Model Checking of Concurrent Software (SQ, JR), pp. 93–107.
CAV-2005-BarnerGR #debugging #formal method #named #using: Wolf — Bug Hunter for Concurrent Software Using Formal Methods (SB, ZG, IR), pp. 153–157.
CAV-2005-PastorPS #named #verification: TRANSYT: A Tool for the Verification of Asynchronous Concurrent Systems (EP, MAP, MS), pp. 424–428.
CAV-2005-RabinovitzG #bound #model checking #source code: Bounded Model Checking of Concurrent Programs (IR, OG), pp. 82–97.
FATES-2005-XieD #approach #testing: Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach (GX, ZD), pp. 170–186.
ICLP-2005-Bortolussi #optimisation: Concurrent Methodologies for Global Optimization (LB), pp. 441–443.
ICLP-2005-BortolussiW #constraints #distributed #probability #programming language: A Distributed and Probabilistic Concurrent Constraint Programming Language (LB, HW), pp. 143–158.
ICLP-2005-Haemmerle #constraints #linear #programming: SiLCC Is Linear Concurrent Constraint Programming (RH), pp. 448–449.
ICLP-2005-Santos #logic #semantics #transaction #using: Denotational Semantics Using Horn Concurrent Transaction Logic (MVS), pp. 431–432.
LICS-2005-FaggianM #game studies #interactive: Ludics Nets, a game Model of Concurrent Interaction (CF, FM), pp. 376–385.
LICS-2005-Winskel: Relations in Concurrency (GW), pp. 2–11.
VMCAI-2005-AttieC #scalability #source code: Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs (PCA, HC), pp. 465–481.
WICSA-2004-PettitG #architecture #behaviour #modelling #petri net #using: Modeling Behavioral Patterns of Concurrent Software Architectures Using Petri Nets (RGPI, HG), pp. 57–68.
ITiCSE-2004-Ben-Ari #education #tool support: A suite of tools for teaching concurrency (MBA), p. 251.
ICSM-2004-Krinke04a #slicing #source code: Advanced Slicing of Sequential and Concurrent Programs (JK), pp. 464–468.
ICALP-2004-GhicaMO: Syntactic Control of Concurrency (DRG, ASM, CHLO), pp. 683–694.
IFM-2004-CiobanuL #specification #verification: Specification and Verification of Synchronizing Concurrent Objects (GC, DL), pp. 307–327.
IFM-2004-WildmanDS #component #testing: Viewpoint-Based Testing of Concurrent Components (LW, RD, PAS), pp. 501–520.
SEFM-2004-JohnsenO #communication #distributed: An Asynchronous Communication Model for Distributed Concurrent Objects (EBJ, OO), pp. 188–197.
SEFM-2004-WuY #ambiguity #refinement #towards: Towards Action Refinement for Concurrent Systems with Causal Ambiguity (JW, HY), pp. 300–309.
Haskell-2004-MarlowJT #haskell #interface: Extending the Haskell foreign function interface with concurrency (SM, SLPJ, WT), pp. 22–32.
ICFP-2004-ChristiansenH #debugging #haskell #source code: Searching for deadlocks while debugging concurrent haskell programs (JC, FH), pp. 28–39.
ICFP-2004-YuS #assembly #safety #verification: Verification of safety properties for concurrent assembly code (DY, ZS), pp. 175–188.
IFL-2004-DowseBE #functional #reasoning: Reasoning About Deterministic Concurrent Functional I/O (MD, AB, MCJDvE), pp. 177–194.
CHI-2004-WigdorB #comparison #mobile: A comparison of consecutive and concurrent input text entry techniques for mobile phones (DW, RB), pp. 81–88.
LSO-2004-GoethalsVLS #development #framework: A Framework for Managing Concurrent Business and ICT Development (FGG, JV, WL, MS), pp. 131–136.
UML-2004-GoniE #ocl #precise #uml #using: Building Precise UML Constructs to Model Concurrency Using OCL (AG, YE), pp. 212–225.
TOOLS-USA-2003-Silva04 #approach #object-oriented #programming: Concurrent Object-Oriented Programming: The MP-Eiffel Approach (MOeS), pp. 97–124.
ECOOP-2004-VitenbergKS #database #program analysis #using: Increasing Concurrency in Databases Using Program Analysis (RV, KK, AKS), pp. 341–363.
ECOOP-2004-WelcJH #monitoring #transaction: Transactional Monitors for Concurrent Objects (AW, SJ, ALH), pp. 519–542.
AdaEurope-2004-BreuerG #detection #kernel #linux: Static Deadlock Detection in the Linux Kernel (PTB, MGV), pp. 52–64.
LOPSTR-2004-Fruhwirth #multi: Specialization of Concurrent Guarded Multi-set Transformation Rules (TWF), pp. 133–148.
PDCL-2004-RoychoudhuryR #automation #verification: Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems (AR, CRR), pp. 261–290.
PLDI-2004-JohnsonEV #composition #thread: Min-cut program decomposition for thread-level speculation (TAJ, RE, TNV), pp. 59–70.
POPL-2004-QadeerRR #source code: Summarizing procedures in concurrent programs (SQ, SKR, JR), pp. 245–255.
ASE-2004-Betin-CanB #programming #using: Verifiable Concurrent Programming Using Concurrency Controllers (ABC, TB), pp. 248–257.
ASE-2004-Boulila #collaboration #distributed #modelling: Group Support for Distributed Collaborative Concurrent Software Modeling (NB), pp. 422–425.
FSE-2004-DingelL #analysis #automation #safety #source code #txl #using: Automating comprehensive safety analysis of concurrent programs using verisoft and TXL (JD, HL), pp. 13–22.
SAC-2004-RamirezS #constraints #distributed #logic programming #source code #using: Concurrent and distributed programming using constraint logic programs (RR, AES), pp. 508–509.
SAC-2004-SundellT #scalability: Scalable and lock-free concurrent dictionaries (HS, PT), pp. 1438–1445.
CC-2004-RanganathH #dependence #java #slicing #source code: Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs (VPR, JH), pp. 39–56.
DAC-2004-KapoorJ #logic #specification #synthesis: Decomposing specifications with concurrent outputs to resolve state coding conflicts in asynchronous logic synthesis (HKK, MBJ), pp. 830–833.
DATE-v1-2004-AlmukhaizimDM #bound #detection #fault #latency #on the: On Concurrent Error Detection with Bounded Latency in FSMs (SA, PD, YM), pp. 596–603.
DATE-v1-2004-ChengHP #power management #scalability: Power Minimization in a Backlit TFT-LCD Display by Concurrent Brightness and Contrast Scaling (WCC, YH, MP), pp. 252–259.
DATE-v1-2004-SrivastavaSB #design #power management: Concurrent Sizing, Vdd and Vth Assignment for Low-Power Design (AS, DS, DB), pp. 718–719.
ISMM-2004-OssiaBS #garbage collection: Mostly concurrent compaction for mark-sweep GC (YO, OBY, MS), pp. 25–36.
ISMM-2004-SagonasW #garbage collection #incremental: Message analysis-guided allocation and low-pause incremental garbage collection in a concurrent language (KFS, JW), pp. 1–12.
ISMM-2004-VechevB #garbage collection: Write barrier elision for concurrent garbage collectors (MTV, DFB), pp. 13–24.
LCTES-2004-KumarSD #integration #performance #thread: Asynchronous software thread integration for efficient software (NJK, SS, AGD), pp. 37–46.
LCTES-2004-QinRM #architecture #development #modelling #synthesis #tool support: A formal concurrency model based architecture description language for synthesis of software development tools (WQ, SR, SM), pp. 47–56.
LCTES-2004-ZengSE #dependence #generative #graph #performance: Generating fast code from concurrent program dependence graphs (JZ, CS, SAE), pp. 175–181.
ESOP-2004-OHearn #reasoning: Resources, Concurrency, and Local Reasoning (PWO), pp. 1–2.
FoSSaCS-2004-GhicaM #fine-grained #semantics: Angelic Semantics of Fine-Grained Concurrency (DRG, ASM), pp. 211–225.
CAV-2004-AndrewsQRRX #model checking #named: Zing: A Model Checker for Concurrent Software (TA, SQ, SKR, JR, YX), pp. 484–487.
ICLP-2004-Neugebauer #constraints #modelling #programming: Concurrent Constraint Programming and Tree-Based Acoustic Modelling (MN), pp. 467–468.
VMCAI-2004-HatcliffRD #model checking #object-oriented #specification #using #verification: Verifying Atomicity Specifications for Concurrent Object-Oriented Software Using Model-Checking (JH, R, MBD), pp. 175–190.
DocEng-2003-BrunDFLP #authoring #documentation #protocol #semantics: Semantically-based text authoring and the concurrent documentation of experimental protocols (CB, MD, EF, SL, SP), pp. 193–202.
ECDL-2003-SfakakisK #architecture #integration #online #resource management: An Architecture for Online Information Integration on Concurrent Resource Access on a Z39.50 Environment (MS, SK), pp. 288–299.
ICALP-2003-AlfaroF #data flow #game studies: Information Flow in Concurrent Games (LdA, MF), pp. 1038–1053.
FME-2003-AldiniB #approach #architecture #verification: A General Approach to Deadlock Freedom Verification for Software Architectures (AA, MB), pp. 658–677.
FME-2003-FenkamGJ #approach: Constructing Deadlock Free Event-Based Applications: A Rely/Guarantee Approach (PF, HCG, MJ), pp. 636–657.
SEFM-2003-DukeWL #java #modelling: Modelling Java Concurrency with Object-Z (RD, LW, BL), pp. 173–181.
OOPSLA-2003-BarabashOP #garbage collection #revisited: Mostly concurrent garbage collection revisited (KB, YO, EP), pp. 255–268.
AdaEurope-2003-EvangelistaKPR #ada #analysis #named #source code: Quasar: A New Tool for Concurrent Ada Programs Analysis (SE, CK, JFPP, PR), pp. 168–181.
PLDI-2003-PraunG #analysis #multi #object-oriented #source code #thread: Static conflict analysis for multi-threaded object-oriented programs (CvP, TRG), pp. 115–128.
POPL-2003-BouajjaniET #approach #source code #static analysis: A generic approach to the static analysis of concurrent programs with procedures (AB, JE, TT), pp. 62–73.
PPDP-2003-EchahedPS #process: Statically assuring secrecy for dynamic concurrent processes (RE, FP, WS), pp. 91–101.
SAS-2003-CarlssonSW #analysis: Message Analysis for Concurrent Languages (RC, KFS, JW), pp. 73–90.
SIGAda-2003-EvangelistaKPR #ada #linear #logic #source code #verification: Verifying linear time temporal logic properties of concurrent Ada programs with quasar (SE, CK, JFPP, PR), pp. 17–24.
ASE-2003-DengFC #database #testing #transaction: Testing Database Transaction Concurrency (YD, PGF, ZC), pp. 184–195.
ASE-2003-Roychoudhury #multi #thread: Depiction and Playout of Multi-threaded Program Executions (AR), pp. 331–336.
ASE-2003-Safranek #specification #visual notation: Visual Specification of Concurrent Systems (DS), pp. 369–372.
ESEC-FSE-2003-Krinke #slicing #source code: Context-sensitive slicing of concurrent programs (JK), pp. 178–187.
SAC-2003-BorgerRC #modelling #state machine #uml: Modeling the Meaning of Transitions from and to Concurrent States in UML State Machines (EB, ER, AC), pp. 1086–1091.
SAC-2003-Huntbach #programming language: Features of the Concurrent Programming Language Aldwych (MMH), pp. 1048–1054.
CGO-2003-ChenO #named #thread: TEST: A Tracer for Extracting Speculative Thread (MKC, KO), pp. 301–314.
DATE-2003-CassidyPT #design #multi #performance #thread: Layered, Multi-Threaded, High-Level Performance Design (ASC, JMP, DET), pp. 10954–10959.
DATE-2003-DrineasM #detection #fault #monitoring: Non-Intrusive Concurrent Error Detection in FSMs through State/Output Compaction and Monitoring via Parity Trees (PD, YM), pp. 11164–11167.
DATE-2003-PastorP #simulation #traversal #verification: Combining Simulation and Guided Traversal for the Verification of Concurrent Systems (EP, MAP), pp. 11158–11159.
HPCA-2003-AlameldeenW #architecture #multi #simulation #thread #variability: Variability in Architectural Simulations of Multi-Threaded Workloads (ARA, DAW), pp. 7–18.
HPCA-2003-GarzaranPLVRT #memory management #multi #thread #trade-off: Tradeoffs in Buffering Memory State for Thread-Level Speculation in Multiprocessors (MJG, MP, JML, VV, LR, JT), pp. 191–202.
PDP-2003-CordobaFGMV #algorithm #communication #detection #distributed: A Low Communication Cost Algorithm for Distributed Deadlock Detection and Resolution (AC, FF, JRG, JRGdM, JEV), pp. 235–242.
PPoPP-2003-KimPR #interface #network #programmable: Exploiting task-level concurrency in a programmable network interface (HyK, VSP, SR), pp. 61–72.
PPoPP-2003-OCallahanC #detection #hybrid: Hybrid dynamic data race detection (RO, JDC), pp. 167–178.
PPoPP-2003-PoznianskyS #c++ #detection #multi #on the fly #performance #source code: Efficient on-the-fly data race detection in multihreaded C++ programs (EP, AS), pp. 179–190.
PPoPP-2003-PrabhuO #parallel #thread #using: Using thread-level speculation to simplify manual parallelization (MKP, KO), pp. 1–12.
TACAS-2003-ZhangCS #analysis #functional #performance #verification: The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems (DZ, RC, EWS), pp. 431–436.
CSL-2003-AndreoliM: Concurrent Construction of Proof-Nets (JMA, LM), pp. 29–42.
ICLP-2003-DrejhammarSBH #declarative #java: Flow Java: Declarative Concurrency for Java (FD, CS, PB, SH), pp. 346–360.
ICLP-2003-Valencia #constraints: Concurrency, Time, and Constraints (FDV), pp. 72–101.
ICLP-2003-Valencia03a #constraints #decidability #ltl #programming: Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL (FDV), pp. 422–437.
ITiCSE-2002-Barros #petri net #programming #using: Specific proposals for the use of petri nets in a concurrent programming course (JPB), pp. 165–167.
SCAM-J-2001-ChenXYZ02 #ada #detection: Concurrent Ada dead statements detection (ZC, BX, HY, JZ), pp. 733–741.
SCAM-2002-Ghosh #fault #metric #object-oriented #source code #testing #towards #using: Towards Measurement of Testability of Concurrent Object-Oriented Programs Using Fault Insertion: A Preliminary Investigation (SG), pp. 17–25.
WCRE-2002-CookD #interactive #thread: Discovering Thread Interactions in a Concurrent System (JEC, ZD), p. 255–?.
IFM-2002-Smith #csp #integration #realtime #specification: An Integration of Real-Time Object-Z and CSP for Specifying Concurrent Real-Time Systems (GS), pp. 267–285.
AFP-2002-FournetFMS02 #distributed #mobile #named #programming: JoCaml: A Language for Concurrent Distributed and Mobile Programming (CF, FLF, LM, AS), pp. 129–158.
IFL-2002-BoisLT #graph #migration #parallel #reduction #thread: Thread Migration in a Parallel Graph Reducer (ARDB, HWL, PWT), pp. 199–214.
ICPR-v2-2002-Andrade-CettoS #locality #validation: Concurrent Map Building and Localization with Landmark Validation (JAC, AS), pp. 693–696.
ECOOP-2002-BentonCF #abstraction #c#: Modern Concurrency Abstractions for C^# (NB, LC, CF), pp. 415–440.
ECOOP-2002-KienzleG #aspect-oriented #named: AOP: Does It Make Sense? The Case of Concurrency and Failures (JK, RG), pp. 37–61.
AdaEurope-2002-ChenBZY #ada #analysis #dependence #source code: Static Dependency Analysis for Concurrent Ada 95 Programs (ZC, BX, JZ, HY), pp. 219–230.
AdaEurope-2002-Patino-MartinezJKA #transaction: Concurrency Control in Transactional Drago (MPM, RJP, JK, SA), pp. 309–320.
PLDI-2002-ChoiLLOSS #detection #object-oriented #parallel #performance #precise #source code #thread: Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs (JDC, KL, AL, RO, VS, MS), pp. 258–269.
PLDI-2002-OssiaBGKLO #garbage collection #incremental #parallel: A Parallel, Incremental and Concurrent GC for Servers (YO, OBY, IG, EKK, VL, AO), pp. 129–140.
PPDP-2002-NielsenPV #constraints #on the #power of #programming language: On the expressive power of temporal concurrent constraint programming languages (MN, CP, FDV), pp. 156–167.
SAS-2002-Esparza #algebra #approach #static analysis: An Algebraic Approach to the Static Analysis of Concurrent Software (JE), p. 3.
SAS-2002-SabelfeldM #communication: Securing Communication in a Concurrent Language (AS, HM), pp. 376–394.
SAS-2002-Yavuz-KahveciB #automation #verification: Automated Verification of Concurrent Linked Lists with Counters (TYK, TB), pp. 69–84.
ASE-2002-CalderM #automation #communication #process #verification: Automatic Verification of any Number of Concurrent, Communicating Processes (MC, AM), pp. 227–230.
ASE-2002-DiasR #component #identification: Identifying Cause & Effect Relations between Events in Concurrent Event-Based Components (MSD, DJR), pp. 245–248.
ASE-2002-Hall #java #multi #named #profiling #thread: CPPROFJ: Aspect-Capable Call Path Profiling of Multi-Threaded Java Applications (RJH), pp. 107–116.
ICSE-2002-AtiyaK #verification: A compliance notation for verifying concurrent systems (DMA, SK), pp. 731–732.
ICSE-2002-DengDHM #invariant #source code #specification #synthesis #verification: Invariant-based specification, synthesis, and verification of synchronization in concurrent programs (XD, MBD, JH, MM), pp. 442–452.
ICSE-2002-GreenhouseS #evolution #policy #source code: Assuring and evolving concurrent programs: annotations and policy (AG, WLS), pp. 453–463.
SAC-2002-GarciaF #distributed: Concurrency control for distributed cooperative engineering applications (JCG, PF), pp. 958–963.
ASPLOS-2002-MartinezT #parallel #thread: Speculative synchronization: applying thread-level speculation to explicitly parallel applications (JFM, JT), pp. 18–29.
DAC-2002-RaganSS #co-evolution #cost analysis #design #hardware: A detailed cost model for concurrent use with hardware/software co-design (DR, PS, PS), pp. 269–274.
DAC-2002-SemeriaMPESN #design #multi #thread #verification: RTL c-based methodology for designing and verifying a multi-threaded processor (LS, RM, BMP, AE, AS, DN), pp. 123–128.
DATE-2002-GericotaASF #configuration management #novel: A Novel Methodology for the Concurrent Test of Partial and Dynamically Reconfigurable SRAM-Based FPGAs (MGG, GRA, MLS, JMF), p. 1126.
DATE-2002-RezvaniP #logic: Concurrent and Selective Logic Extraction with Timing Consideration (PR, MP), p. 1086.
DATE-2002-SavoiuSG #automation #modelling #performance #simulation: Automated Concurrency Re-Assignment in High Level System Models for Efficient System-Level Simulation (NS, SKS, RKG), pp. 875–881.
HPCA-2002-JamiesonB #clustering #memory management #named #thread: CableS: Thread Control and Memory Management Extensions for Shared Virtual Memory Clusters (PJ, AB), pp. 263–274.
HPCA-2002-SteffanCZM #communication #thread: Improving Value Communication for Thread-Level Speculation (JGS, CBC, AZ, TCM), pp. 65–75.
ISMM-2002-JohanssonSW #architecture #message passing #using: Heap architectures for concurrent languages using message passing (EJ, KFS, JW), pp. 195–206.
PDP-2002-Le #detection #distributed #performance: Fast Detection and Resolution of Generalized Distributed Deadlock (SL), pp. 429–436.
ESOP-2002-BistarelliMR #constraints #programming: Soft Concurrent Constraint Programming (SB, UM, FR), pp. 53–67.
FoSSaCS-2002-BoerGM #constraints #correctness #proving #source code: Proving Correctness of Timed Concurrent Constraint Programs (FSdB, MG, MCM), pp. 37–51.
STOC-2002-Goldreich #revisited: Concurrent zero-knowledge with timing, revisited (OG), pp. 332–340.
TACAS-2002-GunterP #debugging: Temporal Debugging for Concurrent Systems (ELG, DP), pp. 431–444.
ICLP-2002-BockmayrC #biology #constraints #hybrid #programming #using: Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems (AB, AC), pp. 85–99.
ISSTA-2002-ChoiZ #thread: Isolating failure-inducing thread schedules (JDC, AZ), pp. 210–220.
ISSTA-2002-Yavuz-KahveciB #component #specification #synthesis #verification: Specification, verification, and synthesis of concurrency control components (TYK, TB), pp. 169–179.
LICS-2002-JeffreyR #semantics #testing: A Fully Abstract May Testing Semantics for Concurrent Objects (AJ, JR), pp. 101–112.
VLDB-2001-ChaHKK #in memory #multi: Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems (SKC, SH, KK, KK), pp. 181–190.
ITiCSE-2001-Barros #petri net #programming: Use petri nets to improve your concurrent programming course (JPB), p. 192.
ICSM-2001-CookHM #behaviour: Measuring Behavioral Correspondence to a Timed Concurrent Model (JEC, CH, CM), pp. 332–341.
ICSM-2001-EveraarsAK #coordination #source code #using: Using Coordination to Restructure Sequential Source Code into a Concurrent Program (CTHE, FA, BK), p. 342–?.
ICSM-2001-ZhaoCU #dependence #logic programming #source code: A Program Dependence Model for Concurrent Logic Programs and its Applications (JZ, JC, KU), pp. 672–681.
SCAM-2001-ChenXY #detection #source code: Detecting Dead Statements for Concurrent Programs (ZC, BX, HY), pp. 67–74.
ICALP-2001-BoudolC #source code: Noninterference for Concurrent Programs (GB, IC), pp. 382–395.
SVIS-2001-Mehner #debugging #java #named #source code #uml #visualisation: JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs (KM), pp. 163–175.
CIKM-2001-XiaKCRB #data access #database #in memory #memory management #version control: Dynamic Versioning Concurrency Control for Index-Based Data Access in Main Memory Database Systems (YX, SHK, SKC, KWR, HYB), pp. 550–552.
UML-2001-SendallS #behaviour #constraints #ocl #specification #uml #using: Specifying Concurrent System Behavior and Timing Constraints Using OCL and UML (SS, AS), pp. 391–405.
ECOOP-2001-BaconR: Concurrent Cycle Collection in Reference Counted Systems (DFB, VTR), pp. 207–235.
OOPSLA-2001-PraunG #detection: Object Race Detection (CvP, TRG), pp. 70–82.
TOOLS-EUROPE-2001-Meyer01c #object-oriented #programming: Concurrent Object-Oriented Programming (BM), p. 203.
TOOLS-USA-2001-Brosgol #ada #comparison #java #overview #programming #realtime: A Survey and Comparison of Concurrency and Real-Time Programming Support in Java, Ada, and Posix (BMB), p. 362.
TOOLS-USA-2001-Holmes #java #programming: Concurrent O-O Programming in Java (DH), p. 359.
TOOLS-USA-2001-Stal01a #design pattern #distributed: Design Patterns for Concurrent and Distributed Objects (MS), p. 361.
AdaEurope-2001-Sanden #design pattern #process #state machine: A Design Pattern for State Machines and Concurrent Activities (BS), pp. 203–214.
POPL-2001-Yahav #java #logic #safety #source code #using #verification: Verifying safety properties of concurrent Java programs using 3-valued logic (EY), pp. 27–40.
QAPL-2001-Fruhwirth #analysis #automation #complexity #source code: As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs (TWF), pp. 185–206.
SAS-2001-BertranBCN #communication #imperative #parallel #source code: Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs (MB, FXB, AC, MN), pp. 20–39.
ASE-2001-GrosuLSSY #automation #re-engineering #using: Automated Software Engineering Using Concurrent Class Machines (RG, YAL, SAS, SDS, JY), p. 297–?.
ASE-2001-InverardiS #architecture #component #synthesis: Connectors Synthesis for Deadlock-Free Component-Based Architectures (PI, SS), p. 174–?.
ASE-2001-LongHS #java #monitoring: A Concurrency Test Tool for Java Monitors (BL, DH, PAS), pp. 421–425.
ASE-2001-Romanovsky #model checking #realtime: Model-Checking Real-Time Concurrent Systems (IR), p. 439.
ESEC-FSE-2001-InverardiT #automation #synthesis: Automatic synthesis of deadlock free connectors for COM/DCOM applications (PI, MT), pp. 121–131.
ESEC-FSE-2001-KavehE #detection #object-oriented: Deadlock detection in distribution object systems (NK, WE), pp. 44–51.
ICSE-2001-Gomaa01a #design #distributed #realtime #uml: Designing Concurrent, Distributed, and Real-Time Applications with UML (HG), pp. 737–738.
SAC-2001-WahlsL #algorithm #constraints #modelling #semantics #source code #specification: Formal semantics of an algorithm for translating model-based specifications to concurrent constraint programs (TW, GTL), pp. 567–575.
DAC-2001-KarriWMK #detection #fault #symmetry: Concurrent Error Detection of Fault-Based Side-Channel Cryptanalysis of 128-Bit Symmetric Block Ciphers (RK, KW, PM, YK), pp. 579–585.
DATE-2001-GajskiVRGBPECJ #specification: C/C++: progress or deadlock in system-level specification (DG, EV, WR, VG, DB, JP, SEE, PC, GGdJ), pp. 136–137.
DATE-2001-WongMYCMPCLV #summary: Task concurrency management methodology summary (CW, PM, PY, FC, HDM, ASP, NC, RL, DV), p. 813.
DATE-2001-ZolfyMN #adaptation #fault #simulation: Adaptation of an event-driven simulation environment to sequentially propagated concurrent fault simulation (MZ, SM, ZN), p. 823.
HPDC-2001-JardineSC: Livelock Avoidance for Meta-Schedulers (JJ, QS, MJC), pp. 141–146.
LCTES-OM-2001-PyaraliSCS #corba #optimisation #realtime #thread: Evaluating and Optimizing Thread Pool Strategies for Real-Time CORBA (IP, MS, RC, DCS), pp. 214–222.
PDP-2001-LerouxE #execution #named #object-oriented #representation #visualisation: COOPE: A Tool for Representing Concurrent Object-Oriented Program Execution through Visualisation (HL, CE), pp. 71–76.
FASE-2001-InverardiU #component #programming #proving: Proving Deadlock Freedom in Component-Based Programming (PI, SU), pp. 60–75.
STOC-2001-CanettiKPR #black box: Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.
STOC-2001-KilianP: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (JK, EP), pp. 560–569.
CAV-2001-LeuckerN #framework #named #parallel #platform #verification: Truth/SLC — A Parallel Verification Platform for Concurrent Systems (ML, TN), pp. 255–259.
ICLP-2001-Ueda #constraints: A Close Look at Constraint-Based Concurrency (KU), p. 9.
VLDB-2000-Taylor: Concurrency in the Data Warehouse (RT), pp. 724–727.
ITiCSE-2000-Exton #comprehension #execution #named #object-oriented: Elucidate: a tool to aid comprehension of concurrent object oriented execution (CE), pp. 33–36.
IFM-2000-KlaudelP #composition #petri net #semantics: A Concurrent and Compositional Petri Net Semantics of Preemption (HK, FP), pp. 318–337.
IFL-2000-Hammond #behaviour #bound: The Dynamic Properties of Hume: A Functionally-Based Concurrent Language with Bounded Time and Space Behaviour (KH), pp. 122–139.
EDOC-2000-SuLMLL #distributed #documentation #integration: Distributed and Concurrent Processing of Business Object Documents in Support of e-Enterprise Integration (SYWS, YL, JM, ML, HL), p. 107–?.
ICEIS-2000-VarvalhoANKCBR #nondeterminism #validation: Concurrent Validation in the Treatment of Uncertainty in a Expert System (LFdC, FMdA, SMN, CK, HJTdC, CTB, FR), pp. 102–107.
ICPR-v1-2000-CufiMFM #algorithm: A Concurrent Region Growing Algorithm Guided by Circumscribed Contours (XC, XM, JF, JM), pp. 1432–1435.
KR-2000-Giunchiglia #constraints #nondeterminism #satisfiability: Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism (EG), pp. 657–666.
KR-2000-IocchiNR #framework #implementation #logic: Planning with sensing, concurrency, and exogenous events: logical framework and implementation (LI, DN, RR), pp. 678–689.
UML-2000-MizunoSN #approach #source code #uml: A Structured Approach to Develop Concurrent Programs in UML (MM, GS, MLN), pp. 451–465.
OOPSLA-2000-BuhrHLC #object-oriented #realtime: Object-oriented real-time concurrency (PAB, ASH, PEL, JC), pp. 29–46.
TOOLS-ASIA-2000-ZhengZYW #compilation #design #hybrid #java #virtual machine: A Java Virtual Machine Design Based on Hybrid Concurrent Compilation Model (WZ, FZ, BY, YW), pp. 18–23.
TOOLS-EUROPE-2000-HolmesL #java #object-oriented #programming: Introduction to Concurrent Object-Oriented Programming in Java (DH, DL), p. 457.
TOOLS-EUROPE-2000-HolmesL00a #design #java #object-oriented #source code: Designing Concurrent Object-Oriented Programs in Java (DH, DL), p. 461.
TOOLS-USA-2000-Khwaja #embedded #multi #testing #thread #validation: An MFC Based Multi-Threaded Test Environment for the Validation of an Embedded Automotive Microcontroller (AAK), pp. 15–24.
PADL-2000-Schulte #combinator #constraints #programming: Programming Deep Concurrent Constraint Combinators (CS), pp. 215–229.
PLDI-2000-FlanaganF #detection #java #type system: Type-based race detection for Java (CF, SNF), pp. 219–232.
PPDP-2000-Fages #constraints #linear #logic #programming: Concurrent constraint programming and linear logic (FF), p. 44.
PPDP-2000-PierroW #abstract interpretation #constraints #probability #programming #towards: Concurrent constraint programming: towards probabilistic abstract interpretation (ADP, HW), pp. 127–138.
SAS-2000-UngureanuJ #analysis #java: Concurrency Analysis for Java (CU, SJ), pp. 413–432.
FSE-2000-BehrendsS #approach #composition #reliability #source code: The universe model: an approach for improving the modularity and reliability of concurrent programs (RB, KS), pp. 20–29.
ICSE-2000-Iosif #java #verification: Formal verification applied to Java concurrent software (RI), pp. 707–709.
SAC-2000-Jimenez-PerisPA #transaction: Concurrent Transactional Replicated Servers (RJP, MPM, SA), pp. 655–660.
SAC-2000-LohHTN #database #hybrid #mobile: A Hybrid Method for Concurrent Updates on Disconnected Databases in Mobile Computing Environments (YHL, TH, MT, SN), pp. 563–565.
SAC-2000-MillerS #csp #process: Eclectic CSP: A Language of Concurrent Processes (QM, BS), pp. 840–842.
ASPLOS-2000-FlautnerURM #interactive #parallel #performance #thread: Thread Level Parallelism and Interactive Performance of Desktop Applications (KF, RU, SKR, TNM), pp. 129–138.
DAC-2000-KatagiriYKHT #communication #hardware #implementation #multi #protocol: Hardware implementation of communication protocols modeled by concurrent EFSMs with multi-way synchronization (HK, KY, AK, TH, KT), pp. 762–767.
DATE-2000-VardanianM #detection #fault: Improving the Error Detection Ability of Concurrent Checkers by Observation Point Insertion in the Circuit Under Check (VAV, LBM), p. 762.
ISMM-2000-HeilS #garbage collection #profiling: Concurrent Garbage Collection UsingHardware-Assisted Profiling (THH, JES), pp. 80–93.
ISMM-2000-PlakalF #garbage collection #parallel #slicing #thread #using: Concurrent Garbage Collection Using Program Slices on Multithreaded Processors (MP, CNF), pp. 94–100.
ISMM-2000-Steensgaard #multi #source code #thread: Thread-Specific Heaps for Multi-Threaded Programs (BS), pp. 18–24.
LCTES-2000-JeongKL #multi #realtime #using: Optimistic Secure Real-Time Concurrency Control Using Multiple Data Version (BSJ, DK, SL), pp. 33–47.
FoSSaCS-2000-Pinto #automaton #interactive: Sequential and Concurrent Abstract Machines for Interaction Nets (JSP), pp. 267–282.
TACAS-2000-Bultan #constraints #evaluation #model checking: BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems (TB), pp. 441–455.
CADE-2000-Gillard #calculus #formal method: A Formalization of a Concurrent Object Calculus up to alpha-Conversion (GG), pp. 417–432.
CL-2000-GilbertP #constraints #process #programming: Concurrent Constraint Programming with Process Mobility (DRG, CP), pp. 463–477.
CSL-2000-Bradfield #independence #logic #named: Independence: Logics and Concurrency (JCB), pp. 247–261.
ISSTA-2000-NandaR #slicing #source code: Slicing concurrent programs (MGN, SR), pp. 180–190.
LICS-2000-AlfaroH #game studies: Concurrent ω-Regular Games (LdA, TAH), pp. 141–154.
LICS-2000-JeffreyR #bisimulation #formal method #ml: A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names (AJ, JR), pp. 311–321.
TestCom-2000-PetrenkoU #testing #verification: Verification and Testing of Concurrent Systems with Action Races (AP, AU), pp. 261–280.
PODS-1999-SchuldtAS #process #transaction: Concurrency Control and Recovery in Transactional Process Management (HS, GA, HJS), pp. 316–326.
SIGMOD-1999-ChakrabartiM #data access #multi #performance: Efficient Concurrency Control in Multidimensional Access Methods (KC, SM), pp. 25–36.
SIGMOD-1999-ShanmugasundaramNSR #performance: Efficient Concurrency Control for Broadcast Environments (JS, AN, RMS, KR), pp. 85–96.
ITiCSE-1999-Ben-AriK #learning #parallel #process: Thinking parallel: the process of learning concurrency (MBA, YBDK), pp. 13–16.
ICSM-1999-ChungKBKL #source code #specification #testing: Testing of Concurrent Programs After Specification Changes (ISC, HSK, HSB, YRK, DGL), p. 199–?.
IWPC-1999-Zhao #java #slicing #source code: Slicing Concurrent Java Programs (JZ), pp. 126–133.
FM-v1-1999-PaigeH #object-oriented #realtime #specification: Bunches for Object-Oriented, Concurrent, and Real-Time Specification (RFP, ECRH), pp. 530–550.
FM-v2-1999-BoerHR #approach #paradigm #semantics: Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach (FSdB, UH, WPdR), pp. 1245–1265.
FM-v2-1999-PoizatCR #approach #automaton #requirements: From Informal Requirements to COOP: A Concurrent Automata Approach (PP, CC, JCR), pp. 939–962.
IFM-1999-Paige #communication #refinement #specification #using: Specification and Refinement using a Heterogeneous Notation for Concurrency and Communication (RFP), pp. 353–372.
HCI-CCAD-1999-TornbergV #process #using: Concurrent engineering activities using videophone communications (VT, SV), pp. 256–260.
TOOLS-EUROPE-1999-BogerWL #distributed #java #named: Dejay: Unifying Concurrency and Distribution to Achive a Distributed Java (MB, FW, WL), pp. 285–294.
TOOLS-EUROPE-1999-DuvalC #architecture #distributed: Developing Safe Concurrent and Distributed Applications with an Architectural Environment (GD, TC), pp. 20–32.
TOOLS-USA-1999-MajoulPB #component #coordination #java: A Concurrent Object-Based Model and its Use for Coordinating Java Components (SM, CP, JPB), p. 332–?.
AdaEurope-1999-BrunetonP #ada #automation #source code #verification: Automatic Verification of Concurrent Ada Programs (EB, JFPP), pp. 146–157.
PADL-1999-LetelierSR #automation #logic programming #prototype #requirements #specification: Prototyping a Requirements Specification through an Automatically Generated Concurrent Logic Program (PL, PS, IR), pp. 31–45.
POPL-1999-GuptaJP #constraints #probability #process #source code: Stochastic Processes as Concurrent Constraint Programs (VG, RJ, PP), pp. 189–202.
SAS-1999-HatcliffCDSZ #formal method #multi #slicing #source code #thread #virtual machine: A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives (JH, JCC, MBD, SS, HZ), pp. 1–18.
SIGAda-1999-GedelaSX #ada #formal method #modelling: Formal modeling of synchronization methods for concurrent objects in Ada 95 (RKG, SMS, HX), pp. 211–220.
ASE-1999-Saidi #analysis #composition #incremental: Modular and Incremental Analysis of Concurrent Software Systems (HS), pp. 92–101.
ESEC-FSE-1999-NaumovichAC #algorithm #java #performance #source code: An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs (GN, GSA, LAC), pp. 338–354.
ICSE-1999-ConcepcionLS #development #monitoring #multi #predict #re-engineering #recursion #thread: The RMT (Recursive Multi-Threaded) Tool: A Computer Aided Software Engineering Tool for Monitoring and Predicting Software Development Progress (AIC, SL, SJS), pp. 660–663.
ICSE-1999-NaumovichAC #analysis #data flow #java #source code: Data Flow Analysis for Checking Properties of Concurrent Java Programs (GN, GSA, LAC), pp. 399–410.
SAC-1999-PuntigamP #component #interface: Changeable Interfaces and Promised Messages for Concurrent Components (FP, CP), pp. 141–145.
HPCA-1999-MartinezLD #detection #performance: Impact of Buffer Size on the Efficiency of Deadlock Detection (JMM, PL, JD), pp. 315–318.
OSDI-1999-GamsaKAS #locality #memory management #multi #named #operating system: Tornado: Maximizing Locality and Concurrency in a Shared Memory Multiprocessor Operating System (BG, OK, JA, MS), pp. 87–100.
ESOP-1999-PodelskiCM #analysis #constraints #logic programming #source code: Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs (AP, WC, MM), pp. 177–192.
FASE-1999-CosicaR #named: JTN: A Java-Targeted Graphic Formal Notation for Reactive and Concurrent Systems (EC, GR), pp. 77–97.
FoSSaCS-1999-RocklS #algol #process #semantics #π-calculus: A π-calculus Process Semantics of Concurrent Idealised ALGOL (CR, DS), pp. 306–321.
FoSSaCS-1999-Sangiorgi #reasoning #using: Reasoning About Concurrent Systems Using Types (DS), pp. 31–40.
TACAS-1999-DongDRRRSSSW #case study #comparative #tool support #verification: Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools (YD, XD, YSR, CRR, IVR, SAS, OS, EWS, DSW), pp. 74–88.
TACAS-1999-Heljanko #logic programming #petri net #problem #reachability #semantics #source code #using: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.
CSL-1999-GastinM #parallel #programming language #semantics: A Truly Concurrent Semantics for a Simple Parallel Programming Language (PG, MWM), pp. 515–529.
ICLP-1999-CarroH #database #prolog #thread #using: Concurrency in Prolog Using Threads and a Shared Database (MC, MVH), pp. 320–334.
ICLP-1999-HirataY #declarative #logic: Declarative Priority in a Concurrent Logic Language ON (KH, KY), pp. 215–229.
LICS-1999-AbramskyM #game studies: Concurrent Games and Full Completeness (SA, PAM), pp. 431–442.
ITiCSE-1998-PerskyB #re-engineering: Re-engineering a concurrency simulator (YP, MBA), pp. 185–188.
CSMR-1998-ZhaoCU #dependence #maintenance #object-oriented #representation: A Dependence-Based Representation for Concurrent Object-Oriented Software Maintenance (JZ, JC, KU), pp. 60–66.
CSMR-1998-ZhaoCU98a #logic programming #metric #source code: A Metrics Suite for Concurrent Logic Programs (JZ, JC, KU), pp. 172–178.
IWPC-1998-BechiniT #design #dynamic analysis #java #tool support: Design of a Toolset for Dynamic Analysis of Concurrent Java Program (AB, KCT), pp. 190–197.
PASTE-1998-NaumovichCO #analysis #data flow #performance #source code: Efficient Composite Data Flow Analysis Applied to Concurrent Programs (GN, LAC, LJO), pp. 51–58.
ICALP-1998-BaierKL #metric #realtime #semantics: Metric Semantics for True Concurrent Real Time (CB, JPK, DL), pp. 568–579.
ICALP-1998-VictorP #calculus #constraints: Concurrent Constraints in the Fusion Calculus (BV, JP), pp. 455–469.
IFL-1998-HolyerS #monad: Concurrent Monadic Interfacing (IH, ES), pp. 72–87.
IFL-1998-SerrarensP #message passing: Explicit Message Passing for Concurrent Clean (PRS, MJP), pp. 229–245.
EDOC-1998-HillebrandKLP: Integration-based cooperation in concurrent engineering (GGH, PK, PCL, DP), pp. 344–355.
KR-1998-Pinto: Concurrent Actions and Interacting Effects (JP), pp. 292–303.
ECOOP-1998-CrnogoracRR #inheritance #object-oriented #programming: Classifying Inheritance Mechanisms in Concurrent Object Oriented Programming (LC, ASR, KR), pp. 571–600.
ECOOP-1998-MasuharaY #design #partial evaluation: Design and Partial Evaluation of Meta-Objects for a Concurrent Reflective Language (HM, AY), pp. 418–439.
TOOLS-ASIA-1998-WangZZ #ada #automation #generative: Automatically Generating Ada95 Codes for Concurrent Objects (ZW, HZ, LZ), p. 222–?.
TOOLS-ASIA-1998-ZhangP #approach #composition: A Compositional Approach to Concurrent Objects (XZ, JP), pp. 116–126.
POPL-1998-SmithV #data flow #imperative #multi #thread: Secure Information Flow in a Multi-Threaded Imperative Language (GS, DMV), pp. 355–364.
SAS-1998-BodeiDP #abstract interpretation #semantics: Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation (CB, PD, CP), pp. 168–183.
SIGAda-1998-Brosgol #ada #comparison #java: A Comparison of the Concurrency Features of Ada 95 and Java (BMB), pp. 175–192.
SIGAda-1998-KaislerF #ada #design #object-oriented: Object-Oriented and Concurrent Program Design Issues in Ada 95 (SHK, MBF), pp. 246–254.
FSE-1998-CoolW #detection: Event-Base Detection of Concurrency (JEC, ALW), pp. 35–45.
SAC-1998-JoLS #object-oriented #programming: A realization of a concurrent object-oriented programming (CHJ, CHL, JGS), pp. 558–563.
ASPLOS-1998-Weissman #approach #locality #performance #thread: Performance Counters and State Sharing Annotations: a Unified Approach to Thread Locality (BW), pp. 127–138.
DAC-1998-Lin #source code #synthesis: Software Synthesis of Process-Based Concurrent Programs (BL), pp. 502–505.
DATE-1998-BolchiniSS #analysis #detection #fault #network: Fault Analysis in Networks with Concurrent Error Detection Properties (CB, FS, DS), pp. 957–958.
DATE-1998-DaveJ #architecture #embedded #named #realtime #specification: CASPER: Concurrent Hardware-Software Co-Synthesis of Hard Real-Time Aperiodic and Periodic Specifications of Embedded System Architectures (BPD, NKJ), pp. 118–124.
DATE-1998-HamiltonO #fault #latency: Concurrent Error Recovery with Near-Zero Latency in Synthesized ASICs (SNH, AO), pp. 604–609.
DATE-1998-Lin #compilation #performance #runtime #scheduling #source code: Efficient Compilation of Process-Based Concurrent Programs without Run-Time Scheduling (BL), pp. 211–217.
DATE-1998-MrvaBK #architecture #java #multi #scalability #thread: A Scalable Architecture for Multi-threaded JAVA Applications (MM, KB, RK), pp. 868–874.
DATE-1998-NiemannM #communication #hardware #synthesis: Synthesis of Communicating Controllers for Concurrent Hardware/Software Systems (RN, PM), pp. 912–913.
HPCA-1998-LopezMD #detection #distributed #network #performance: A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks (PL, JMM, JD), pp. 57–66.
HPCA-1998-SteffanM #automation #parallel #thread #using: The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization (JGS, TCM), pp. 2–13.
HPCA-1998-TsaiJNY #parallel #performance #thread: Performance Study of a Concurrent Multithreaded Processor (JYT, ZJ, EN, PCY), pp. 24–35.
ISMM-1998-HuelsbergenW #garbage collection: Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization (LH, PW), pp. 166–175.
PDP-1998-CarrionIGVB #network: Ghost packets: a deadlock-free solution for k-ary n-cube networks (CC, CI, JAG, FV, RB), pp. 133–139.
PDP-1998-Duato #adaptation #network: Deadlock avoidance and adaptive routing in interconnection networks (JD), pp. 359–364.
PDP-1998-VilladangosFM #algorithm #distributed: A safe distributed deadlock resolution algorithm for the OR request model (JEV, FF, JRGdM), pp. 150–156.
ESOP-1998-CairesM #execution #logic #specification: Verifiable and Executable Logic Specifications of Concurrent Objects in L_pi (LC, LM), pp. 42–56.
ESOP-1998-Smolka #constraints #functional #programming: Concurrent Constraint Programming Based on Functional Programming (GS), pp. 1–11.
FASE-1998-Lechner #concept #object-oriented #reuse: Constructs, Concepts and Criteria for Reuse in Concurrent Object-Oriented languages (UL), pp. 171–187.
STOC-1998-DworkNS: Concurrent Zero-Knowledge (CD, MN, AS), pp. 409–418.
TACAS-1998-Ben-AbdallahL #design #named: MESA: Support for Scenario-Based Design of Concurrent Systems (HBA, SL), pp. 118–135.
WRLA-1998-Bruni #composition #logic: A logic for modular descriptions of asynchronous and synchronized concurrent systems (RB), pp. 161–172.
CAV-1998-Balarin #approach #correctness #modelling #verification: Correctness of the Concurrent Approach to Symbolic Verification of Interleaved Models (FB), pp. 391–402.
ISSTA-1998-Corbett #java #modelling #source code: Constructing Compact Models of Concurrent Java Programs (JCC), pp. 1–10.
IWTCS-1998-PetrenkoUC #detection #fault #using: Using Partial-Orders for Detecting Faults in Concurrent Systems (AP, AU, VC), pp. 175–190.
LICS-1998-CattaniFW #formal method #recursion: A Theory of Recursive Domains with Applications to Concurrency (GLC, MPF, GW), pp. 214–225.
LICS-1998-FagesRS #constraints #semantics #source code #verification: Phase Semantics and Verification of Concurrent Constraint Programs (FF, PR, SS), pp. 141–152.
SIGMOD-1997-KornackerMH: Concurrency and Recovery in Generalized Search Trees (MK, CM, JMH), pp. 62–72.
SIGMOD-1997-ZaharioudakisC #consistency #database: Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems (MZ, MJC), pp. 50–61.
VLDB-1997-SkubiszewskiV #garbage collection: Concurrent Garbage Collection in O2 (MS, PV), pp. 356–365.
ITiCSE-1997-FeldmanB #education #programming: Concurrent programming CAN be introduced into the lower-level undergraduate curriculum (MBF, BDB), pp. 77–79.
ICSM-2000-YoungerBL #refinement #source code: A Formal Transformation and Refinement Method for Concurrent Programs (EJY, KHB, ZL), p. 287–?.
FME-1997-BoerHR #composition #proving: A Compositional Proof System for Shared Variable Concurrency (FSdB, UH, WPdR), pp. 515–532.
FME-1997-MartinJ #analysis #network #performance #process #scalability: An Efficient Technique for Deadlock Analysis of Large Scale Process Networks (JMRM, SAJ), pp. 418–441.
FME-1997-Smith #csp #integration #semantics #specification: A Semantic Integration of Object-Z and CSP for the Specification of Concurrent Systems (GS), pp. 62–81.
IFL-1997-Chakravarty #lazy evaluation #parallel #thread: Lazy Thread and Task Creation in Parallel Graph-Reduction (MMTC), pp. 231–249.
IFL-1997-KarlsenW #haskell #repository #using: Using Concurrent Haskell to Develop Views over an Active Repository (EWK, SW), pp. 285–303.
CIKM-1997-LeeHL #approach #multi: A Uniform Approach to Global Concurrency Control and Recovery in Multidatabase Environment (SL, CSH, WGL), pp. 51–58.
TOOLS-PACIFIC-1997-Holmes #java #library #programming: Concurrent Programming in Java: Language and Libraries (DH), p. 371.
PEPM-1997-MarinescuG #source code: Partial-Evaluation Techniques for Concurrent Programs (MM, BG), pp. 47–62.
PLILP-1997-GallardoGR #haskell #inheritance: Inheritance and Selective Methods Dispatching in Concurrent Haskell (JEG, FG, BCR), pp. 33–46.
PLILP-1997-Gregory #approach #declarative #programming: A Declarative Approach to Concurrent Programming (SG), pp. 79–93.
SAS-1997-BodeiP #abstract interpretation: True Concurrency via Abstract Interpretation (CB, CP), pp. 202–216.
SAS-1997-IgarashiK #analysis #communication #programming language #type system: Type-Based Analysis of Communication for Concurrent Programming Languages (AI, NK), pp. 187–201.
TRI-Ada-1997-Cheng #ada #dependence: Task Dependence Nets for Concurrent Systems with Ada 95 and Its Applications (JC), pp. 67–78.
TRI-Ada-1997-Sanden #design pattern #resource management: Concurrent Design Patterns for Resource Sharing (BS), pp. 173–183.
ASE-1997-Dwyer #analysis #composition: Modular Flow Analysis for Concurrent Software (MBD), pp. 264–273.
ICSE-1997-NaumovichCOD #verification: Verification of Concurrent Software with FLAVERS (GN, LAC, LJO, MBD), pp. 594–595.
SAC-1997-LiuLS #clustering #multi #performance #thread: An efficient processor partitioning and thread mapping strategy for mesh-connected multiprocessor systems (HL, WML, YS), pp. 403–412.
SAC-1997-MurthyK #programming: Heterogeneous programming with concurrent objects (VKM, EVK), pp. 454–463.
DAC-1997-BaltusVADM #generative #library #standard: Developing a Concurrent Methodology for Standard-Cell Library Generation (DGB, TV, RCA, JD, TGM), pp. 333–336.
EDTC-1997-GibsonA #design #verification: Practical concurrent ASIC and system design and verification (IG, CA), pp. 532–536.
PDP-1997-CastellanoSB #specification: Intermediate representations of concurrent VHDL-based specifications (JPC, AS, JCB), pp. 66–71.
PDP-1997-ClematisGT #fault #programming: Programming concurrent backward error recovery: General methodologies and practical approaches (AC, VG, AMT), pp. 228–233.
PDP-1997-JellyMRSC #analysis #detection: Detecting deadlock with client-server analysis (IJ, MM, SR, CS, PRC), pp. 351–357.
PDP-1997-RoblesD #adaptation #multi: Multilink extension to support deadlock-free adaptive non-minimal routing (AR, JD), pp. 431–436.
SOSP-1997-SavageABNS #detection #multi #named #source code #thread: Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs (SS, MB, GN, PS, TEA), pp. 27–37.
STOC-1997-NisanB #pointer: Pointer Jumping Requires Concurrent Read (NN, ZBY), pp. 549–558.
TACAS-1997-Kleuker #communication #development #incremental: Incremental Development of Deadlock-Free Communicating Systems (SK), pp. 306–320.
CAV-1997-Godefroid #analysis #automation #named: VeriSoft: A Tool for the Automatic Analysis of Concurrent Reactive Software (PG), pp. 476–479.
CAV-1997-MelzerR #using: Deadlock Checking Using Net Unfoldings (SM, SR), pp. 352–363.
CSL-1997-HartonasH #functional #higher-order: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (CH, MH), pp. 239–254.
CSL-1997-Moschovakis #game studies #recursion #λ-calculus: A Game-Theoretic, Concurrent and Fair Model of the Typed λ-calculus, with Full Recursion (YNM), pp. 341–359.
CSL-1997-RuetF #commutative #constraints #logic #programming: Concurrent Constraint Programming and Non-commutative Logic (PR, FF), pp. 406–423.
ICLP-1997-Mahajan #logic programming #π-calculus: Concurrent Logic Programming and π Calculus (SM, SR), p. 411.
ICLP-1997-MullerW #constraints: Connecting Propagators with a Concurrent Constraint Language (TM, JW), p. 412.
ILPS-1997-MullerW #constraints: Extending a Concurrent Constraint Language by Propagators (TM, JW), pp. 149–163.
LICS-1997-KanovichI #linear #logic #process #specification: Temporal Linear Logic Specifications for Concurrent Processes (MIK, TI), pp. 48–57.
LICS-1997-Kobayashi #calculus #process: A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.
ICSM-1996-YoungerLBB #analysis #formal method #modelling #reverse engineering #source code #using: Reverse Engineering Concurrent Programs using Formal Modelling and Analysis (EJY, ZL, KHB, TMB), pp. 255–264.
WCRE-1996-YoungerLBB #analysis #formal method #modelling #reverse engineering #source code #using: Reverse Engineering Concurrent Programs Using Formal Modelling and Analysis (EJY, ZL, KHB, TMB), pp. 239–248.
WIA-1996-GarzonE #automaton #implementation #nondeterminism: Dynamical Implementation of Nondeterministic Automata and Concurrent Systems (MHG, EE), pp. 35–49.
FME-1996-WangL #realtime #verification: Procedure-Level Verification of Real-time Concurrent Systems (FW, CTDL), pp. 682–701.
RTA-1996-KirchnerLS #fine-grained: Fine-Grained Concurrent Completion (CK, CL, CS), pp. 3–17.
IFL-1996-BreitingerKL #haskell #implementation: An Implementation of Eden on Top of Concurrent Haskell (SB, UK, RL), pp. 141–161.
IFL-1996-DebbabiFT #algorithm #analysis #control flow #higher-order #source code #type system: A Type-Based Algorithm for the Control-Flow Analysis of Higher-Order Concurrent Programs (MD, AF, NT), pp. 247–266.
CSCW-1996-MunsonD #collaboration #framework: A Concurrency Control Framework for Collaborative Systems (JPM, PD), pp. 278–287.
CSCW-1996-ResselNG #approach #editing #undo: An Integrating, Transformation-Oriented Approach to Concurrency Control and Undo in Group Editors (MR, DNR, RG), pp. 288–297.
CAiSE-1996-HanneghanMC #framework #interactive #platform #web: The World-Wide Web as Platform for Supporting Interactive Concurrent Engineering (MH, MM, GC), pp. 301–318.
CIKM-1996-LeeJH #database: A New Conflict Relation for Concurrency Control and Recovery in object-based Databases (SL, SYJ, CSH), pp. 288–295.
ICPR-1996-Goller #image: Concurrent radar image shape-from-shading on high-performance computers (AG), pp. 589–593.
KR-1996-Reiter #calculus: Natural Actions, Concurrency and Continuous Time in the Situation Calculus (RR), pp. 2–13.
SEKE-1996-MillsG #approach #automation #design #knowledge-based #realtime: A Knowledge-based Approach for Automating a Design Method for Concurrent and Real-Time Systems (KLM, HG), pp. 529–536.
ECOOP-1996-LechnerLNW #inheritance #reuse #usability: (Objects + Concurrency) & Reusability — A Proposal to Circumvent the Inheritance Anomaly (UL, CL, FN, MW), pp. 232–247.
AdaEurope-1996-BurnsW #ada #effectiveness #programming language: Ada 95: An Effective Concurrent Programming Language (AB, AJW), pp. 58–77.
ALP-1996-AlouiniK #implementation #towards: Toward the Concurrent Implementation of Computational Systems (IA, CK), pp. 1–31.
ALP-1996-BrimJGK #algebra #constraints #process #programming: A Process Algebra for Synchronous Concurrent Constraint Programming (LB, JMJ, DRG, MK), pp. 165–178.
PLDI-1996-RussinovichC #memory management #nondeterminism: Replay For Concurrent Non-Deterministic Shared Memory Applications (MR, BC), pp. 258–266.
PLILP-1996-FrancescoS #process: Unfold/Fold Transformations of Concurrent Processes (NDF, AS), pp. 167–181.
PLILP-1996-RoyMS #constraints #performance #programming: Integrating Efficient Records into Concurrent Constraint Programming (PVR, MM, RS), pp. 438–453.
PLILP-1996-Scholz #constraints #framework #functional #named #programming #user interface: PIDGETS — Unifying Pictures and Widgets in a Constraint-Based Framework for Concurrent Functional GUI Programming (ES), pp. 363–377.
POPL-1996-JonesGF #haskell: Concurrent Haskell (SLPJ, ADG, SF), pp. 295–308.
POPL-1996-Niehren #functional: Functional Computation as Concurrent Computation (JN), pp. 333–343.
TRI-Ada-1996-DwyerCR #ada #independence: An Application-Independent Concurrency Skeleton in Ada 95 (MBD, MJC, ER), pp. 179–192.
SAC-1996-Jo #empirical #object-oriented #programming language: An experiment on a concurrent object-oriented programming language (CHJ), pp. 98–104.
SAC-1996-LeeL #constraints #incremental #query: Incremental querying in the concurrent CLP language IFD-Constraint Pandora (JHML, HfL), pp. 387–392.
ASPLOS-1996-PhilbinEADL #locality #scheduling #thread: Thread Scheduling for Cache Locality (JP, JE, OJA, CCD, KL), pp. 60–71.
DAC-1996-LokanathanBR #library #optimisation #process: A Methodology for Concurrent Fabrication Process/Cell Library Optimization (ANL, JBB, JER), pp. 825–830.
DAC-1996-MonahanB #analysis #optimisation: Concurrent Analysis Techniques for Data Path Timing Optimization (CM, FB), pp. 47–50.
HPCA-1996-ParkA #independence: A Topology-Independent Generic Methodology for Deadlock-Free Wormhole Routing (HP, DPA), pp. 191–200.
PDP-1996-HiranoMS: Extendible Hashing for Concurrent Insertions and Retrievals (YH, FM, TS), pp. 235–242.
PDP-1996-LeungC #behaviour #equation #inheritance #object-oriented #programming language: Behaviour Equation as Solution of Inheritance Anomaly in Concurrent Object-Oriented Programming Languages (BCLL, PPKC), pp. 360–366.
PDP-1996-MendivilFVG #algorithm #distributed #liveness: Liveness Conditions for a Safe Distributed Deadlock Resolution Algorithm (JRGdM, FF, JEV, JRG), pp. 139–146.
PDP-1996-NapoliGF #community #implementation #interpreter #lisp: A Paralation Model Implementation Based on a Concurrent Lisp Interpreter Community (CDN, MG, MMF), pp. 429–436.
PDP-1996-Papadopoulos #framework #graph grammar #object-oriented #programming: Concurrent Object-Oriented Programming Techniques in a Term Graph Rewriting Framework (GAP), pp. 87–93.
PDP-1996-Roegel #object-oriented #source code #specification: Specifying Almost-Real Concurrent Object-Oriented Programs (DR), pp. 94–101.
ESOP-1996-Goubault: Durations for Truly-Concurrent Transitions (EG), pp. 173–187.
TACAS-1996-CleavelandLSS #development: The Concurrency Factory Software Development Environment (RC, PML, SAS, OS), pp. 391–395.
TACAS-1996-Saidi #automation #proving: A Tool for Proving Invariance Properties of Concurrent Systems Automatically (HS), pp. 412–416.
CAV-1996-CleavelandLSS #development: The Concurrency Factory: A Development Environment for Concurrent Systems (RC, PML, SAS, OS), pp. 398–401.
CAV-1996-CleavelandS: The NCSU Concurrency Workbench (RC, SS), pp. 394–397.
CAV-1996-Gonthier #garbage collection #safety #verification: Verifying the Safety of a Practical Concurrent Garbage Collector (GG), pp. 462–465.
CSL-1996-CattaniW #modelling: Presheaf Models for Concurrency (GLC, GW), pp. 58–75.
ISSTA-1996-ChamillardC #analysis #petri net #source code: Improving the Accuracy of Petri Net-Based Analysis of Concurrent Programs (ATC, LAC), pp. 24–38.
ISSTA-1996-Corbett #modelling #realtime: Constructing Abstract Models of Concurrent Real-Time Software (JCC), pp. 250–260.
ISSTA-1996-GodefroidPS #industrial #partial order #source code #using #validation: Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs (PG, DP, MGS), pp. 261–269.
ISSTA-1996-KoppolT #approach #incremental #testing: An Incremental Approach to Structural Testing of Concurrent Software (PVK, KCT), pp. 14–23.
JICSLP-1996-BonnerK #communication #logic #transaction: Concurrency and Communication in Transaction Logic (AJB, MK), pp. 142–156.
JICSLP-1996-ChoU #logic programming #source code: Diagnosing Non-Well-Moded Concurrent Logic Programs (KC, KU), pp. 215–229.
JICSLP-1996-FalaschiHW #analysis #constraints #source code: Demand Transformation Analysis for Concurrent Constraint Programs (MF, PH, WHW), pp. 333–347.
JICSLP-1996-RaoRR #thread: A Thread in Time Saves Tabling Time (PR, CRR, IVR), pp. 112–126.
LICS-1996-AlurMP #correctness #model checking: Model-Checking of Correctness Conditions for Concurrent Objects (RA, KLM, DP), pp. 219–228.
SIGMOD-1995-AdyaGLM #performance #using: Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks (AA, RG, BL, UM), pp. 23–34.
VLDB-1995-BestavrosB: Value-cognizant Speculative Concurrency Control (AB, SB), pp. 122–133.
VLDB-1995-EvangelidisLS: The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation (GE, DBL, BS), pp. 551–561.
VLDB-1995-GoyalHSS #database #realtime: Index Concurrency Control in Firm Real-Time Database Systems (BG, JRH, SS, VS), pp. 146–157.
VLDB-1995-WuYCT #database #multi #performance: A Performance Study of Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System (KLW, PSY, JYC, JZT), pp. 100–109.
ICALP-1995-DiekertG #termination: A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (VD, PG), pp. 15–26.
RTA-1995-Alouini #garbage collection: Concurrent Garbage Collection for Concurrent Rewriting (IA), pp. 132–146.
CIKM-1995-CorrelM #on the: On Isolation, Concurrency, and the Venus Rule Language (SC, DPM), pp. 281–289.
CIKM-1995-ParkST #algorithm #detection #distributed #generative #graph #hybrid: A Distributed Deadlock Detection and Resolution Algorithm Based on A Hybrid Wait-for Graph and Probe Generation Scheme (YCP, PS, HLT), pp. 378–386.
KDD-1995-SkowronS #approach #modelling #set: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach (AS, ZS), pp. 288–293.
OOPSLA-1995-ItohYT #low level #named #operating system #programming #using: SCONE: Using Concurrent Objects for Low-level Operating System Programming (JiI, YY, MT), pp. 385–398.
OOPSLA-1995-MasuharaMAY #compilation #object-oriented #partial evaluation #using: Compiling Away the Meta-Level in Object-Oriented Concurrent Reflective Languages Using Partial Evaluation (HM, SM, KA, AY), pp. 300–315.
AdaEurope-1995-Sanden #design #problem: Design of Concurrent Software Based on Problem Concurrency (BS), pp. 298–310.
LOPSTR-1995-Gregory #algorithm: Derivation of Concurrent Algorithms in Tempo (SG), pp. 46–60.
PEPM-1995-Colby #communication #source code: Analyzing the Communication Topology of Concurrent Programs (CC), pp. 202–213.
PEPM-1995-Cridlig #analysis #model checking #semantics #using: Semantic Analysis of Shared-Memory Concurrent Languages using Abstract Model-Checking (RC), pp. 214–225.
PLILP-1995-TongL #constraints #performance #programming: Performance of A Data-Parallel Concurrent Constraint Programming System (BMT, HfL), pp. 463–464.
POPL-1995-PlevyakZC #object-oriented #performance: Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages (JP, XZ, AAC), pp. 311–321.
POPL-1995-SaraswatJG #constraints #programming: Default Timed Concurrent Constraint Programming (VAS, RJ, VG), pp. 272–285.
SAS-1995-Colby #source code: Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data (CC), pp. 64–81.
SAS-1995-Coorg #clustering #code generation #functional #multi #strict #thread: Partitioning Non-strict Functional Languages for Multi-threaded Code Generation (SRC), pp. 82–99.
SAS-1995-KobayashiNY #communication #programming language #static analysis: Static Analysis of Communication for Asynchronous Concurrent Programming Languages (NK, MN, AY), pp. 225–242.
TRI-Ada-1995-Bardin #ada #implementation #source code: Implementing Concurrent Programs in Ada 95 (BMB), pp. 557–654.
TRI-Ada-1995-Sanden #design: Design of Concurrent Software (BS), pp. 5–26.
TRI-Ada-1995-Sanden95b #resource management: Resource Sharing Deadlock Prevention (BS), pp. 70–103.
ESEC-1995-TaiC #source code #testing: A Specification-Based Methology for Testing Concurrent Programs (KCT, RHC), pp. 154–172.
ICSE-1995-DwyerCN #petri net #representation #source code: A Compact Petri Net Representation for Concurrent Programs (MBD, LAC, KAN), pp. 147–157.
ICSE-1995-HeinemanK #architecture #framework: An Architecture for Integrating Concurrency Control into Environment Frameworks (GTH, GEK), pp. 305–313.
SAC-1995-ChenH #algorithm #analysis #database #performance: Performance analysis of a periodic data reorganization algorithm for concurrent B-trees in database systems (IRC, SH), pp. 40–45.
SAC-1995-Huntbach #object-oriented: The concurrent object-oriented language braid (MMH), pp. 140–146.
SAC-1995-Huntbach95a #logic: Search in concurrent logic languages (MMH), pp. 164–170.
SAC-1995-Scholz #data type #functional #programming language: Turning a functional data type into a concurrent programming language (ES), pp. 135–139.
DAC-1995-Albrecht #configuration management #design #simulation: Concurrent Design Methodology and Configuration Management of the SIEMENS EWSD — CCS7E Processor System Simulation (TWA), pp. 222–227.
DAC-1995-SilburtPBNDW #behaviour #design #hardware #modelling #simulation: Accelerating Concurrent Hardware Design with Behavioural Modelling and System Simulation (AS, IP, JB, SN, MD, GW), pp. 528–533.
DAC-1995-SmailagicSAKMS #benchmark #design #metric: Benchmarking An Interdisciplinary Concurrent Design Methodology for Electronic/Mechanical Systems (AS, DPS, DA, CK, TLM, JS), pp. 514–519.
HPCA-1995-FiskeD #parallel #scheduling #thread: Thread Prioritization: A Thread Scheduling Mechanism for Multiple-Context Parallel Processors (SF, WJD), pp. 210–221.
HPDC-1995-FerrariS #distributed #named #process: TPVM: Distributed Concurrent Computing with Lighweight Processes (AF, VSS), pp. 211–218.
IWMM-1995-Virding #erlang #garbage collection #realtime: A Garbage Collector for the Concurrent Real-Time Language Erlang (RV), pp. 343–354.
LCT-RTS-1995-HuangL #execution #predict #worst-case: Predicting the Worst-Case Execution Time of the Concurrent Execution of Instructions and Cycle-Stealing DMA I/O Operations (TYH, JWSL), pp. 1–6.
PDP-1995-AudenaertL #detection #graph #parallel #performance #source code: Space efficient data race detection for parallel programs with series-parallel task graphs (KA, LL), pp. 508–515.
PDP-1995-ColiP95a #adaptation #algorithm: An adaptive deadlock and livelock free routing algorithm (MC, PP), pp. 288–295.
PDP-1995-GrabnerKV #debugging #process: Debugging of concurrent processes (SG, DK, JV), pp. 547–554.
PDP-1995-MendivilDBG #algorithm #correctness #distributed: Correctness of a distributed deadlock resolution algorithm for the single request model (JRGdM, AD, JMBA, JRG), pp. 254–261.
SOSP-1995-SteensgaardJ #thread: Object and Native Code Thread Mobility Among Heterogeneous Computers (BS, EJ), pp. 68–78.
TACAS-1995-RoscoeGGHJS #csp #how #model checking: Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock (AWR, PHBG, MG, JRH, DMJ, JBS), pp. 133–152.
TAPSOFT-1995-BareauCJT #distributed: Measuring Concurrency of Regular Distributed Computations (CB, BC, CJ, RT), pp. 711–725.
TAPSOFT-1995-NielsonN #higher-order: Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages (HRN, FN), pp. 590–604.
ICLP-1995-GregoryR #declarative #named #programming language: Tempo: A Declarative Concurrent Programming Language (SG, RR), pp. 515–529.
ICLP-1995-HermenegildoGC #implementation #logic programming #parallel #using: Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems (MVH, DCG, MC), pp. 631–645.
ICLP-1995-JacquetB #logic #on the #process: On Composing Concurrent Logic Processes (JMJ, KDB), pp. 531–545.
ICLP-1995-Kahn #constraints #named #programming: ToonTalk — Concurrent Constraint Programming for Kids (KMK), p. 3.
ICLP-1995-SahlinS #constraints: An Analyzer for a Concurrent Constraint Language (DS, TS), p. 828.
ICLP-1995-Smolka #constraints #named #programming: Oz: Concurrent Constraint Programming for Real (GS), p. 13.
ICLP-1995-ZhaoCU #analysis #dependence #logic programming #source code: Program Dependence Analysis of Concurrent Logic Programs and Its Applications (JZ, JC, KU), p. 825.
ILPS-1995-BoerG #constraints #modelling #programming #realtime: Modelling Real-Time in Concurrent Constraint Programming (FSdB, MG), pp. 528–542.
ILPS-1995-TseWL #logic programming #object-oriented #programming language #prolog: P&P: A Combined Parlog and Prolog Concurrent Object-Oriented Logic Programming Language (MlT, WhW, HfL), p. 640.
LICS-1995-Jeffrey #functional #monad #semantics: A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (AJ), pp. 255–264.
VLDB-1994-SetzerZ #algorithm: New Concurrency Control Algorithms for Accessing and Compacting B-Trees (VWS, AZ), pp. 238–248.
CSEE-1994-Gomaa #design #realtime: Software Design Methods for Concurrent and Real-Time Systems (HG), p. 341.
ICSM-1994-AngerRY #dynamic analysis #source code: Combining Static and Dynamic Analysis of Concurrent Programs (FDA, RVR, MY), pp. 89–98.
ICALP-1994-CorradiniN #locality: Distribution and Locality of Concurrent Systems (FC, RDN), pp. 154–165.
ICALP-1994-Droste #monad #theorem: A KLeene Theorem for Recognizable Languages over Concurrency Monoids (MD), pp. 388–399.
FME-1994-Evans #specification #using #verification: Specifying & Verifying Concurrent Systems Using Z (AE), pp. 366–380.
FME-1994-KeaneSW #framework #modelling #process: Applying a Concurrent Formal Framework to Process Modelling (JAK, JS, BW), pp. 291–305.
FME-1994-MossesM #action semantics #ml #semantics: An Action Semantics for ML Concurrency Primitives (PDM, MM), pp. 461–479.
LFP-1994-OTooleN #garbage collection: Concurrent Replicating Garbage Collection (JO, SN), pp. 34–42.
CSCW-1994-GreenbergM #distributed #interface #realtime: Real Time Groupware as a Distributed System: Concurrency Control and Its Effect on the Interface (SG, DM), pp. 207–217.
CIKM-1994-Al-AnziS #behaviour #modelling #towards: Modeling Behavior, A Step Towards Defining Functionally Correct Views of Complex Objects in Concurrent Engineering (FSAA, DLS), pp. 1–9.
SEKE-1994-BadrL #automation #re-engineering: Automation support for concurrent software engineering (SB, L), pp. 46–53.
SEKE-1994-CookeDGK #linear #logic programming #source code: Bag languages, concurrency, Horn logic programs, and linear logic (DEC, RD, AQG, VK), pp. 289–297.
ECOOP-1994-LopesL #object-oriented: Abstracting Process-to-Function Relations in Concurrency Object-Oriented Applications (CVL, KJL), pp. 81–99.
ECOOP-1994-Vasconcelos: Typed Concurrent Objects (VTV), pp. 100–117.
OOPSLA-1994-KobayashiY #object-oriented #programming: Type-Theoretic Foundations for Concurrent Object-Oriented Programming (NK, AY), pp. 31–45.
TOOLS-EUROPE-1994-DurrG #development: Rigorous Development of Concurrent O-O Systems (ED, SJG), p. 515.
ALP-1994-BuenoHMR #semantics #source code: From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics (FB, MVH, UM, FR), pp. 114–132.
ALP-1994-Palamidessi #constraints #programming: Concurrent Constraint Programming (CP), pp. 1–2.
ALP-1994-Volpe #linear #logic programming #proving: Concurrent Logic Programming as Uniform Linear Proofs (PV), pp. 133–149.
PLILP-1994-Palamidessi #constraints #programming: Concurrent Constraint Programming (CP), pp. 1–2.
PLILP-1994-ZffanellaGL #constraints #programming: Abstracting Synchronization in Concurrent Constraint Programming (EZ, RG, GL), pp. 57–72.
POPL-1994-BoerGMP #constraints #proving #source code: Proving Concurrent Constraint Programs Correct (FSdB, MG, EM, CP), pp. 98–108.
POPL-1994-NielsonN #communication #finite #higher-order #source code: Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
TRI-Ada-1994-Oliver #ada #design #implementation #object-oriented #realtime: Object Oriented Design and Implementation of Concurrent and Real Time Systems in Ada (SRO), pp. 343–349.
FSE-1994-DillonY: Oracles for Checking Temporal Properties of Concurrent Systems (LKD, QY), pp. 140–153.
FSE-1994-DwyerC #analysis #data flow #source code #verification: Data Flow Analysis for Verifying Properties of Concurrent Programs (MBD, LAC), pp. 62–75.
SAC-1994-ChenB #analysis #database #detection #performance #petri net #transaction: A Petri net model for the performance analysis of transaction database systems with continuous deadlock detection (IRC, RB), pp. 539–544.
SAC-1994-LeeL #constraints #incremental #logic programming #named #nondeterminism #query #towards: IQ: towards incremental query processing in non-deterministic concurrent constraint logic programming (JHML, HfL), pp. 405–409.
DAC-1994-HarrisO #architecture #design #synthesis: Microarchitectural Synthesis of VLSI Designs with High Test Concurrency (IGH, AO), pp. 206–211.
DAC-1994-JongL #communication #design #petri net: A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules (GGdJ, BL), pp. 49–55.
EDAC-1994-HarrisO #fine-grained #scheduling: Fine-Grained Concurrency in Test Scheduling for Partial-Intrusion BIST (IGH, AO), pp. 119–123.
PDP-1994-BastiaensLDV #algorithm #image #implementation #operating system #parallel #performance #re-engineering #thread: An Efficient Parallel Implementation Of The Ml-EM Algorithm For PET Image Reconstruction With A Multi-threaded Operating System (KB, IL, PD, WV), pp. 253–259.
PDP-1994-BettazCR #distributed #lifecycle #modelling #parallel: A Life-cycle For Parallel And Distributed Systems Based On two Models Of Concurrency (MB, AC, GR), pp. 551–558.
PDP-1994-GonzalezSSC #approach #latency: A New Approach To Concurrent Ring: 1 Bit latency (JDSG, ÁSS, CS, CMRC), pp. 559–565.
ICLP-1994-Guglielmi #generative #logic programming #programming language: Concurrency and Plan Generation in a Logic Programming Language with a Sequential Operator (AG), pp. 240–254.
ICLP-1994-KumonH #logic: A New Transformation based on Process-Message Duality for Concurrent Logic Languages (KK, KH), pp. 684–698.
ILPS-1994-CarlsonHJ #programming: AKL(FD) — A Concurrent Language for FD Programming (BC, SH, SJ), pp. 521–535.
ILPS-1994-JourdanFRD #constraints #modelling #parallel #programming #scheduling #using: Data Alignment and Task Scheduling On Parallel Machines Using Concurrent Constraint Model-based Programming (JJ, FF, DR, AD), p. 678.
ILPS-1994-SchulteS #constraints #encapsulation #higher-order #programming: Encapsulated Search for Higher-order Concurrent Constraint Programming (CS, GS), pp. 505–520.
ISSTA-1994-Corbett #ada #analysis #empirical #evaluation #source code: An Empirical Evaluation of Three Methods for Deadlock Analysis of Ada Tasking Programs (JCC), pp. 204–215.
LICS-1994-Clarke #automation #finite #verification: Automatic Verification of Finite-State Concurrent Systems (EMC), p. 126.
LICS-1994-Jeffrey #graph #reduction #semantics: A Fully Abstract Semantics for Concurrent Graph Reduction (AJ), pp. 82–91.
LICS-1994-SaraswatJG #constraints #programming: Foundations of Timed Concurrent Constraint Programming (VAS, RJ, VG), pp. 71–80.
HT-1993-WiilL #collaboration #hypermedia: Concurrency Control in Collaborative Hypertext Systems (UKW, JJL), pp. 14–24.
PODS-1993-SchekWY #formal method #towards: Towards a Unified Theory of Concurrency Control and Recovery (HJS, GW, HY), pp. 300–311.
PODS-1993-WongA #approach #semantics: Context-Based Synchronisation: An Approach beyond Semantics for Concurrency Control (MHW, DA), pp. 276–287.
SIGMOD-1993-JinRNS #multi: Concurrency Control and Recovery of Multidatabase Work Flows in Telecommunication Applications (WWJ, MR, LN, APS), pp. 456–459.
VLDB-1993-Lomet: Key Range Locking Strategies for Improved Concurrency (DBL), pp. 655–664.
ICALP-1993-BrachoD #automaton: From Domains to Automata with Concurrency (FB, MD), pp. 669–681.
ICALP-1993-CodishFMW #analysis #constraints #logic programming #performance #source code: Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
ICALP-1993-JategaonkarM #finite: Deciding True Concurrency Equivalences on Finite Sate Nets (LJ, ARM), pp. 519–531.
ICALP-1993-Vogler #testing: Timed Testing of Concurrent Systems (WV), pp. 532–543.
FME-1993-BrownM #proving #source code: A Proof Environment for Concurrent Programs (NB, DM), pp. 196–215.
FME-1993-HaxthausenG #case study #using: A Concurrency Case Study Using RAISE (AEH, CG), pp. 367–387.
HCI-ACS-1993-AdachiSE #aspect-oriented #social: Social and Managerial Aspects of Group Work in Concurrent Engineering (TA, LCS, TE), pp. 8–13.
INTERCHI-1993-NigayC #data fusion #design #multimodal: A design space for multimodal systems: concurrent processing and data fusion (LN, JC), pp. 172–178.
CIKM-1993-HwangHS #approach #database: Concurrency Control in Federated Databases: A Dynamic Approach (SYH, JH, JS), pp. 694–703.
SEKE-1993-Eichmann #experience #information management: Knowledge Engineering in Concurrent Engineering and Experience Factories (DE), p. 472.
ECOOP-1993-Meseguer #inheritance #object-oriented #programming: Solving the Inheritance Anomaly in Concurrent Object-Oriented Programming (JM), pp. 220–246.
OOPSLA-1993-KaleK #c++ #object-oriented: CHARM++: A Portable Concurrent Object Oriented System Based On C++ (LVK, SK), pp. 91–108.
OOPSLA-1993-MatsuokaTY #encapsulation #object-oriented #performance #using: Highly Efficient and Encapsulated Re-use of Synchronization Code in Concurrent Object-Oriented Languages (SM, KT, AY), pp. 109–126.
TOOLS-PACIFIC-1993-LingD #comparison #object-oriented #paradigm #specification #using: A Comparison of Techniques for Specifying Concurrent Systems Using the Object-Oriented Paradigm (SL, BD), pp. 155–177.
TOOLS-PACIFIC-1993-Meyer93c #object-oriented #programming: Systematic Concurrent Object-Oriented Programming (BM), p. 325.
TOOLS-PACIFIC-1993-Meyer93d #object-oriented #programming: Systematic Concurrent Object-Oriented Programming (BM), pp. 523–576.
TOOLS-USA-1993-CaromelR #reuse: Object-Based Concurrency: Ten Language Features to Achieve Reuse (DC, MR), pp. 205–213.
TOOLS-USA-1993-Meyer #object-oriented #programming: Systematic Concurrent Object-Oriented Programming (BM), p. 553.
POPL-1993-DoligezL #garbage collection #implementation #ml #parallel #thread: A Concurrent, Generational Garbage Collector for a Multithreaded Implementation of ML (DD, XL), pp. 113–123.
ESEC-1993-Beeck #analysis #integration #realtime #specification: Integration of Structured Analysis and Timed Statecharts for Real-Time and Concurrency Specification (MvdB), pp. 313–328.
FSE-1993-BahsounMS #formal method #framework #programming: A Framework for Programming and Formalizing Concurrent Objects (JPB, SM, CS), pp. 126–137.
SAC-1993-MotzkinJHK #execution #information management #on the: On Concurrent Execution of Information Systems Applications (DM, EJ, DH, MK), pp. 775–781.
HPDC-1993-MukherjeeS #adaptation #configuration management #multi #performance #thread #using: Improving Performance by Use of Adaptive Objects: Experimentation with a Configurable Multiprocessor Thread Package (BM, KS), pp. 59–66.
PDP-1993-BettazM #modelling #proving: Modelling and proving of truly concurrent systems with CATNets (MB, AM), pp. 265–272.
PDP-1993-MoisanDC #distributed #memory management #network #object-oriented #programming #simulation: An object-oriented concurrent programming model for simulation applications on distributed memory processors network (BM, YD, RC), pp. 78–85.
PPoPP-1993-HuelsbergenL #garbage collection: A Concurrent Copying Garbage Collector for Languages that Distinguish (Im)mutable Data (LH, JRL), pp. 73–82.
PPoPP-1993-TauraMY #implementation #multi #object-oriented #performance: An Efficient Implementation Scheme of Concurrent Object-Oriented Languages on Stock Multicomputers (KT, SM, AY), pp. 218–228.
SOSP-1993-OTooleNG #garbage collection #persistent: Concurrent Compacting Garbage Collection of a Persistent Heap (JO, SN, DKG), pp. 161–174.
TAPSOFT-1993-AndreoliLPT #communication #linear #logic programming #programming language #semantics: True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication (JMA, LLT, RP, BT), pp. 182–198.
TAPSOFT-1993-DeganoGV #modelling #on the: On Relating Some Models for Concurrency (PD, RG, SV), pp. 15–30.
TAPSOFT-1993-OlderogR #case study #design: A Case Study in Transformational Design of Concurrent Systems (ERO, SR), pp. 90–104.
CAV-1993-KuttyRMDM #logic #tool support #verification #visual notation: A Graphical Interval Logic Toolset for Verifying Concurrent Systems (GK, YSR, LEM, LKD, PMMS), pp. 138–153.
CSL-1993-ComptonU: The Model Theory of Concurrency (KJC, RUS), pp. 78–90.
ILPS-1993-BoerKPR #constraints #programming: Non-monotonic Concurrent Constraint Programming (FSdB, JNK, CP, JJMMR), pp. 315–334.
ILPS-1993-FribourgP #automaton #constraints: Concurrent Constraint Automata (LF, MVP), p. 656.
ILPS-1993-KobayashiY #linear #logic programming #named #paradigm: ACL — A Concurrent Linear Logic Programming Paradigm (NK, AY), pp. 279–294.
ILPS-1993-NystromJ #constraints #fixpoint #programming #semantics: Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations (SON, BJ), pp. 335–352.
ILPS-1993-Pimentel #logic #object-oriented: L2||O2: A Concurrent Object-oriented Logic Language (EP), p. 665.
ILPS-1993-TongL #constraints #logic programming #parallel: Concurrent Constraint Logic Programming On Massively Parallel SIMD Computers (BMT, HfL), pp. 388–402.
ISSTA-1993-CorbettA #bound #realtime: A Practical Technique for Bounding the Time Between Events in Concurrent Real-Time Systems (JCC, GSA), pp. 110–116.
ISSTA-1993-DuriBDS #ada #analysis #reduction #using: Using State Space Reduction Methods for Deadlock Analysis in Ada Tasking (SD, UAB, RD, SMS), pp. 51–60.
ISSTA-1993-LevineT #analysis #metric #re-engineering: Metric-Driven Reengineering for Static Concurrency Analysis (DLL, RNT), pp. 40–50.
PODS-1992-TurekSP #algorithm #data type: Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking (JT, DS, SP), pp. 212–222.
PODS-1992-WongA #bound #consistency #database #nondeterminism: Tolerating Bounded Inconsistency for Increasing Concurrency in Database Systems (MHW, DA), pp. 236–245.
SIGMOD-1992-Descollonges #transaction: A Concurrency Model for Transaction Management (MD), p. 164.
SIGMOD-1992-HarrisRW #database #multi #performance #protocol: A High Performance Multiversion Concurrency Control Protocol of Object Databases (CH, MR, CW), p. 320.
SIGMOD-1992-LometS: Access Method Concurrency with Recovery (DBL, BS), pp. 351–360.
SIGMOD-1992-MehrotraRBKS #multi #problem: The Concurrency Control Problem in Multidatabases: Characteristics and Solutions (SM, RR, YB, HFK, AS), pp. 288–297.
SIGMOD-1992-MohanL #named #performance #using: ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging (CM, FEL), pp. 371–380.
ICALP-1992-Rabinovich #finite: Checking Equivalences Between Concurrent Systems of Finite Agents (AMR), pp. 696–707.
LFP-1992-JagannathanP #multi #performance #thread: A Foundation for an Efficient Multi-Threaded Scheme System (SJ, JP), pp. 345–357.
CSCW-1992-Newman-WolfeWM #editing #object-oriented: Implicit Locking in the Ensemble Concurrent Object-Oriented Graphics Editor (RENW, MLW, MM), pp. 265–272.
KR-1992-ChaudhriHM #knowledge base: Concurrency Control for Knowledge Bases (VKC, VH, JM), pp. 762–773.
SEKE-1992-WangG #algorithm #transaction: An Optomized Concurrency Control Algorithm for Transaction Brocessing (SW, UOG), pp. 9–16.
ECOOP-1992-Frolund #constraints #inheritance #object-oriented #programming language: Inheritance of Synchronization Constraints in Concurrent Object-Oriented Programming Languages (SF), pp. 185–196.
OOPSLA-1992-Lohr: Concurrency Annotations (KPL), pp. 327–340.
OOPSLA-1992-MasuharaMWY #object-oriented: Object-Oriented Concurrent Reflective Languages can be Implemented Efficiently (HM, SM, TW, AY), pp. 127–144.
OOPSLA-1992-SatohT #object-oriented #realtime: A Formalism for Real-Time Concurrent Object-Oriented Computing (IS, MT), pp. 315–326.
TOOLS-EUROPE-1992-America: Concurrency (PA), p. 419.
TOOLS-PACIFIC-1992-JalloulP #eiffel #modelling: Models for Concurrent Eiffel (GJ, JP), pp. 183–191.
TOOLS-USA-1992-KaraormanB #eiffel: A concurrency Mechanism for Sequential Eiffel (MK, JLB), pp. 63–77.
TOOLS-USA-1992-Lohr #reuse #usability: Concurrency Annotations Improve Reusability (KPL), pp. 53–62.
TOOLS-USA-1992-Lohr92a #object-oriented #programming: Object-Oriented Concurrent Programming (KPL), p. 274.
AdaEurope-1992-Cheng #ada #dependence #representation #source code: Task Dependence Net as a Representation for Concurrent Ada Programs (JC), pp. 150–164.
ALP-1992-GioviniMC #algebra #implementation #prototype #specification #tool support: Implementation of a Toolset for Prototyping Algebraic Specifications of Concurrent Systems (AG, FM, AC), pp. 335–349.
ALP-1992-KingS #analysis #logic programming #source code: Serialisation Analysis of Concurrent Logic Programs (AK, PS), pp. 322–334.
PLDI-1992-JagannathanP: A Customizable Substrate for Concurrent Languages (SJ, JP), pp. 55–67.
PLDI-1992-WortmanJ #compilation: A Concurrent Compiler for Modula-2+ (DBW, MDJ), pp. 68–81.
POPL-1992-BerryMT #ml #semantics: A Semantics for ML Concurrency Primitives (DB, RM, DNT), pp. 119–129.
TRI-Ada-C-1992-Acosta #ada #prototype #source code #specification: Specification Prototyping of Concurrent Ada Programs in DProto (RDA), pp. 258–266.
TRI-Ada-C-1992-MayrhauserH #ada #algorithm #communication #graph #testing: An Ada Deadlock Testing Algorithm Based on Control and Communication Flow Graphs (AvM, SMSH), pp. 450–457.
WSA-1992-AmatoGM #analysis #database #functional #programming language #transaction: Analysis of Concurrent Transactions in a Functional Database Programming Language (GA, FG, GM), pp. 174–184.
WSA-1992-CodishFMW #analysis #constraints #logic programming #performance #source code: Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.
ICSE-1992-DillonKMMR #specification #visual notation: Graphical Specifications for Concurrent Software Systems (LKD, GK, LEM, PMMS, YSR), pp. 214–224.
ICSE-1992-RomanGB #programming #rule-based: Seeking Concurrency in Rule-Based Programming (GCR, RFG, WEB), pp. 225–234.
SOSP-WIP-1991-Herlihy92 #implementation: A Methodology for Implementing Highly Concurrent Data Objects (MH), p. 12.
DAC-1992-BoseA #fault #logic #memory management #message passing #multi #simulation: Concurrent Fault Simulation of Logic Gates and Memory Blocks on Message Passing Multicomputers (SB, PA), pp. 332–335.
DAC-1992-LeeR92a #fault #on the #performance #simulation: On Efficient Concurrent Fault Simulation for Synchronous Sequential Circuits (DHL, SMR), pp. 327–331.
IWMM-1992-DuvvuruSTSHZ #logic programming #source code: A Compile-Time Memory-Reuse Scheme for Concurrent Logic Programs (SD, RS, ET, AVSS, LH, XZ), pp. 264–276.
IWMM-1992-Rojemo #garbage collection #graph #parallel #reduction: A Concurrent Generational Garbage Collector for a Parallel Graph Reducer (NR), pp. 440–453.
IWMM-1992-SergentB #architecture #garbage collection #incremental #memory management #multi #thread: Incremental Multi-threaded Garbage Collection on Virtual Shared Memory Architectures (TLS, BB), pp. 179–199.
STOC-1992-DworkW #bound #exclamation #performance: Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! (CD, OW), pp. 655–666.
CAV-1992-EngbergGL #verification: Mechanical Verification of Concurrent Systems with TLA (UE, PG, LL), pp. 44–55.
CAV-1992-WrightL #algorithm #proving #reasoning #theorem proving #using: Using a Theorem Prover for Reasoning about Concurrent Algorithms (JvW, TL), pp. 56–68.
IWPTS-1992-WalterP #semantics: An Operational Semantics for Concurrent TTCN (TW, BP), pp. 131–143.
JICSLP-1992-BoerP #algebra #constraints #process #programming: A Process Algebra of Concurrent Constraint Programming (FSdB, CP), pp. 463–477.
JICSLP-1992-KingS #analysis #logic programming #source code: Schedule Analysis of Concurrent Logic programs (AK, PS), pp. 478–492.
JICSLP-1992-SundararajanST #analysis #logic programming #source code #thread: Variable Threadedness Analysis for Concurrent Logic Programs (RS, AVSS, ET), pp. 493–508.
JICSLP-1992-Tick #logic programming #tutorial: Advanced Tutorial: Concurrent Logic Programming (ET), p. 25.
LICS-1992-Sangiorgi #lazy evaluation #λ-calculus: The Lazy λ Calculus in a Concurrency Scenario (DS), pp. 102–109.
SIGMOD-1991-ChrysanthisRR: Extracting Concurrency from Objects: A Methodology (PKC, SR, KR), pp. 108–117.
SIGMOD-1991-SrinivasanC #algorithm #performance: Performance of B-Tree Concurrency Algorithms (VS, MJC), pp. 416–425.
SIGMOD-1991-WangR #architecture #consistency: Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture (YW, LAR), pp. 367–376.
VLDB-1991-HuangSRT #evaluation #realtime: Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes (JH, JAS, KR, DFT), pp. 35–46.
VDME-1991-Milner #process: Concurrent Processes as Objects (RM), p. 9.
VDME-1991-Stolen: An Attempt to Reason about Shared-State Concurrency in the Style of VDM (KS), pp. 324–342.
ECOOP-1991-Crespi-ReghizziPG #component #reuse: Definition of Reusable Concurrent Software Components (SCR, GGdP, SG), pp. 148–166.
ECOOP-1991-MatsuokaWY #architecture #hybrid #object-oriented #programming: Hybrid Group Reflective Architecture for Object-Oriented Concurrent Reflective Programming (SM, TW, AY), pp. 231–250.
TOOLS-USA-1991-Briot #object-oriented: Concurrency in Object-Oriented Systems (JPB), pp. 447–448.
TOOLS-USA-1991-LescaudronBB #experience #object-oriented #programming #prototype: Associated Paper: Prototyping Programming Environments for Object-Oriented Concurrent Languages: a Smalltalk-Based Experience (LL, JPB, MB), pp. 449–462.
LOPSTR-1991-Huntbach #automation #logic: Automated Translation of Occam to a Concurrent Logic Language (MMH), pp. 254–275.
PLDI-1991-Reppy #higher-order #named: CML: A Higher-Order Concurrent Language (JHR), pp. 293–305.
POPL-1991-Pratt #geometry #modelling: Modeling Concurrency with Geometry (VRP), pp. 311–322.
POPL-1991-SaraswatRP #constraints #programming #semantics: Semantic Foundations of Concurrent Constraint Programming (VAS, MCR, PP), pp. 333–352.
KBSE-1991-FrinckeAL #algorithm #approach #automation #detection #named: CTPLAN: A Planning-Based Approach to Automatically Detecting Flaws in Concurrent Algorithms (DAF, MA, KNL), pp. 151–160.
DAC-1991-Chen #clustering #graph #scheduling: Graph Partitioning for Concurrent Test Scheduling in VLSI Circuit (CIHC), pp. 287–290.
DAC-1991-MontessoroG #fault #multi #named #performance #simulation: Creator: General and Efficient Multilevel Concurrent Fault Simulation (PLM, SG), pp. 160–163.
PPoPP-1991-BakewellQW #source code: Mapping Concurrent Programs to VLIW Processors (HB, DJQ, PYW), pp. 21–27.
PPoPP-1991-NetzerM #detection: Improving the Accuracy of Data Race Detection (RHBN, BPM), pp. 133–144.
SOSP-1991-DravesBRD #communication #continuation #operating system #thread #using: Using Continuations to Implement Thread Management and Communication in Operating Systems (RD, BNB, RFR, RWD), pp. 122–136.
ADC-1991-Berry #automaton: Concurrent Abstract Machines (Abstract) (GB), p. 49.
CAAP-1991-BoerP #constraints #programming: A Fully Abstract Model for Concurrent Constraint Programming (FSdB, CP), pp. 296–319.
CAAP-1991-NajmS #analysis #calculus #process: Object-Based Concurrency: A Process Calculus Analysis (EN, JBS), pp. 359–380.
STOC-1991-Shapiro #category theory: Separating Concurrent Languages with Categories of Language Embeddings (EYS), pp. 198–208.
CAV-1991-AvruninBC #analysis #integer #programming: Integer Programming in the Analysis of Concurrent Systems (GSA, UAB, JCC), pp. 92–102.
CAV-1991-GodefroidW #partial order #performance #safety #using #verification: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties (PG, PW), pp. 332–342.
CAV-1991-Jensen: The Concurrency Workbench with Priorities (CTJ), pp. 147–157.
CAV-1991-NicolaFGR #behaviour #framework #logic #verification: An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems (RDN, AF, SG, GR), pp. 37–47.
CSL-1991-Pinchinat #comparative #process #semantics: Ordinal Processes in Comparative Concurrency Semantics (SP), pp. 293–305.
ICLP-1991-CodishFM #analysis #logic programming #source code: Suspension Analysis for Concurrent Logic Programs (MC, MF, KM), pp. 331–345.
ICLP-1991-KorslootT #compilation #logic programming #programming language: Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages (MK, ET), pp. 457–471.
ISLP-1991-MontanariR #constraints #programming: True Concurrency in Concurrent Constraint Programming (UM, FR), pp. 694–713.
IWPTS-1991-ArakawaS #generative #source code #testing: A Test Case Generation Method for Concurrent Programs (NA, TS), pp. 95–106.
TAV-1991-DuesterwaldS #analysis #data flow #framework #using: Concurrency Analysis in the Presence of Procedures Using a Data-Flow Framework (ED, MLS), pp. 36–48.
TAV-1991-LongC #analysis #data flow: Data Flow Analysis of Concurrent Systems that Use the Rendezvous Model of Synchronization (DLL, LAC), pp. 21–35.
PODS-1990-JohnsonS #algorithm #analysis #framework #performance: A Framework for the Performance Analysis of Concurrent B-tree Algorithms (TJ, DS), pp. 273–287.
SIGMOD-1990-BadrinathR #evaluation #multi #performance #protocol #semantics: Performance Evaluation of Semantics-based Multilevel Concurrency Control Protocols (BRB, KR), pp. 163–172.
SIGMOD-1990-KoganJ #architecture #database #multi: Concurrency Control in Multilevel-Secure Databases Based on Replicated Architecture (BK, SJ), pp. 153–162.
VLDB-1990-Mohan #multi #named #transaction: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes (CM), pp. 392–405.
SEI-1990-Bustard #education #experience #roadmap: An Experience of Teaching Concurrency: looking back, looking forward (DWB), pp. 123–135.
ICALP-1990-Droste #automaton: Concurrency, Automata and Domains (MD), pp. 195–208.
ICALP-1990-PrasadGM #algebra #functional #integration #programming #semantics #symmetry: Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming (SP, AG, PM), pp. 765–778.
VDME-1990-WoodcockM #refinement: Refinement of State-Based Concurrent Systems (JW, CM), pp. 340–351.
GG-1990-KaplanLG #specification: Specifying Concurrent Languages and Systems with ???-Grammars (SMK, JPL, SKG), pp. 475–489.
CSCW-1990-HarrisonOS #coordination #development: Coordinating Concurrent Development (WHH, HO, PFS), pp. 157–168.
OOPSLA-ECOOP-1990-AndreoliP #exclamation #process: LO and Behold! Concurrent Structured Processes (JMA, RP), pp. 44–56.
OOPSLA-ECOOP-1990-KahnS #constraints #programming: Actors as a Special Case of Concurrent Constraint Programming (KMK, VAS), pp. 57–66.
OOPSLA-ECOOP-1990-Meseguer #logic: A Logical Theory of Concurrent Objects (JM), pp. 101–115.
ALP-1990-DershowitzL: An Abstract Concurrent Machine for Rewriting (ND, NL), pp. 318–331.
ALP-1990-GabbrielliL #constraints #fixpoint #logic programming #semantics #source code: Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs (MG, GL), pp. 204–216.
POPL-1990-SaraswatR #constraints #programming: Concurrent Constraint Programming (VAS, MCR), pp. 232–245.
POPL-1990-Stark #automaton #on the: On the Relations Computable by a Class of Concurrent Automata (EWS), pp. 329–340.
WAGA-1990-Alblas #attribute grammar #incremental: Concurrent Incremental Attribute Evaluation (HA), pp. 343–358.
CC-1990-Lampe #attribute grammar #named: MATE — A Metasystem with Concurrent Attribute Evaluation (JL), pp. 222–223.
PPoPP-1990-ChienD: Concurrent Aggregates (CA) (AAC, WJD), pp. 187–196.
PPoPP-1990-Herlihy #data type #implementation: A Methodology for Implementing Highly Concurrent Data Structures (MH), pp. 197–206.
PPoPP-1990-HiebD #continuation: Continuations and Concurrency (RH, RKD), pp. 128–136.
PPoPP-1990-HseushK #debugging #modelling #parallel: Modeling Concurrency in Parallel Debugging (WH, GEK), pp. 11–20.
PPoPP-1990-LiNP #parallel #realtime #source code: Real-Time, Concurrent Checkpoint for Parallel Programs (KL, JFN, JSP), pp. 79–88.
ESOP-1990-Gribomont #development #incremental: Development of Concurrent Systems by Incremental Transformations (EPG), pp. 161–176.
STOC-1990-KleinST #algorithm #approximate #performance: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.
CAV-1990-PengP #approach #communication #detection #finite #network #problem #state machine: A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines (WP, SP), pp. 243–252.
CLP-1990-Saraswat90 #constraints #paradigm #programming: The Paradigm of Concurrent Constraint Programming (VAS), pp. 777–778.
LICS-1990-HarelRV #bound #on the #power of #reasoning #source code: On the Power of Bounded Concurrency~III: Reasoning About Programs (DH, RR, MYV), pp. 478–488.
NACLP-1990-BoerP #comparison #logic programming: Concurrent Logic Programming: Asynchronism and Language Comparison (FSdB, CP), pp. 175–194.
NACLP-1990-CodognetCC #abstract interpretation #logic: Abstract Interpretation for Concurrent Logic Languages (CC, PC, MMC), pp. 215–232.
PODS-1989-FuK #transaction: Concurrency Control of Nested Transactions Accessing B-Trees (AWCF, TK), pp. 270–285.
PODS-1989-Weihl: The Impact of Recovery on Concurrency Control (WEW), pp. 259–269.
SIGMOD-1989-AgrawalS #composition #database #multi: Modular Synchronization in Multiversion Databases: versionControl and Concurrency Control (DA, SS), pp. 408–417.
SIGMOD-1989-CareyL #database #distributed #parallel #performance: Parallelism and Concurrency Control Performance in Distributed Database Machines (MJC, ML), pp. 122–133.
SIGMOD-1989-EllisG: Concurrency Control in Groupware Systems (CAE, SJG), pp. 399–407.
VLDB-1989-DuE #correctness: Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase (WD, AKE), pp. 347–355.
ICALP-1989-LiV #how: How to Share Concurrent Asynchronous Wait-Free Variables (ML, PMBV), pp. 488–505.
SEKE-1989-Tang #automation #infinity #source code #verification: Temporal Theory for Automatic Verification of Infinite State Concurrent Programs (TGT), pp. 134–139.
SEKE-1989-YangC #ada #testing: Testing Concurrent Ada Program with Reproducible Test Cases (RDY, CGC), pp. 19–24.
ECOOP-1989-KafuraL #inheritance #object-oriented: Inheritance in Actor Based Concurrent Object-Oriented Languages (DGK, KHL), pp. 131–145.
POPL-1989-AttieE #process #synthesis: Synthesis of Concurrent Systems with Many Similar Sequential Processes (PCA, EAE), pp. 191–201.
ESEC-1989-MorascaP #ada #execution #source code #symbolic computation #using #validation: Validation of Concurrent ADA Programs using Symbolic Execution (SM, MP), pp. 469–486.
ICSE-1989-Hsieh #analysis #source code: Timing Analysis of Cyclic Concurrent Programs (CSH), pp. 312–318.
ICSE-1989-LongC #analysis #graph #interactive: Task Interaction Graphs for Concurrency Analysis (DLL, LAC), pp. 44–52.
DAC-1989-JonePP #testing: A Scheme for Overlaying Concurrent Testing of VLSI Circuits (WBJ, CAP, MP), pp. 531–536.
CAAP-1989-Boudol #communication #towards #λ-calculus: Towards a Lambda-Calculus for Concurrent and Communicating Systems (GB), pp. 149–161.
CCIPL-1989-GiacaloneMP #functional #integration #named #programming #symmetry: FACILE: A Symmetric Integration of Concurrent and Functional Programming (AG, PM, SP), pp. 184–209.
CCIPL-1989-Gribomont #development #source code: Development of Concurrent Programs: An Example (EPG), pp. 210–224.
STOC-1989-DolevS #bound: Bounded Concurrent Time-Stamp Systems Are Constructible (DD, NS), pp. 454–466.
CSL-1989-Penczek #branch #logic: A Concurrent Branching Time Temporal Logic (WP), pp. 337–354.
LICS-1989-Moschovakis #formal method #game studies #modelling: A Game-Theoretic Modeling of Concurrency (YNM), pp. 154–163.
NACLP-1989-GaifmanMS #behaviour #constraints #logic programming #semantics #source code: Reactive Behaviour Semantics for Concurrent Constraint Logic Programs (HG, MJM, EYS), pp. 553–569.
NACLP-1989-KahnK #logic programming: Money as a Concurrent Logic Program (KMK, WAK), pp. 513–535.
NACLP-1989-Nystrom #execution #logic: Variable-Free Execution of Concurrent Logic Languages (SON), pp. 536–552.
TAV-1989-AvruninWD #analysis #automation: Experiments in Automated Analysis of Concurrent Software Systems (GSA, JCW, LKD), pp. 124–130.
TAV-1989-YoungTFB #analysis #development: Integrated Concurrency Analysis in a Software Development Enviornment (MY, RNT, KF, DB), pp. 200–209.
PODS-1988-Hadzilacos #algorithm #graph #multi: Serialization Graph Algorithms for Multiversion Concurrency Control (TH), pp. 135–141.
PODS-1988-HerlihyW #data type #hybrid: Hybrid Concurrency Control for Abstract Data Types (MH, WEW), pp. 201–210.
PODS-1988-Kelter #protocol #queue: The Queue Protocol: A Deadlock-free Homogeneous Non-Two-Phase Locking Protocol (UK), pp. 142–151.
PODS-1988-LaninS #set: Concurrent Set Manipulation without Locking (VL, DS), pp. 211–220.
SIGMOD-1988-AbbadiT #paradigm #protocol: The Group Paradigm for Concurrency Control Protocols (AEA, ST), pp. 126–134.
SIGMOD-1988-RoeslerB #distributed #modelling #object-oriented #semantics: Deadlock Resolution and Semantic Lock Models in Object-Oriented Distributed Systems (MR, WAB), pp. 361–370.
VLDB-1988-AspnesFLMW #formal method #transaction: A Theory of Timestamp-Based Concurrency Control for Nested Transactions (JA, AF, NAL, MM, WEW), pp. 431–444.
VLDB-1988-CareyL #algorithm #case study #distributed #performance #replication: Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication (MJC, ML), pp. 13–25.
VLDB-1988-PonsV #database #distributed: Mixed concurrency control: Dealing with heterogeneity in distributed database systems (JFP, JFV), pp. 445–456.
SEI-1988-Tai: A Course on Software Enigneering for Concurrent Systems (KCT), pp. 106–119.
ICALP-1988-KokR #semantics: Contractions in Comparing Concurrent Semantics (JNK, JJMMR), pp. 317–332.
ECOOP-1988-DoiKH #implementation #kernel #object-oriented #operating system #using: An Implementation of an Operating System Kernel Using Concurrent Object-Oriented Language ABCL/c+ (ND, YK, KH), pp. 250–266.
ECOOP-1988-HondaY #debugging: Debugging Concurrent Systems Based on Object Groups (YH, AY), pp. 267–282.
ECOOP-1988-ParringtonS #implementation #object-oriented #reliability: Implementing Concurrency Control in Reliable Object-Oriented Systems (GDP, SKS), pp. 233–249.
ECOOP-1988-VaucherLM #object-oriented #prolog: SCOOP, Structured Concurrent Object-Oriented Prolog (JGV, GL, JM), pp. 191–211.
OOPSLA-1988-Shibayama #approach #distributed #how #implementation: How To Invent Distributed Implementation Schemes of an Object-Based Concurrent Language: A Transformational Approach (ES), pp. 297–305.
OOPSLA-1988-WatanabeY #object-oriented: Reflection in an Object-Oriented Concurrent Language (TW, AY), pp. 306–315.
PLDI-1988-AppelEL #multi #realtime: Real-Time Concurrent Collection on Stock Multiprocessors (AWA, JRE, KL), pp. 11–20.
PLDI-1988-SeshadriWJWYS #analysis #compilation #semantics: Semantic Analysis in a Concurrent Compiler (VS, DBW, MDJ, SW, CPY, IS), pp. 233–240.
PLDI-1988-Stone #case study #debugging #process: Debugging Concurrent Processes: A Case Study (JMS), pp. 145–153.
Best-of-PLDI-1988-Appel #multi #realtime: Real-time concurrent collection on stock multiprocessors (with retrospective) (AWA), pp. 205–216.
ICSE-1988-ChiuL #database #distributed #specification: High-Level Specification of Concurrency Control in Distributed Database Systems (LC, MTL), pp. 309–319.
ICSE-1988-Roman #scalability #visualisation: Language and Visualization Support for Large-Scale Concurrency (GCR), pp. 296–308.
DAC-1988-AgrawalCA #contest #generative #named: Contest: A Concurrent Test Generator for Sequential Circuits (VDA, KTC, PA), pp. 84–89.
DAC-1988-GaedeRMB #automation #named #parallel #testing #using: CATAPULT: Concurrent Automatic Testing Allowing Parallelization and Using Limited Topology (RKG, DER, MRM, KMB), pp. 597–600.
DAC-1988-GaiMS #algorithm #fault #performance #simulation: The Performance of the Concurrent Fault Simulation Algorithms in MOZART (SG, PLM, FS), pp. 692–697.
DAC-1988-WidyaLW #database #design: Concurrency Control in a VLSI Design Database (IW, TGRvL, PvdW), pp. 357–362.
PPEALS-1988-LarusH #execution #lisp #source code: Restructuring Lisp Programs for Concurrent Execution (JRL, PNH), pp. 100–110.
ESOP-1988-KaplanK #abstraction #graph #named #programming: Garp: Graph Abstractions for Concurrent Programming (SMK, GEK), pp. 191–205.
CSL-1988-DaneluttoM #approach #finite #logic: A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems (MD, AM), pp. 63–79.
JICSCP-1988-AlkalajS88 #architecture #prolog: An Architectural Model for a Flat Concurrent Prolog Processor (LA, EYS), pp. 1277–1297.
LICS-1988-Dam #composition #logic: Relevance Logic and Concurrent Composition (MD), pp. 178–185.
LICS-1988-DeganoNM #consistency #on the #semantics: On the Consistency of “Truly Concurrent” Operational and Denotational Semantics (PD, RDN, UM), pp. 133–141.
LICS-1988-GerthCLS #prolog #semantics: Fully Abstract Denotational Semantics for Flat Concurrent Prolog (RG, MC, YL, EYS), pp. 320–335.
PODS-1987-NurmiSW #database: Concurrency Control in Database Structures with Relaxed Balance (ON, ESS, DW), pp. 170–176.
PODS-1987-SunT #multi #performance: Performance Results in Multiversion Timestamp Concurrency Control with Predeclared Writesets (RS, GT), pp. 177–184.
PODS-1987-WangL #algorithm #database #distributed: The Precedence-Assignment Model for Distributed Database Concurrency Control Algorithms (CPW, VOKL), pp. 119–128.
VLDB-1987-NoeW #performance: Measured Performance of Time Interval Concurrency Control Techniques (JDN, DBW), pp. 359–367.
ICALP-1987-Diekert #on the #process: On the Knuth-Bendix Completion for Concurrent Processes (VD), pp. 42–53.
FPCA-1987-NorthR #garbage collection #hardware: Concurrent garbage collection on stock hardware (SCN, JHR), pp. 113–133.
ECOOP-1987-BriotY #inheritance #object-oriented: Inheritance and Synchronization in Concurrent OOP (JPB, AY), pp. 32–40.
ECOOP-1987-MossK #owl: Concurrency Features for the Trellis/Owl Language (JEBM, WHK), pp. 171–180.
PLDI-1987-KearnsF #named: CCAL: An interpreted language for experimentation in concurrent control (PK, CC, MF), pp. 283–291.
POPL-1987-HerlihyW #axiom: Axioms for Concurrent Objects (MH, JMW), pp. 13–26.
POPL-1987-MannaP #source code #specification #verification: Specification and Verification of Concurrent Programs By Forall-Automata (ZM, AP), pp. 1–12.
POPL-1987-Oles #semantics: Semantics for Concurrency without Powerdomains (FJO), pp. 211–222.
POPL-1987-Saraswat #logic programming #programming language #semantics: The Concurrent Logic Programming Language CP: Definition and Operational Semantics (VAS), pp. 49–62.
POPL-1987-Stark #network #process #semantics: Concurrent Transition System Semantics of Process Networks (EWS), pp. 199–210.
ICSE-1987-Ladkin #dependence #process #specification #synthesis: Specification of Time Dependencies and Synthesis of Concurrent Processes (PBL), pp. 106–115.
AS-1987-AstesianoR #calculus: SMoLCS-Driven Concurrent Calculi (EA, GR), pp. 169–201.
AF-1987-ClarkF #declarative #logic programming: A Declarative Environment for Concurrent Logic Programming (KLC, ITF), pp. 212–242.
CAAP-1987-BoudolC #on the #partial order #semantics: On the Semantics of Concurrency: Partial Orders and Transition Systems (GB, IC), pp. 123–137.
ICLP-1987-NaishTR87 #database #prolog: Concurrent Database Updates in PROLOG (LN, JAT, KR), pp. 178–195.
ICLP-1987-Sato87 #logic #named: Quty: A Concurrent Language Based on Logic and Function (MS), pp. 1034–1056.
LICS-1987-GaifmanP #modelling #partial order: Partial Order Models of Concurrency and the Computation of Functions (HG, VRP), pp. 72–85.
LICS-1987-Vardi #framework #source code #verification: Verification of Concurrent Programs: The Automata-Theoretic Framework (MYV), pp. 167–176.
SLP-1987-Wilson87 #case study #logic programming: Concurrent α-β: A Study in Concurrent Logic Programming (WGW), pp. 360–367.
PODS-1986-Weikum #multi: A Theoretical Foundation of Multi-Level Concurrency Control (GW), pp. 31–43.
VLDB-1986-HsuY: Concurrent Operations in Extendible Hashing (MH, WPY), pp. 241–247.
ICALP-1986-ArquesFGG #algorithm #approach #combinator #comparison #database: Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach (DA, JF, MTG, PG), pp. 11–20.
ICALP-1986-Lisper #equivalence #synthesis: Synthesis and Equivalence of Concurrent Systems (BL), pp. 226–235.
ICALP-1986-RosierY #complexity #finite #on the #probability #source code #termination: On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
ICALP-1986-Stirling #composition #correctness #logic: A Compositional Reformulation of Owicki-Gries’s Partial Correctness Logic for a Concurrent While Language (CS), pp. 407–415.
GG-1986-Kreowski #graph grammar #parallel: Is parallelism already concurrency? Part 1: Derivations in graph grammars (HJK), pp. 343–360.
GG-1986-KreowskiW #graph grammar #parallel #process: Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars (HJK, AW), pp. 361–377.
OOPSLA-1986-IshikawaT #implementation #information management #object-oriented #representation: A Concurrent Object-Oriented Knowledge Representation Language Orient84/K: Its Features and Implementation (YI, MT), pp. 232–241.
OOPSLA-1986-KahnTMB #logic programming #programming language: Objects in Concurrent Logic Programming Languages (KMK, EDT, MSM, DGB), pp. 242–257.
OOPSLA-1986-YonezawaBS #object-oriented #programming: Object-Oriented Concurrent Programming in ABCL/1 (AY, JPB, ES), pp. 258–268.
POPL-1986-BarringerKP #logic: A Really Abstract Concurrent Model and its Temporal Logic (HB, RK, AP), pp. 173–183.
POPL-1986-LengauerH #network #sorting #theorem: A Mechanically Certified Theorem about Optimal Concurrency of Sorting Networks (CL, CHH), pp. 307–317.
DAC-1986-BruckKKR #algorithm #composition #synthesis: Synthesis of concurrent modular controllers from algorithmic descriptions (RB, BK, TK, FJR), pp. 285–292.
ESOP-1986-TanakaK #compilation #prolog #queue: Compiling Extended Concurrent Prolog — Single Queue Compilation (JT, MK), pp. 301–314.
STOC-1986-CourcoubetisVW #reasoning #source code: Reasoning about Fair Concurrent Programs (CC, MYV, PW), pp. 283–294.
ICLP-1986-Abramson86 #logic: Sequential and Concurrent Deterministic Logic Grammars (HA), pp. 389–395.
ICLP-1986-Beckman86 #logic programming #programming language #semantics #towards: Towards a Formal Semantics for Concurrent Logic Programming Languages (LB), pp. 335–349.
LICS-1986-Brookes #correctness #csp #proving #semantics: A Semantically Based Proof System for Partial Correctness and Deadlock in CSP (SDB), pp. 58–65.
LICS-1986-MonteiroP #formal method: A Sheaf-Theoretic Model of Concurrency (LM, FCNP), pp. 66–76.
PODS-1985-Ellis #linear: Concurrency and Linear Hashing (CSE), pp. 1–7.
PODS-1985-GoodmanS #semantics: Semantically-based Concurrency Control for Search Structures (NG, DS), pp. 8–19.
PODS-1985-HadzilacosP #algorithm #aspect-oriented #multi: Algorithmic Aspects of Multiversion Concurrency Control (TH, CHP), pp. 96–104.
PODS-1985-PapadimitriouY #complexity #reliability: The Complexity of Reliable Concurrency Control (CHP, MY), pp. 230–234.
PODS-1985-Sagiv: Concurrent Operations on B-Trees with Overtaking (YS), pp. 28–37.
PODS-1985-TuzhilinS #approach #correctness #semantics #transaction: A Semantic Approach to Correctness of Concurrent Transaction Executions (AT, PGS), pp. 85–95.
SIGMOD-1985-AgrawalCL #modelling #performance: Models for Studying Concurrency Control Performance: Alternatives and Implications (RA, MJC, ML), pp. 108–121.
VLDB-1985-DadamLPS #information management #maintenance: Selective Deferred Index Maintenance & Concurrency Control in Integrated Information Systems (PD, VYL, UP, GS), pp. 142–150.
VLDB-1985-LausenSW #policy: Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy (GL, ESS, PW), pp. 270–281.
VLDB-1985-MondR #database #using: Concurrency Control in B+-Trees Databases Using Preparatory Operations (YM, YR), pp. 331–334.
ICALP-1985-BakkerMO #finite #infinity #semantics: Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency (JWdB, JJCM, ERO), pp. 149–157.
ICALP-1985-ZwiersRB #composition #network: Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem (JZ, WPdR, PvEB), pp. 509–519.
POPL-1985-Lamport #specification #what #why: What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority (LL), pp. 78–83.
POPL-1985-LichtensteinP #finite #linear #source code #specification: Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (OL, AP), pp. 97–107.
ICSE-1985-FrancescoLV #debugging #interactive: An Interactive Debugger for a Concurrent Language (NDF, DL, GV), pp. 320–329.
ICSE-1985-StavelyBOT #design #tool support: A Collection of Software Tools for Analyzing Design of Concurrent Software Systems (AMS, DCB, SPO, GBT), pp. 111–118.
DAC-1985-BryantS #evaluation #fault #performance: Performance evaluation of FMOSSIM, a concurrent switch-level fault simulator (REB, MDS), pp. 715–719.
SOSP-1985-MullenderT #distributed: A Distributed File Service Based on Optimistic Concurrency Control (SJM, AST), pp. 51–62.
CAAP-1985-AstesianoMRW #algebra #on the #specification: On the Parameterized Algebraic Specification of Concurrent Systems (EA, GM, GR, MW), pp. 342–358.
CSE-1985-IsleL #modelling: Modelling Concurrent Modules (RI, KPL), pp. 309–324.
CSE-1985-YonezawaM #industrial #object-oriented #programming: Object Oriented Concurrent Programming and Industrial Software Production (AY, YM), pp. 395–409.
STOC-1985-BakkerMOZ #semantics: Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency (JWdB, JJCM, ERO, JIZ), pp. 252–262.
STOC-1985-Peleg #logic: Concurrent Dynamic Logic (DP), pp. 232–239.
SLP-1985-LeeG85 #multi #prolog: Concurrent Prolog in a Multiprocess Environment (RKSL, RG), pp. 100–109.
SLP-1985-MiyazakiTC85 #implementation #prolog: A Sequential Implementation of Concurrent Prolog Based on the Shallow Binding Scheme (TM, AT, TC), pp. 110–118.
SLP-1985-UedaC85 #compilation #prolog: Concurrent Prolog Compiler on Top of Prolog (KU, TC), pp. 119–126.
PODS-1984-BuckleyS #graph #protocol #using: Concurrency Control in Graph Protocols by Using Edge Locks (GNB, AS), pp. 45–50.
PODS-1984-FordC #algorithm: Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms (RF, JC), pp. 51–60.
PODS-1984-LausenSW: Maximal Concurrency by Locking (GL, ESS, PW), pp. 38–44.
SIGMOD-1984-BoralG #adaptation #algorithm #self #towards: Towards A Self-Adapting Centralized Concurrency Control Algorithm (HB, IG), pp. 18–32.
VLDB-1984-CareyS #algorithm #database #performance: The Performance of Concurrency Control Algorithms for Database Management Systems (MJC, MS), pp. 107–118.
ICALP-1984-ColbournP #network: Concurrent Transmissions in Broadcast Networks (CJC, AP), pp. 128–136.
POPL-1984-Shapiro #programming #prolog: Systems Programming in Concurrent Prolog (EYS), pp. 93–105.
ICSE-1984-Moawad #comparison #modelling #reliability: Comparison of Concurrent Software Reliability Models (RM), pp. 222–229.
DAC-1984-JhonK #analysis #data flow #design: Deadlock analysis in the design of data-flow circuits (CSJ, RMK), pp. 705–707.
STOC-1984-Manber #information management #maintenance #on the: On Maintaining Dynamic Information in a Concurrent Environment (UM), pp. 273–278.
ILPC-1984-BoscoGG84 #logic #process #prolog #specification #verification: A Prolog System for the Verification of Concurrent Processes Against Temporal Logic Specifications (PGB, GG, EG), pp. 219–229.
ILPC-1984-HirakawaCF84 #lazy evaluation #prolog: Eager and Lazy Enumerations in Concurrent Prolog (HH, TC, KF), pp. 89–100.
ILPC-1984-Levy84 #algorithm #prolog #unification: A Unification Algorithm for Concurrent Prolog (JL), pp. 333–341.
ILPC-1984-Nakamura84 #evaluation #logic programming #source code: Associative Concurrent Evaluation of Logic Programs (KN), pp. 321–331.
SLP-1984-Gelernter84 #programming #prolog: A Note on Systems Programming in Concurrent Prolog (DG), pp. 76–82.
SLP-1984-HellersteinS84 #algorithm #experience #implementation #parallel #prolog: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience (LH, EYS), pp. 99–115.
SLP-1984-ShapiroM84 #implementation #prolog #self #specification: Fair, Biased, and Self-Balancing Merge Operators: Their Specification and Implementation in Concurrent Prolog (EYS, CM), pp. 83–90.
PODS-1983-Carey: Granularity Hierarchies in Concurrency Control (MJC), pp. 156–165.
PODS-1983-Ellis #distributed: Extendible Hashing for Concurrent Operations and Distributed Data (CSE), pp. 106–116.
PODS-1983-HsuM #composition #database: Hierarchical Database Decomposition — A Technique for Database Concurrency Control (MH, SEM), pp. 182–191.
PODS-1983-KorthKNR #algorithm #comprehension #detection #distributed #framework: A Framework for Understanding Distributed (Deadlock Detection) Algorithms (HFK, RK, AN, JTR), pp. 192–202.
PODS-1983-Lynch #transaction: Concurrency Control for Resilient Nested Transactions (NAL), pp. 166–181.
SIGMOD-1983-Carey #algorithm #database: An Abstract Model of Database Concurrency Control Algorithms (MJC), pp. 97–107.
VLDB-1983-DasguptaK #database #protocol: A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases (PD, ZMK), pp. 92–94.
VLDB-1983-PeinlR #comparison #database #empirical: Empirical Comparison of Database Concurrency Schemes (PP, AR), pp. 97–108.
VLDB-1983-Reimer #problem: Solving the Phantom Problem by Predicative Optimistic Concurrency Control (MR), pp. 81–88.
ICALP-1983-HartS #how #probability: Concurrent Probabilistic Program, or: How to Schedule if You Must (SH, MS), pp. 304–318.
POPL-1983-ClarkeES #approach #automation #finite #logic #specification #using #verification: Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach (EMC, EAE, APS), pp. 117–126.
DAC-1983-Ulrich #design #simulation #verification: A design verification methodology based on concurrent simulation and clock suppression (EU), pp. 709–712.
PODS-1982-ManberL: Concurrency Control in a Dynamic Search Structure (UM, REL), pp. 268–282.
PODS-1982-PapadimitriouK #multi #on the: On Concurrency Control by Multiple Versions (CHP, PCK), pp. 76–82.
PODS-1982-Reuter: Concurrency on High-trafic Data Elements (AR0), pp. 83–92.
SIGMOD-1982-ChanFLNR #implementation: The Implementation of an Integrated Concurrency Control and Recovery Scheme (AC, SF, WTKL, AN, DRR), pp. 184–191.
VLDB-1982-BernsteinG #distributed: A Sophisticate’s Introduction to Distributed Concurrency Control (PAB, NG), pp. 62–76.
VLDB-1982-KedemMS #performance #protocol: An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols (ZMK, CM, AS), pp. 91–97.
VLDB-1982-Xu #formal method #transaction: A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets (JX), pp. 77–90.
GG-1982-Ehrig #aspect-oriented #graph grammar: Aspects of concurrency in graph grammars (HE), pp. 58–81.
POPL-1982-HailpernO #composition #source code #verification: Modular Verification of Concurrent Programs (BH, SSO), pp. 322–336.
POPL-1982-HartSP #probability #source code #termination: Termination of Probabilistic Concurrent Programs (SH, MS, AP), pp. 1–6.
STOC-1982-DeBakkerZ #semantics: Denotational Semantics of Concurrency (JWdB, JIZ), pp. 153–158.
ILPC-1982-Bowen82 #execution #logic: Concurrent Execution of Logic (KAB), pp. 26–30.
ILPC-1982-FurukawaNM82 #interpreter #programming #prolog: Prolog Interpreter Based on Concurrent Programming (KF, KN, YM), pp. 38–44.
ILPC-1982-Monteiro82 #horn clause #logic #specification: A Horn Clause-like Logic for Specifying Concurrency (LM), pp. 1–8.
SIGMOD-1981-KedemS #database #using: Deadlock Removal Using Partial Rollback in Database Systems (DSF, ZMK, AS), pp. 65–73.
SIGMOD-1981-Lin #database #distributed #evaluation #performance: Performance Evaluation of Two Concurrency Control Mechanisms in a Distributed Database System (WTKL), pp. 84–92.
SIGMOD-1981-StearnsR #database #distributed #using: Distributed Database Concurrency Controls Using Before-Values (RES, DJR), pp. 74–83.
VLDB-1981-BeeriO #algorithm #detection #independence: A Resource Class Independent Deadlock Detection Algorithm (CB, RO), pp. 166–178.
VLDB-1981-Schlageter #database #distributed: Optimistic Methods for Concurrency Control in Distributed Database Systems (GS), pp. 125–130.
VLDB-1981-Soderlund #assessment #database #modelling: Concurrent Data Base Reorganization — Assessment of a Powerful Technique through Modeling (LS), pp. 499–509.
ICALP-1981-LehmannPS #termination: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination (DJL, AP, JS), pp. 264–277.
PS-1981-Nielsen: Concurrency (LSN), pp. 415–422.
ICSE-1981-PenedoBE #algorithm #generative: An Algorithm to Support Code-Skeleton Generation for Concurrent Systems (MH(P, DMB, GE), pp. 125–135.
DAC-1981-KozawaTSMI #algorithm: A concurrent pattern operation algorithm for VLSI mask data (TK, AT, JS, CM, TI), pp. 563–570.
STOC-1981-Yannakakis #correctness #database: Issues of Correctness in Database Concurrency Control by Locking (MY), pp. 363–367.
SIGMOD-1980-KwongW #on the: On B-Trees: Routing Schemes and Concurrency (YSK, DW), pp. 207–211.
VLDB-1980-Badal #analysis #database #distributed #performance: The Analysis of the Effects of Concurrency Control on Distributed Database System Performance (DZB), pp. 376–383.
VLDB-1980-BayerEHR #database #distributed: Distributed Concurrency Control in Database Systems (RB, KE, HH, AR), pp. 275–284.
VLDB-1980-BernsteinG80a #algorithm #database #distributed: Timestamp-Based Algorithms for Concurrency Control in Distributed Database Systems (PAB, NG), pp. 285–300.
ICALP-1980-HennessyM #nondeterminism #on the: On Observing Nondeterminism and Concurrency (MH, RM), pp. 299–309.
LISP-1980-Marti #compilation #control flow #lisp: Compilation Techniques for a Control-Flow Concurrent LISP System (JM), pp. 203–207.
DAC-1980-dAbreuT #fault #functional: An accurate functional level concurrent fault simulator (MAd, EWT), pp. 210–217.
DAC-1980-UlrichLPTKEB #fault #performance #simulation: High-speed concurrent fault simulation with vectors and scalars (EU, DL, NP, JT, MK, TE, RB), pp. 374–380.
SIGMOD-1979-IraniL #database #modelling #network #transaction: Queuing Network Models for Concurrent Transaction Processing in a Database System (KBI, HLL), pp. 134–142.
SIGMOD-1979-KungP #database: An Optimality Theory of Concurrency Control for Databases (HTK, CHP), pp. 116–126.
VLDB-1979-KawazuMIT #algorithm #database #detection #distributed: Two-Phase Deadlock Detection Algorithm in Distributed Databases (SK, SM, KI, KT), pp. 360–367.
VLDB-1979-KungR #on the: On Optimistic Methods for Concurrency Control (HTK, JTR), p. 351.
VLDB-1979-LuqueRRB #database: Database Concurrent Processor (EL, JJR, AR, AB), pp. 273–279.
ICALP-1979-ShieldsL #semantics: A Formal Semantics for Concurrent Systems (MWS, PEL), pp. 571–584.
POPL-1979-Clarke #invariant #source code #synthesis: Synthesis of Resource Invariants for Concurrent Programs (EMC), pp. 211–221.
ICSE-1979-RiddleBDE #detection #source code: Anomaly Detection in Concurrent Programs (WER, GB, CD, BE), pp. 265–273.
STOC-1979-TouegU #network: Deadlock-Free Packet Switching Networks (ST, JDU), pp. 89–98.
SIGMOD-1978-LienW #consistency: Consistency, Concurrency and Crash Recovery (YEL, PJW), pp. 9–14.
VLDB-1978-KungL #database #problem: A Concurrent Database Manipulation Problem: Binary Search Trees (HTK, PLL), p. 498.
GG-1978-Wileden #analysis #design #graph grammar: Relationships Between Graph Grammars and the Design and Analysis of Concurrent Software (JCW), pp. 456–463.
POPL-1978-Mizell #aspect-oriented #design #verification: Verification and Design Aspects of “True” Concurrency (DWM), pp. 171–175.
POPL-1978-OgdenRR #complexity: Complexity of Expressions Allowing Concurrency (WFO, WER, WCR), pp. 185–194.
ICSE-1978-CamposE #design: Concurrent Software System Design, Supported by SARA at the Age of One (IMC, GE), pp. 230–242.
DAC-1978-AgerwalaC #synthesis: A synthesis rule for concurrent systems (TA, YCCA), pp. 305–311.
SIGMOD-1977-Lomet #algorithm #database: A Practical Deadlock Avoidance Algorithm for Data Base Systems (DBL), pp. 122–127.
SIGMOD-1977-MunzK #database #simulation: Concurrency in Database Systems — A Simulation Study (RM, GK), pp. 111–120.
DAC-1977-AbramoviciBK #fault #functional #modelling #simulation: Concurrent fault simulation and functional level modeling (MA, MAB, KK), pp. 128–137.
DAC-1977-HeathCC #development #hardware #named: CDL — A tool for concurrent hardware and software development (JRH, BDC, TTC), pp. 445–449.
SOSP-1977-Lohr #pascal: Beyond Concurrent Pascal (KPL), pp. 173–180.
SIGMOD-1976-Macri #data transformation #detection: Deadlock Detection and Resolution in a CODASYL Based Data Management System (PPM), pp. 45–49.
DIPL-1976-Dennis #design: A language design for structured concurrency (JBD), pp. 231–242.
ICSE-1976-SilberschatzKB #pascal #resource management: Extending Concurrent Pascal to Allow Dynamic Resource Management (AS, RBK, AJB), p. 236.
VLDB-1975-Sekino #multi: Multiple Concurrent Updates (LCS), pp. 505–507.
POPL-1975-Lester #execution: Program Schemas with Concurrency: Execution Time and Hangups (BPL), pp. 185–193.
DAC-1975-SchulerUBB #generative #logic #random testing #simulation #testing #using: Random test generation using concurrent logic simulation (DMS, EGU, TEB, SPB), pp. 261–267.
DAC-1973-UlrichB #network #simulation: The concurrent simulation of nearly identical digital networks (EGU, TEB), pp. 145–150.
SIGFIDET-1972-ShemerC #case study #database: Database Sharing: A Study of Interference, Roadblock and Deadlock (JES, AJC), pp. 147–163.
SOSP-1971-Fontao #algorithm: A Concurrent Algorithm for Avoiding Deadlocks (ROF), pp. 72–79.
SOSP-1971-Holt: Some Deadlock Properties of Computer Systems (RCH), pp. 64–71.