Camil Demetrescu

111 papers A* 13A 10B 4C 1Misc 2Journal 45Unranked 17

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