Camil Demetrescu

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 29

Top Topics

Symbolic Execution

Connectionist Learning

Top Venues

Dagstuhl Reports

Publications

Luca Borzacchiello, Emilio Coppa, Camil Demetrescu
Handling Memory-Intensive Operations in Symbolic Execution. ISEC (2022)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf
Which Conference Is That? A Case Study in Computer Science. ACM J. Data Inf. Qual. 14 (3) (2022)
Emilio Coppa, Heng Yin, Camil Demetrescu
SymFusion: Hybrid Instrumentation for Concolic Execution. ASE (2022)
Luca Borzacchiello, Emilio Coppa, Camil Demetrescu
SENinja: A symbolic execution plugin for Binary Ninja. SoftwareX 20 (2022)
Luca Borzacchiello, Emilio Coppa, Davide Maiorca, Andrea Columbu, Camil Demetrescu, Giorgio Giacinto
Reach Me if You Can: On Native Vulnerability Reachability in Android Apps. ESORICS (3) (2022)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf
On computer science research and its temporal evolution. Scientometrics 127 (8) (2022)
Luca Borzacchiello, Emilio Coppa, Camil Demetrescu
Fuzzing Symbolic Expressions. CoRR (2021)
Luca Borzacchiello, Emilio Coppa, Camil Demetrescu
Fuzzing Symbolic Expressions. ICSE (2021)
Luca Borzacchiello, Emilio Coppa, Camil Demetrescu
FUZZOLIC: Mixing fuzzing and concolic execution. Comput. Secur. 108 (2021)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. Scientometrics 124 (3) (2020)
Camil Demetrescu, Andrea Ribichini, Marco Schaerf
Are Italian research assessment exercises size-biased? Scientometrics 125 (1) (2020)
Camil Demetrescu, Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf
On the Shapley value and its application to the Italian VQR research assessment exercise. J. Informetrics 13 (1) (2019)
Marco Angelini, Graziano Blasilli, Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Simone Lenti, Simone Nicchi, Giuseppe Santucci
SymNav: Visually Assisting Symbolic Execution. VizSEC (2019)
Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu
Memory models in symbolic execution: key ideas and new thoughts. Softw. Test. Verification Reliab. 29 (8) (2019)
Daniele Cono D'Elia, Emilio Coppa, Andrea Salvati, Camil Demetrescu
Static Analysis of ROP Code. EuroSec@EuroSys (2019)
Pietro Borrello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu
The ROP needle: hiding trigger-based injection vectors via code reuse. SAC (2019)
Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu
Reconstructing C2 Servers for Remote Access Trojans with Symbolic Execution. CSCML (2019)
Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
A Survey of Symbolic Execution Techniques. ACM Comput. Surv. 51 (3) (2018)
Daniele Cono D'Elia, Camil Demetrescu
On-stack replacement, distilled. PLDI (2018)
Camil Demetrescu, Andrea Ribichini, Marco Schaerf
Accuracy of author names in bibliographic data sources: an Italian case study. Scientometrics 117 (3) (2018)
Daniele Cono D'Elia, Camil Demetrescu
On-Stack Replacement à la Carte. CoRR (2017)
Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu
Assisting Malware Analysis with Symbolic Execution: A Case Study. CSCML (2017)
Tiziana Catarci, Monica Scannapieco, Marco Console, Camil Demetrescu
My (fair) big data. IEEE BigData (2017)
Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu
Rethinking pointer reasoning in symbolic execution. ASE (2017)
Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
A Survey of Symbolic Execution Techniques. CoRR (2016)
Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
Mining hot calling contexts in small space. Softw. Pract. Exp. 46 (8) (2016)
Daniele Cono D'Elia, Camil Demetrescu
Flexible on-stack replacement in LLVM. CGO (2016)
Daniel Delling, Camil Demetrescu, David S. Johnson, Jan Vitek
Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). Dagstuhl Reports 6 (3) (2016)
Camil Demetrescu, Sebastian Erdweg, Matthew A. Hammer, Shriram Krishnamurthi
Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402). Dagstuhl Reports 6 (10) (2016)
Camil Demetrescu, Matthew Flatt
Front Matter, Table of Contents. Dagstuhl Artifacts Ser. 1 (1) (2015)
Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta
Estimating the Empirical Cost Function of Routines with Dynamic Workloads. CGO (2014)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR (2014)
Emilio Coppa, Camil Demetrescu, Irene Finocchi
Input-Sensitive Profiling. IEEE Trans. Software Eng. 40 (12) (2014)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Reactive Imperative Programming with Dataflow Constraints. ACM Trans. Program. Lang. Syst. 37 (1) (2014)
Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
Ball-Larus Path Profiling Across Multiple Loop iterations CoRR (2013)
Daniele Cono D'Elia, Camil Demetrescu
Ball-Larus path profiling across multiple loop iterations. OOPSLA (2013)
Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta
Multithreaded Input-Sensitive Profiling CoRR (2013)
Camil Demetrescu, Stefano Leonardi, Alberto Marchetti-Spaccamela
Preface. Theor. Comput. Sci. 514 (2013)
Camil Demetrescu, Magnús M. Halldórsson
Editorial. Algorithmica 67 (4) (2013)
Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani
k-Calling context profiling. OOPSLA (2012)
Emilio Coppa, Camil Demetrescu, Irene Finocchi
Input-sensitive profiling. PLDI (2012)
Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
Mining hot calling contexts in small space. PLDI (2011)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Reactive imperative programming with dataflow constraints. OOPSLA (2011)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Reactive Imperative Programming with Dataflow Constraints CoRR (2011)
Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). Dagstuhl Reports 1 (5) (2011)
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411 (44-46) (2010)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Trading off space for passes in graph streaming problems. ACM Trans. Algorithms 6 (1) (2009)
Camil Demetrescu
Preface. ACM J. Exp. Algorithmics 14 (2009)
Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55 (2) (2009)
Camil Demetrescu, Roberto Tamassia
Papers from ALENEX 2005. ACM J. Exp. Algorithmics 12 (2008)
Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37 (5) (2008)
Camil Demetrescu, Giuseppe F. Italiano
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51 (4) (2008)
Camil Demetrescu, Giuseppe F. Italiano
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. Electron. Notes Theor. Comput. Sci. 171 (1) (2007)
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS (2007)
Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA (2007)
Camil Demetrescu, Irene Finocchi
A data-driven graphical toolkit for software visualization. SOFTVIS (2006)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Trading off space for passes in graph streaming problems. SODA (2006)
Camil Demetrescu, Giuseppe F. Italiano
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms 4 (3) (2006)
Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA (2006)
Camil Demetrescu, Giuseppe F. Italiano
Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72 (5) (2006)
Camil Demetrescu, Giuseppe F. Italiano
Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms 2 (4) (2006)
Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura
Visual editing of animated algorithms: the Leonardo Web builder. AVI (2006)
Camil Demetrescu, Giuseppe F. Italiano
barrier. J. ACM 52 (2) (2005)
Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
Portraying Algorithms with Leonardo Web. WISE Workshops (2005)
Camil Demetrescu, Giuseppe F. Italiano
Engineering Shortest Path Algorithms. WEA (2004)
Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano
Experimental analysis of dynamic all pairs shortest path algorithms. SODA (2004)
Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura
A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53 (1) (2004)
Camil Demetrescu, Irene Finocchi
A portable virtual machine for program debugging and directing. SAC (2004)
Camil Demetrescu, Giuseppe F. Italiano
A new approach to dynamic all pairs shortest paths. J. ACM 51 (6) (2004)
Camil Demetrescu, Irene Finocchi
Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86 (3) (2003)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
Engineering and Visualizing Algorithms. Graph Drawing (2003)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
Algorithm engineering, Algorithmics Column. Bull. EATCS 79 (2003)
Camil Demetrescu, Giuseppe F. Italiano
A new approach to dynamic all pairs shortest paths. STOC (2003)
Camil Demetrescu, Giuseppe F. Italiano
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP (2002)
Camil Demetrescu, Mikkel Thorup
Oracles for distances avoiding a link-failure. SODA (2002)
Camil Demetrescu, Irene Finocchi
Removing Cycles for Minimizing Crossings. ACM J. Exp. Algorithmics 6 (2001)
Camil Demetrescu, Giuseppe F. Italiano
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure CoRR (2001)
Camil Demetrescu, Irene Finocchi
Smooth Animation of Algorithms in a Declarative Framework. J. Vis. Lang. Comput. 12 (3) (2001)
Camil Demetrescu, Giuseppe F. Italiano
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS (2001)
Camil Demetrescu, Irene Finocchi, John T. Stasko
Specifying Algorithm Visualizations: Interesting Events or State Mapping? Software Visualization (2001)
Camil Demetrescu, Irene Finocchi, Giuseppe Liotta
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE (2000)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics (2000)
Camil Demetrescu, Giuseppe F. Italiano
What Do We Learn from Experimental Algorithmics? MFCS (2000)
Camil Demetrescu, Giuseppe F. Italiano
) Barrier. FOCS (2000)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11 (2) (2000)
Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE (2000)
Camil Demetrescu, Irene Finocchi
A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL (1999)
Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
Infinite Trees and the Future. Graph Drawing (1999)
Camil Demetrescu, Irene Finocchi
Smooth Animation of Algorithms in a Declarative Framework. VL (1999)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
LEONARDO: a software visualization system. WAE (1997)