World's Best Scientists 2026 revealed!
Armando Tacchella

Armando Tacchella

D-Index & Metrics

Computer Science

D-Index
32
Citations
6743
World Ranking
12933
National Ranking
449

Overview

Armando Tacchella is affiliated with the University of Genoa in Italy. Their research spans primarily the fields of Computer Science and Engineering, with a strong focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Control and Systems Engineering, Software, and Computer Vision and Pattern Recognition.

The main topics covered in Armando Tacchella's research work include:

  • Adversarial Robustness in Machine Learning
  • Formal Methods in Verification
  • Anomaly Detection Techniques and Applications
  • AI-based Problem Solving and Planning
  • Explainable Artificial Intelligence (XAI)
  • Advanced Malware Detection Techniques
  • Software Testing and Debugging Techniques

Armando Tacchella's recent publications illustrate a focus on neural networks, verification, and machine learning methodologies. Selected recent papers include:

  • Towards learning trustworthily, automatically, and with guarantees on graphs: An overview (2022, Neurocomputing)
  • Formalizing the Execution Context of Behavior Trees for Runtime Verification of Deliberative Policies (2021, 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems - IROS)
  • Supporting Standardization of Neural Networks Verification with VNNLIB and CoCoNet (2023, Kalpa publications in computing)
  • NeVer2: learning and verification of neural networks (2024, Soft Computing)
  • Verification of Neural Networks: Enhancing Scalability through Pruning (2020, arXiv - Cornell University)

The main venues where Armando Tacchella frequently publishes include:

  • arXiv (Cornell University)
  • Neurocomputing
  • Soft Computing
  • 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
  • Kalpa publications in computing

Collaborations form a notable part of their work, with frequent co-authors being:

  • Luca Pulina
  • Dario Guidotti
  • Lorenzo Natale
  • Enrico Ghiorzi
  • Michele Colledanchise

Best Publications

  • NuSMV 2: An OpenSource Tool for Symbolic Model Checking

    Alessandro Cimatti;Edmund M. Clarke;Enrico Giunchiglia;Fausto Giunchiglia

  • Nusmv version 2: an opensource tool for symbolic model checking

    Alessandro Cimatti;Edmund M. Clarke;Enrico Giunchiglia;Fausto Giunchiglia

  • An abstraction-refinement approach to verification of artificial neural networks

    Luca Pulina;Armando Tacchella

  • Benefits of Bounded Model Checking at an Industrial Setting

    Fady Copty;Limor Fix;Ranan Fraer;Enrico Giunchiglia

  • QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability

    Enrico Giunchiglia;Massimo Narizzano;Armando Tacchella

  • Clause/term resolution and learning in the evaluation of quantified Boolean formulas

    Enrico Giunchiglia;Massimo Narizzano;Armando Tacchella

  • Challenging SMT solvers to verify neural networks

    Luca Pulina;Armando Tacchella

  • Backjumping for quantified Boolean logic satisfiability

    Enrico Giunchiglia;Massimo Narizzano;Armando Tacchella

  • A self-adaptive multi-engine solver for quantified Boolean formulas

    Luca Pulina;Armando Tacchella

  • Learning for quantified boolean logic satisfiability

    Enrico Giunchiglia;Massimo Narizzano;Armando Tacchella

  • SAT-based planning in complex domains: concurrency, constraints and nondeterminism

    Claudio Castellini;Enrico Giunchiglia;Armando Tacchella

  • SAT-Based Decision Procedures for Classical Modal Logics

    Enrico Giunchiglia;Armando Tacchella;Fausto Giunchiglia

  • Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919)

    Enrico Giunchiglia;Armando Tacchella

  • QuBIS : An (In)complete Solver for Quantified Boolean Formulas

    L Pulina;A Tacchella

  • A multi-engine solver for quantified boolean formulas

    Luca Pulina;Armando Tacchella

  • Integrating BDD-Based and SAT-Based Symbolic Model Checking

    Alessandro Cimatti;Enrico Giunchiglia;Marco Pistore;Marco Roveri

  • Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability

    Enrico Giunchiglia;Massimo Maratea;Armando Tacchella;Davide Zambonin

  • Collaborative expert portfolio management

    David Stern;Ralf Herbrich;Thore Graepel;Horst Samulowitz

  • More Evaluation of Decision Procedures for Modal Logics.

    Enrico Giunchiglia;Fausto Giunchiglia;Roberto Sebastiani;Armando Tacchella

  • A Greedy Approach for the Efficient Repair of Stochastic Models

    Shashank Pathak;Erika Ábrahám;Nils Jansen;Armando Tacchella

  • Automated Verification of Neural Networks: Advances, Challenges and Perspectives

    Francesco Leofante;Nina Narodytska;Luca Pulina;Armando Tacchella

  • Theory and Applications of Satisfiability Testing

    Enrico Giunchiglia;Armando Tacchella

  • Theory and applications of satisfiability testing : 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003 : selected revised papers

    Enrico Giunchiglia;Armando Tacchella

Frequent Co-Authors

Enrico Giunchiglia
Enrico Giunchiglia University of Genoa
Fausto Giunchiglia
Fausto Giunchiglia University of Trento
Lorenzo Natale
Lorenzo Natale Italian Institute of Technology
Roberto Sebastiani
Roberto Sebastiani University of Trento
Giorgio Metta
Giorgio Metta Italian Institute of Technology
Alessandro Cimatti
Alessandro Cimatti Fondazione Bruno Kessler
Marco Pistore
Marco Pistore Fondazione Bruno Kessler
Claudio Castellini
Claudio Castellini University of Erlangen-Nuremberg
Edmund M. Clarke
Edmund M. Clarke Carnegie Mellon University
Moshe Y. Vardi
Moshe Y. Vardi Rice University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of related online degrees and career pathways. Many students begin by looking for what’s the easiest associate’s degree to get, which can be a quick entry point into the field and provide foundational skills for further study.

For those seeking advanced roles, options like the cheapest online doctorate in educational leadership can pave the way for leadership careers in technology education or administration. These programs often suit those already in the workforce who wish to upskill without a hefty financial burden.

As online education rises in popularity, enrolling in one of the famous online colleges ensures the degree is recognized and valued by employers. Accreditation and reputation are important when choosing a program.

The tech industry also thrives on creativity and innovation. Specialized online programs, such as video game programs, are in high demand for those interested in the gaming sector. These pathways make it possible to specialize in areas that align with your interests or career goals while studying from anywhere.

Best Scientists Citing Armando Tacchella

Trending Scientists

Recently Published Articles