Andrei-Marian Dan

dblp:404/4286 · also Andrei Marian Dan · DBLP profile ↗
← Back
12ranked-venue papers
5as first author
4since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 8 · 5 first-author · 1 since 2021Security and privacy · 2 · 1 since 2021Theory of computation · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2025 A Framework for Configurable Scalability Evaluations of IoT Platforms
Fabio Muratori, Yuening Yang, Zeineb Rejiba, Andrei-Marian Dan
AINA (7)4
2025 Performance Evaluation of Brokerless Messaging Libraries
abstract
Messaging systems are essential for efficiently transferring large volumes of data, ensuring rapid response times and high-throughput communication. The state-of-the-art on messaging systems mainly focuses on the performance evaluation of brokered messaging systems, which use an intermediate broker to guarantee reliability and quality of service. However, over the past decade, brokerless messaging systems have emerged, eliminating the single point of failure and trading off reliability guarantees for higher performance. Still, the state-of-the-art on evaluating the performance of brokerless systems is scarce. In this work, we solely focus on brokerless messaging systems. First, we perform a qualitative analysis of several possible candidates, to find the most promising ones. We then design and implement an extensive open-source benchmarking suite to systematically and fairly evaluate the performance of the chosen libraries, namely, ZeroMQ, NanoMsg, and NanoMsg-Next-Generation (NNG). We evaluate these libraries considering different metrics and workload conditions, and provide useful insights into their limitations. Our analysis enables practitioners to select the most suitable library for their requirements.
Lorenzo La Corte, Syed Aftab Rashid, Andrei-Marian Dan
SRDS3
2025 Evaluating Differential Firmware Updates for Embedded IoT Device Fleets
abstract
Remote firmware updates are critical for maintaining the performance and security of Internet-of-Things (IoT) device fleets. Remote updates are especially critical from a fleet management perspective, requiring thousands of devices to be kept up-to-date. When considering a fleet of devices, transferring large update files is inefficient. Therefore many modern systems consider differential updates. In this work, we describe and evaluate a secure differential update implementation for fleets of embedded IoT devices. We demonstrate how differential updates can be performed on a real hardware platform using a popular open-source embedded update framework, SWUpdate. We also show how differential updates can integrate with redundancy concepts such as A/B partitioning and on-device security mechanisms such as secure boot. Our experiments, performed using both real hardware and a device fleet simulator, identify crucial differences between differential and full-image updates: the differential updates can decrease the file size by 49%, the install time by 78%, and require up to 77% more temporary disk memory compared to full-image updates. These key insights are essential for developers and practitioners when selecting the IoT firmware update strategy.
Jayden Renee Sorensen, Syed Aftab Rashid, Hossam ElHussini, Andrei-Marian Dan
WFCS4
2021 Scalable Polyhedral Verification of Recurrent Neural Networks
abstract
Abstract We present a scalable and precise verifier for recurrent neural networks, calledProverbased on two novel ideas: (i) a method to compute a set of polyhedral abstractions for the non-convex and non-linear recurrent update functions by combining sampling, optimization, and Fermat’s theorem, and (ii) a gradient descent based algorithm for abstraction refinement guided by the certification problem that combines multiple abstractions for each neuron. UsingProver, we present the first study of certifying a non-trivial use case of recurrent neural networks, namely speech classification. To achieve this, we additionally develop custom abstractions for the non-linear speech preprocessing pipeline. Our evaluation shows thatProversuccessfully verifies several challenging recurrent models in computer vision, speech, and motion sensor data classification beyond the reach of prior work.
Wonryong Ryou, Mislav Balunovic, Gagandeep Singh 0001, Andrei-Marian Dan, Martin T. Vechev
CAV (1)5
2018 Securify: Practical Security Analysis of Smart Contracts
abstract
Permissionless blockchains allow the execution of arbitrary programs (called smart contracts), enabling mutually untrusted entities to interact without relying on trusted third parties. Despite their potential, repeated security concerns have shaken the trust in handling billions of USD by smart contracts. To address this problem, we present Securify, a security analyzer for Ethereum smart contracts that is scalable, fully automated, and able to prove contract behaviors as safe/unsafe with respect to a given property. Securify's analysis consists of two steps. First, it symbolically analyzes the contract's dependency graph to extract precise semantic information from the code. Then, it checks compliance and violation patterns that capture sufficient conditions for proving if a property holds or not. To enable extensibility, all patterns are specified in a designated domain-specific language. Securify is publicly released, it has analyzed >18K contracts submitted by its users, and is regularly used to conduct security audits by experts. We present an extensive evaluation of Securify over real-world Ethereum smart contracts and demonstrate that it can effectively prove the correctness of smart contracts and discover critical violations.
Petar Tsankov, Andrei-Marian Dan, Dana Drachsler-Cohen, Arthur Gervais, Florian Bünzli, Martin T. Vechev
CCS2
2018 Automatic Verification of RMA Programs via Abstraction Extrapolation
Cedric Baumann, Andrei-Marian Dan, Yuri Meshman, Torsten Hoefler, Martin T. Vechev
VMCAI2
2017 Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts
Andrei-Marian Dan, Manu Sridharan, Satish Chandra 0001, Jean-Baptiste Jeannin, Martin T. Vechev
CAV (2)1
2017 Effective abstractions for verification under relaxed memory models
Andrei-Marian Dan, Yuri Meshman, Martin T. Vechev, Eran Yahav
Comput. Lang. Syst. Struct.1
2016 Modeling and analysis of remote memory access programming
abstract
Recent advances in networking hardware have led to a new generation of Remote Memory Access (RMA) networks in which processors from different machines can communicate directly, bypassing the operating system and allowing higher performance. Researchers and practitioners have proposed libraries and programming models for RMA to enable the development of applications running on these networks,
Andrei-Marian Dan, Patrick Lam 0001, Torsten Hoefler, Martin T. Vechev
OOPSLA1
2015 Effective Abstractions for Verification under Relaxed Memory Models
Andrei-Marian Dan, Yuri Meshman, Martin T. Vechev, Eran Yahav
VMCAI1
2014 Synthesis of Memory Fences via Refinement Propagation
Yuri Meshman, Andrei-Marian Dan, Martin T. Vechev, Eran Yahav
SAS2
2013 Predicate Abstraction for Relaxed Memory Models
Andrei-Marian Dan, Yuri Meshman, Martin T. Vechev, Eran Yahav
SAS1