Fausto Spoto
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [c38]
- 2017
- [c37]Pietro Ferrara, Elisa Burato, Fausto Spoto:
Security Analysis of the OWASP Benchmark with Julia. ITASEC 2017: 242-247 - 2016
- [c36]Michael D. Ernst, Alberto Lovato, Damiano Macedonio, Fausto Spoto, Javier Thaine:
Locking discipline inference and checking. ICSE 2016: 1133-1144 - [c35]Michael D. Ernst, Damiano Macedonio, Massimo Merro, Fausto Spoto:
Semantics for Locking Specifications. NFM 2016: 355-372 - [c34]
- 2015
- [c33]Michael D. Ernst, Alberto Lovato, Damiano Macedonio, Ciprian Spiridon, Fausto Spoto:
Boolean Formulas for the Static Identification of Injection Attacks in Java. LPAR 2015: 130-145 - [i3]Michael D. Ernst, Damiano Macedonio, Massimo Merro, Fausto Spoto:
Semantics for Locking Specifications. CoRR abs/1501.05338 (2015) - 2014
- [j18]Enrico Scapin, Fausto Spoto:
Field-sensitive unreachability and non-cyclicity analysis. Sci. Comput. Program. 95: 359-375 (2014) - [c32]
- [c31]Alberto Lovato, Damiano Macedonio, Fausto Spoto:
A Thread-Safe Library for Binary Decision Diagrams. SEFM 2014: 35-49 - [i2]Étienne Payet, Fred Mesnard, Fausto Spoto:
Non-Termination Analysis of Java Bytecode. CoRR abs/1401.5292 (2014) - 2013
- [j17]Durica Nikolic, Fausto Spoto:
Inferring complete initialization of arrays. Theor. Comput. Sci. 484: 16-40 (2013) - [j16]Durica Nikolic, Fausto Spoto:
Reachability analysis of program variables. ACM Trans. Program. Lang. Syst. 35(4): 14:1-14:68 (2013) - 2012
- [j15]Étienne Payet, Fausto Spoto:
Static analysis of Android programs. Information & Software Technology 54(11): 1192-1201 (2012) - [c30]
- [c29]Durica Nikolic, Fausto Spoto:
Definite Expression Aliasing Analysis for Java Bytecode. ICTAC 2012: 74-89 - [c28]
- 2011
- [j14]
- [c27]
- [c26]
- 2010
- [j13]Fausto Spoto, Étienne Payet:
Magic-sets for localised analysis of Java bytecode. Higher-Order and Symbolic Computation 23(1): 29-86 (2010) - [j12]Fausto Spoto, Fred Mesnard, Étienne Payet:
A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3): 8:1-8:70 (2010) - [c25]
2000 – 2009
- 2009
- [j11]Étienne Payet, Fausto Spoto:
Experiments with Non-Termination Analysis for Java Bytecode. Electr. Notes Theor. Comput. Sci. 253(5): 83-96 (2009) - [j10]Fausto Spoto, Lunjin Lu, Fred Mesnard:
Using CLP Simplifications to Improve Java Bytecode Termination Analysis. Electr. Notes Theor. Comput. Sci. 253(5): 129-144 (2009) - 2008
- [c24]
- [c23]
- 2007
- [j9]
- [j8]Fausto Spoto:
Optimality and condensing of information flow through linear refinement. Theor. Comput. Sci. 388(1-3): 53-82 (2007) - [c22]Étienne Payet, Fausto Spoto:
Magic-Sets Transformation for the Analysis of Java Bytecode. SAS 2007: 452-467 - 2006
- [j7]Patricia M. Hill, Fausto Spoto:
Deriving escape analysis by abstract interpretation. Higher-Order and Symbolic Computation 19(4): 415-463 (2006) - [c21]Stefano Rossignoli, Fausto Spoto:
Detecting Non-cyclicity by Abstract Compilation into Boolean Functions. VMCAI 2006: 95-110 - [i1]Patricia M. Hill, Fausto Spoto:
Deriving Escape Analysis by Abstract Interpretation: Proofs of results. CoRR abs/cs/0607101 (2006) - 2005
- [j6]
- [c20]
- [c19]
- [c18]
- 2003
- [j5]Patricia M. Hill, Fausto Spoto:
Logic programs as compact denotations. Computer Languages, Systems & Structures 29(3): 45-73 (2003) - [j4]Giorgio Levi, Fausto Spoto:
Pair-independence and freeness analysis through linear refinement. Inf. Comput. 182(1): 14-52 (2003) - [j3]Fausto Spoto, Thomas P. Jensen:
Class analyses as abstract interpretations of trace semantics. ACM Trans. Program. Lang. Syst. 25(5): 578-630 (2003) - [c17]S. Bozzoli, Fausto Spoto, Agostino Dovier:
Approximate Protein Folding in Oz through Frequency Analysis. APPIA-GULP-PRODE 2003: 123-134 - [c16]
- 2002
- [j2]Patricia M. Hill, Fausto Spoto:
Generalizing Def and Pos to Type Analysis. J. Log. Comput. 12(3): 497-542 (2002) - [c15]
- [c14]
- 2001
- [c13]
- [c12]Thomas P. Jensen, Fausto Spoto:
Class Analysis of Object-Oriented Programs through Abstract Interpretation. FoSSaCS 2001: 261-275 - [c11]Fausto Spoto:
Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses. SAS 2001: 127-145 - 2000
- [j1]Fausto Spoto:
Operational and Goal-Independent Denotational Semantics for Prolog with Cut. J. Log. Program. 42(1): 1-46 (2000) - [c10]Patricia M. Hill, Fausto Spoto:
Analysis of Downward Closed Properties of Logic Programs. AMAST 2000: 181-196 - [c9]Giorgio Levi, Fausto Spoto:
Non Pair-Sharing and Freeness Analysis Through Linear Refinement. PEPM 2000: 52-61
1990 – 1999
- 1999
- [c8]Patricia M. Hill, Fausto Spoto:
Freeness Analysis through Linear Refinement. APPIA-GULP-PRODE 1999: 321-337 - [c7]
- 1998
- [c6]Fausto Spoto, Giorgio Levi:
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. APPIA-GULP-PRODE 1998: 269-282 - [c5]Roberta Gori, E. Lastres, R. Moreno, Fausto Spoto:
Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation. APPIA-GULP-PRODE 1998: 433-442 - [c4]
- [c3]Giorgio Levi, Fausto Spoto:
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. PLILP/ALP 1998: 152-169 - 1997
- [c2]
- 1996
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-02-05 22:07 CET by the dblp team