Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Francesco Costa

dblp:82/2213 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › logic optimization
approximate logic synthesis
1.012026
Approximate Logic Synthesis Via Iterative SMT-Based Subcircuit Rewriting · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Electronic design automation
logic synthesis
1.012026
Approximate Logic Synthesis Via Iterative SMT-Based Subcircuit Rewriting · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Electronic design automation
hardware verification and test
0.312026
Approximate Logic Synthesis Via Iterative SMT-Based Subcircuit Rewriting · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Electronic design automation › hardware verification and test › hardware verification
satisfiability modulo theories
0.312026
Approximate Logic Synthesis Via Iterative SMT-Based Subcircuit Rewriting · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026

Methods — techniques the papers use, named apart from their topics

satisfiability modulo theories · 1.0boolean rewriting · 1.0
YearPublicationVenuePosition
2026 Approximate Logic Synthesis Via Iterative SMT-Based Subcircuit Rewriting
abstract
This paper presents a novel iterative approach to achieve effective and efficient approximate logic synthesis (ALS). The core idea is to perform circuit rewriting in a way that is both local, i.e., is applied piece-wise to selected subcircuits, and extensive, i.e., systematically explores the design space for good solutions. Concretely, we propose SubXPAT, a new Boolean rewriting framework which iteratively employs satisfiability modulo theories (SMT) solving to select and approximate key parts of a circuit. Selection aims at finding subcircuits that at the same time include a significant number of gates and can be efficiently approximated, which is done by searching for large convex subcircuits with a limited number of inputs and outputs. Approximation is guided by the use of a parametric template, structured as a sum of products, which allows for fine-grained control over the subcircuit characteristics. SubXPAT was implemented as an open-source tool and compared against other ALS tools implementing state-of-the-art techniques. Our experimental evaluation used a broad range of arithmetic circuits with different bit-widths and our results indicate that SubXPAT generates approximate circuits that are more area-efficient than those generated by state-of-the-art techniques in 72% of the cases.
Morteza Rezaalipour, Marco Biasion, Francesco Costa, Cristian Tirelli, Lorenzo Ferretti, Rodrigo Otoni, George A. Constantinides, Laura Pozzi 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2024 NERVE 2.0: boosting the new enhanced reverse vaccinology environment via artificial intelligence and a user-friendly web interface
abstract
BACKGROUND: Vaccines development in this millennium started by the milestone work on Neisseria meningitidis B, reporting the invention of Reverse Vaccinology (RV), which allows to identify vaccine candidates (VCs) by screening bacterial pathogens genome or proteome through computational analyses. When NERVE (New Enhanced RV Environment), the first RV software integrating tools to perform the selection of VCs, was released, it prompted further development in the field. However, the problem-solving potential of most, if not all, RV programs is still largely unexploited by experimental vaccinologists that impaired by somehow difficult interfaces, requiring bioinformatic skills. RESULTS: We report here on the development and release of NERVE 2.0 (available at: https://nerve-bio.org ) which keeps the original integrative and modular approach of NERVE, while showing higher predictive performance than its previous version and other web-RV programs (Vaxign and Vaxijen). We renewed some of its modules and added innovative ones, such as Loop-Razor, to recover fragments of promising vaccine candidates or Epitope Prediction for the epitope prediction binding affinities and population coverage. Along with two newly built AI (Artificial Intelligence)-based models: ESPAAN and Virulent. To improve user-friendliness, NERVE was shifted to a tutored, web-based interface, with a noSQL-database to consent the user to submit, obtain and retrieve analysis results at any moment. CONCLUSIONS: With its redesigned and updated environment, NERVE 2.0 allows customisable and refinable bacterial protein vaccine analyses to all different kinds of users.
Andrea Conte, Nicola Gulmini, Francesco Costa, Matteo Cartura, Felix Bröhl, Francesco Patane, Francesco Filippini
BMC Bioinform.3
1988 SDS - A LOTOS-Based Tool for Symbolic Debugging
Francesco Costa, Daniela Nardi, Roberto Rinaldi
FORTE1