Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- short-paperJune 2024
Poster: Dynamic Ego-Velocity Estimation Using Moving mmWave Radar: A Phase-Based Approach
MOBISYS '24: Proceedings of the 22nd Annual International Conference on Mobile Systems, Applications and ServicesJune 2024, Pages 692–693https://doi.org/10.1145/3643832.3661425Precise ego-motion measurement is crucial for various applications, including robotics, augmented reality, and autonomous navigation. In this poster, we propose mmPhase, an odometry framework based on single-chip millimetre-wave (mmWave) radar for robust ...
- research-articleJanuary 2024
How Hard Is Weak-Memory Testing?
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue POPLArticle No.: 66, Pages 1978–2009https://doi.org/10.1145/3632908Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A fundamental computational problem is consistency testing: is the observed execution of a concurrent program in ...
- research-articleOctober 2023
GAGPT-2: A Geometric Attention-based GPT-2 Framework for Image Captioning in Hindi
ACM Transactions on Asian and Low-Resource Language Information Processing (TALLIP), Volume 22, Issue 10Article No.: 241, Pages 1–16https://doi.org/10.1145/3622936Image captioning frameworks usually employ an encoder-decoder paradigm, with the encoder receiving abstract image feature vectors as input and the decoder for language modeling. Nowadays, most prominent architectures employ features from region proposals ...
Compound Memory Models
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue PLDIArticle No.: 153, Pages 1145–1168https://doi.org/10.1145/3591267Today's mobile, desktop, and server processors are heterogeneous, consisting not only of CPUs but also GPUs and other accelerators. Such heterogeneous processors are starting to expose a shared memory interface across these devices.Given that each of ...
Optimal Reads-From Consistency Checking for C11-Style Memory Models
- Hünkar Can Tunç,
- Parosh Aziz Abdulla,
- Soham Chakraborty,
- Shankaranarayanan Krishna,
- Umang Mathur,
- Andreas Pavlogiannis
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue PLDIArticle No.: 137, Pages 761–785https://doi.org/10.1145/3591251Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++. One of the most fundamental problems associated with a memory model M is consistency checking: given an execution X, is X consistent with M? ...
- research-articleJanuary 2023
Probabilistic Concurrency Testing for Weak Memory Programs
ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2January 2023, Pages 603–616https://doi.org/10.1145/3575693.3575729The Probabilistic Concurrency Testing (PCT) algorithm that provides theoretical guarantees on the probability of detecting concurrency bugs does not apply to weak memory programs. The PCT algorithm builds on the interleaving semantics of sequential ...
- research-articleDecember 2022
Risotto: A Dynamic Binary Translator for Weak Memory Model Architectures
- Redha Gouicem,
- Dennis Sprokholt,
- Jasper Ruehl,
- Rodrigo C. O. Rocha,
- Tom Spink,
- Soham Chakraborty,
- Pramod Bhatotia
ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1March 2023, Pages 107–122https://doi.org/10.1145/3567955.3567962Dynamic Binary Translation (DBT) is a powerful approach to support cross-architecture emulation of unmodified binaries. However, DBT systems face correctness and performance challenges, when emulating concurrent binaries from strong to weak memory ...
- research-articleJuly 2022
Parameterized Verification under Release Acquire is PSPACE-complete
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingJuly 2022, Pages 482–492https://doi.org/10.1145/3519270.3538445We study the safety verification problem for parameterized systems under the release-acquire (RA) semantics. In the non-parameterized setting, access to atomic compare-and-swap (CAS) instructions renders the safety verification problem undecidable. In ...
Lasagne: a static binary translator for weak memory model architectures
- Rodrigo C. O. Rocha,
- Dennis Sprokholt,
- Martin Fink,
- Redha Gouicem,
- Tom Spink,
- Soham Chakraborty,
- Pramod Bhatotia
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationJune 2022, Pages 888–902https://doi.org/10.1145/3519939.3523719The emergence of new architectures create a recurring challenge to ensure that existing programs still work on them. Manually porting legacy code is often impractical. Static binary translation (SBT) is a process where a program’s binary is ...
- ArticleOctober 2020
Developing Customized and Secure Blockchains with Deep Federation Learning to Prevent Successive Attacks
Mobile, Secure, and Programmable NetworkingOct 2020, Pages 31–43https://doi.org/10.1007/978-3-030-67550-9_3AbstractRecently, blockchain technology has been one of the most promising fields of research aiming to enhance the security and privacy of systems. It follows a distributed mechanism to make the storage system fault-tolerant. However, even after adopting ...
Promising 2.0: global optimizations in relaxed memory concurrency
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2020, Pages 362–376https://doi.org/10.1145/3385412.3386010For more than fifteen years, researchers have tried to support global optimizations in a usable semantics for a concurrent programming language, yet this task has been proven to be very difficult because of (1) the infamous “out of thin air” problem, ...
- research-articleJanuary 2019
Grounding thin-air reads with event structures
Proceedings of the ACM on Programming Languages (PACMPL), Volume 3, Issue POPLArticle No.: 70, Pages 1–28https://doi.org/10.1145/3290383The key challenge in defining the concurrency semantics of a programming language is how to enable the most efficient compilation to existing hardware architectures, and yet forbid programs from reading thin-air values, i.e., ones that do not appear in ...
- ArticleFebruary 2017
Formalizing the concurrency semantics of an LLVM fragment
CGO '17: Proceedings of the 2017 International Symposium on Code Generation and OptimizationFebruary 2017, Pages 100–110The LLVM compiler follows closely the concurrency model of C/C++ 2011, but with a crucial difference. While in C/C++ a data race between a non-atomic read and a write is declared to be undefined behavior, in LLVM such a race has defined behavior: the ...
- research-articleMarch 2016
Improved MHP Analysis
CC 2016: Proceedings of the 25th International Conference on Compiler ConstructionMarch 2016, Pages 207–217https://doi.org/10.1145/2892208.2897144May-Happen-in-Parallel (MHP) analysis is becoming the backbone of many of the parallel analyses and optimizations. In this paper, we present new approaches to do MHP analysis for X10-like languages that support async-finish-atomic parallelism. We ...
- research-articleFebruary 2016
Validating optimizations of concurrent C/C++ programs
CGO '16: Proceedings of the 2016 International Symposium on Code Generation and OptimizationFebruary 2016, Pages 216–226https://doi.org/10.1145/2854038.2854051We present a validator for checking the correctness of LLVM compiler optimizations on C11 programs as far as concurrency is concerned. Our validator checks that optimizations do not change memory accesses in ways disallowed by the C11 and/or LLVM ...
- research-articleJanuary 2015
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it
POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesJanuary 2015, Pages 209–220https://doi.org/10.1145/2676726.2676995We show that the weak memory model introduced by the 2011 C and C++ standards does not permit many common source-to-source program transformations (such as expression linearisation and "roach motel" reorderings) that modern compilers perform and that ...
Also Published in:
ACM SIGPLAN Notices: Volume 50 Issue 1, January 2015 - ArticleJuly 2009
Efficient Testing of Service-Oriented Applications Using Semantic Service Stubs
ICWS '09: Proceedings of the 2009 IEEE International Conference on Web ServicesJuly 2009, Pages 197–204https://doi.org/10.1109/ICWS.2009.40Service-oriented applications can be expensive to test because services are hosted remotely, are potentially shared among many users, and may have costs associated with their invocation. In this paper, we present an approach for reducing the costs of ...
- ArticleJune 2008
Real-Time Data Driven Wildland Fire Modeling
- Jonathan D. Beezley,
- Soham Chakraborty,
- Janice L. Coen,
- Craig C. Douglas,
- Jan Mandel,
- Anthony Vodacek,
- Zhen Wang
ICCS '08: Proceedings of the 8th international conference on Computational Science, Part IIIJune 2008, Pages 46–53https://doi.org/10.1007/978-3-540-69389-5_7We are developing a wildland fire model based on semi-empirical relations that estimate the rate of spread of a surface fire and post-frontal heat release, coupled with WRF, the Weather Research and Forecasting atmospheric model. A level set method ...
- ArticleMay 2007
A Dynamic Data Driven Wildland Fire Model
- Jan Mandel,
- Jonathan D. Beezley,
- Lynn S. Bennethum,
- Soham Chakraborty,
- Janice L. Coen,
- Craig C. Douglas,
- Jay Hatcher,
- Minjeong Kim,
- Anthony Vodacek
ICCS '07: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007May 2007, Pages 1042–1049https://doi.org/10.1007/978-3-540-72584-8_137We present an overview of an ongoing project to build DDDAS to use all available data for a short term wildfire prediction. The project involves new data assimilation methods to inject data into a running simulation, a physics based model coupled with ...