Fausto Spoto

According to our database1, Fausto Spoto
  • authored at least 59 papers between 1996 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

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
Semantics for Locking Specifications.
CoRR, 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

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.
Information & Software Technology, 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

Reachability Analysis of Program Variables.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
Precise null-pointer analysis.
Software and System Modeling, 2011

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

Static Analysis of Android Programs.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 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.
Higher-Order and Symbolic Computation, 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.
Electr. Notes Theor. Comput. Sci., 2009

Experiments with Non-Termination Analysis for Java Bytecode.
Electr. Notes Theor. Comput. Sci., 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.
Electr. Notes Theor. Comput. Sci., 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.
Higher-Order and Symbolic Computation, 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.
Electr. Notes Theor. Comput. Sci., 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.
Computer Languages, Systems & Structures, 2003

Logic Programs as Compact Denotations.
Proceedings of the Practical Aspects of Declarative Languages, 5th International Symposium, 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

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 Static Analysis, 6th International Symposium, 1999

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

1998
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 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...