Fausto Spoto

Orcid: 0000-0003-2973-0384

According to our database1, Fausto Spoto authored at least 86 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient and Secure Distributed Data Storage and Retrieval Using Interplanetary File System and Blockchain.
Future Internet, March, 2024

2023
Fungible and non-fungible tokens with snapshots in Java.
Clust. Comput., October, 2023

On the use of generic types for smart contracts.
Clust. Comput., August, 2023

Information Flow Analysis for Detecting Non-Determinism in Blockchain (Artifact).
Dagstuhl Artifacts Ser., 2023

MichelsonLiSA: A Static Analyzer for Tezos.
Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events, 2023

Information Flow Analysis for Detecting Non-Determinism in Blockchain.
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

2022
Ensuring determinism in blockchain software with GoLiSA: an industrial experience report.
Proceedings of the SOAP '22: 11th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2022

On the Termination of Borrow Checking in Featherweight Rust.
Proceedings of the NASA Formal Methods - 14th International Symposium, 2022

2021
Static analysis for discovering IoT vulnerabilities.
Int. J. Softw. Tools Technol. Transf., 2021

Static Privacy Analysis by Flow Reconstruction of Tainted Data.
Int. J. Softw. Eng. Knowl. Eng., 2021

Cybersecurity Impacts of the Covid-19 Pandemic in Italy.
Proceedings of the Italian Conference on Cybersecurity, 2021

On-Chain Smart Contract Verification over Tendermint.
Proceedings of the Financial Cryptography and Data Security. FC 2021 International Workshops, 2021

Re-engineering ERC-20 Smart Contracts with Efficient Snapshots for the Java Virtual Machine.
Proceedings of the Third International Conference on Blockchain Computing and Applications, 2021

Power and Pitfalls of Generic Smart Contracts.
Proceedings of the Third International Conference on Blockchain Computing and Applications, 2021

2020
From CIL to Java bytecode: Semantics-based translation for static analysis leveraging.
Sci. Comput. Program., 2020

BackFlow: Backward Context-Sensitive Flow Reconstruction of Taint Analysis Results.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Cross-program taint analysis for IoT systems.
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

Enforcing Determinism of Java Smart Contracts.
Proceedings of the Financial Cryptography and Data Security, 2020

Intents Analysis of Android Apps for Confidentiality Leakage Detection.
Proceedings of the Advanced Computing and Systems for Security, 2020

2019
Static Identification of Injection Attacks in Java.
ACM Trans. Program. Lang. Syst., 2019

Static analysis of Android Auto infotainment and on-board diagnostics II apps.
Softw. Pract. Exp., 2019

Cross-Programming Language Taint Analysis for the IoT Ecosystem.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2019

A Java Framework for Smart Contracts.
Proceedings of the Financial Cryptography and Data Security, 2019

2018
SDLI: Static Detection of Leaks Across Intents.
Proceedings of the 17th IEEE International Conference On Trust, 2018

Static Analysis of Android Apps Interaction with Automotive CAN.
Proceedings of the Smart Computing and Communication - Third International Conference, 2018

Static Analysis for GDPR Compliance.
Proceedings of the Second Italian Conference on Cyber Security, Milan, Italy, February 6th - to, 2018

CIL to Java-bytecode translation for static analysis leveraging.
Proceedings of the 6th Conference on Formal Methods in Software Engineering, 2018

Vulnerability analysis of Android auto infotainment apps.
Proceedings of the 15th ACM International Conference on Computing Frontiers, 2018

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

Tailoring Taint Analysis to GDPR.
Proceedings of the Privacy Technologies and Policy - 6th Annual Privacy Forum, 2018

2017
Security Analysis of the OWASP Benchmark with Julia.
Proceedings of the First Italian Conference on Cybersecurity (ITASEC17), 2017

2016
Creating, generating and comparing random network models with Network Randomizer.
F1000Research, 2016

The Julia Static Analyzer for Java.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Semantics for Locking Specifications.
Proceedings of the NASA Formal Methods - 8th International Symposium, 2016

Locking discipline inference and checking.
Proceedings of the 38th International Conference on Software Engineering, 2016

2015
Finding the shortest path with PesCa: a tool for network reconstruction.
F1000Research, 2015

Boolean Formulas for the Static Identification of Injection Attacks in Java.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

2014
Field-sensitive unreachability and non-cyclicity analysis.
Sci. Comput. Program., 2014

Biological network analysis with CentiScaPe: centralities and experimental dataset integration.
F1000Research, 2014

Non-Termination Analysis of Java Bytecode.
CoRR, 2014

A Thread-Safe Library for Binary Decision Diagrams.
Proceedings of the Software Engineering and Formal Methods - 12th International Conference, 2014

An operational semantics for android activities.
Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

2013
Reachability analysis of program variables.
ACM Trans. Program. Lang. Syst., 2013

Inferring complete initialization of arrays.
Theor. Comput. Sci., 2013

2012
Static analysis of Android programs.
Inf. Softw. Technol., 2012

Automaton-Based Array Initialization Analysis.
Proceedings of the Language and Automata Theory and Applications, 2012

Definite Expression Aliasing Analysis for Java Bytecode.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

2011
Precise null-pointer analysis.
Softw. Syst. Model., 2011

Inference of field initialization.
Proceedings of the 33rd International Conference on Software Engineering, 2011

2010
A termination analyzer for Java bytecode based on path-length.
ACM Trans. Program. Lang. Syst., 2010

Magic-sets for localised analysis of Java bytecode.
High. Order Symb. Comput., 2010

The Nullness Analyser of julia.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
Using CLP Simplifications to Improve Java Bytecode Termination Analysis.
Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

Experiments with Non-Termination Analysis for Java Bytecode.
Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

2008
Nullness Analysis in Boolean Form.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

Special track on Software Verification: editorial message.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

2007
Optimality and condensing of information flow through linear refinement.
Theor. Comput. Sci., 2007

Preface.
Proceedings of the Second Workshop on Bytecode Semantics, 2007

Magic-Sets Transformation for the Analysis of Java Bytecode.
Proceedings of the Static Analysis, 14th International Symposium, 2007

2006
Deriving escape analysis by abstract interpretation.
High. Order Symb. Comput., 2006

Deriving Escape Analysis by Abstract Interpretation: Proofs of results
CoRR, 2006

Detecting Non-cyclicity by Abstract Compilation into Boolean Functions.
Proceedings of the Verification, 2006

2005
Preface.
Proceedings of the First Workshop on Bytecode Semantics, 2005

Information Flow Analysis for Java Bytecode.
Proceedings of the Verification, 2005

Pair-Sharing Analysis of Object-Oriented Programs.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Information Flow Is Linear Refinement of Constancy.
Proceedings of the Theoretical Aspects of Computing, 2005

2003
Class analyses as abstract interpretations of trace semantics.
ACM Trans. Program. Lang. Syst., 2003

Pair-independence and freeness analysis through linear refinement.
Inf. Comput., 2003

Logic programs as compact denotations.
Comput. Lang. Syst. Struct., 2003

Approximate Protein Folding in Oz through Frequency Analysis.
Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002
Generalizing Def and Pos to Type Analysis.
J. Log. Comput., 2002

A Refinement of the Escape Property.
Proceedings of the Verification, 2002

A Foundation of Escape Analysis.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses.
Proceedings of the Static Analysis, 8th International Symposium, 2001

Class Analysis of Object-Oriented Programs through Abstract Interpretation.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Abstract Compilation for Sharing Analysis.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

Logic programs as abstract domains.
Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

2000
Operational and Goal-Independent Denotational Semantics for Prolog with Cut.
J. Log. Program., 2000

Non Pair-Sharing and Freeness Analysis Through Linear Refinement.
Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), 2000

Analysis of Downward Closed Properties of Logic Programs.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999
Freeness Analysis through Linear Refinement.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998
Abstract Interpretation of Prolog Programs.
Proceedings of the Algebraic Methodology and Software Technology, 1998

An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
A Denotational Semantics for Prolog.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
Accurate Analysis of Prolog with cut.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996


  Loading...