|
Search the dblp DataBase
Gilberto Filé:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Agostino Cortesi, Gilberto Filé
Comparison and design of abstract domains for sharing analysis. [Citation Graph (0, 0)][DBLP] GULP, 1993, pp:251-266 [Conf]
- Agostino Cortesi, Gilberto Filé, William H. Winsborough
The Quotient of an Abstract Interpretation for Comparing Static Analyses. [Citation Graph (0, 0)][DBLP] GULP-PRODE (1), 1994, pp:372-387 [Conf]
- Gilberto Filé, Giuseppe Nardiello, Adriano Tirabosco
An Operational Semantics for CHIP. [Citation Graph (0, 0)][DBLP] GULP, 1993, pp:633-648 [Conf]
- Gilberto Filé, Sabina Rossi
Static Analysis of Prolog with Cut. [Citation Graph (0, 0)][DBLP] GULP, 1993, pp:325-340 [Conf]
- Gilberto Filé, Francesco Ranzato
Improving Abstract Interpretations by Systematic Lifting to the Powerset. [Citation Graph (0, 0)][DBLP] GULP-PRODE (1), 1994, pp:357-371 [Conf]
- Gilberto Filé
Classical and Incremental Evaluators for Attribute Grammars. [Citation Graph (0, 0)][DBLP] CAAP, 1986, pp:112-126 [Conf]
- Gilberto Filé, Giuseppe Nardiello, Adriano Tirabosco
Semmantic Properties of CHIP (FD). [Citation Graph (0, 0)][DBLP] Constraint Processing, Selected Papers, 1995, pp:225-245 [Conf]
- Christian Codognet, Philippe Codognet, Gilberto Filé
A Very Intelligent Backtracking Method for Logic Programs. [Citation Graph (0, 0)][DBLP] ESOP, 1986, pp:315-326 [Conf]
- Agostino Cortesi, Gilberto Filé, William H. Winsborough
Comparison of Abstract Interpretations. [Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:521-532 [Conf]
- Joost Engelfriet, Gilberto Filé
Formal Properties of One-Visit and Multi-Pass Attribute Grammars. [Citation Graph (0, 0)][DBLP] ICALP, 1980, pp:182-194 [Conf]
- Joost Engelfriet, Gilberto Filé
Passes, Sweeps and Visits. [Citation Graph (0, 0)][DBLP] ICALP, 1981, pp:193-207 [Conf]
- Philippe Codognet, Gilberto Filé
Computations, abstractions and constraints in logic programs. [Citation Graph (0, 0)][DBLP] ICCL, 1992, pp:155-164 [Conf]
- Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
Freeness Analysis for Logic Programs - And Correctness? [Citation Graph (0, 0)][DBLP] ICLP, 1993, pp:116-131 [Conf]
- Christian Codognet, Philippe Codognet, Gilberto Filé
Yet Another Intelligent Backtracking Method. [Citation Graph (0, 0)][DBLP] ICLP/SLP, 1988, pp:447-465 [Conf]
- Gilberto Filé, Francesco Ranzato
Complementation of Abstract Domains made Easy. [Citation Graph (0, 0)][DBLP] JICSLP, 1996, pp:348-362 [Conf]
- Livio Colussi, Gilberto Filé, A. Griggio
Precise Analysis of p-Calculus in Cubic Time. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2004, pp:317-332 [Conf]
- Christian Codognet, Philippe Codognet, Gilberto Filé
Backtracking intelligent en programmation logique. [Citation Graph (0, 0)][DBLP] SPLT, 1986, pp:25-50 [Conf]
- Christian Codognet, Philippe Codognet, Gilberto Filé
Yet another intelligent Backtracking method. [Citation Graph (0, 0)][DBLP] SPLT, 1988, pp:317-336 [Conf]
- Agostino Cortesi, Gilberto Filé, William H. Winsborough
Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis [Citation Graph (0, 0)][DBLP] LICS, 1991, pp:322-327 [Conf]
- Gilberto Filé, Sabina Rossi
Static Analysis of Prolog with Cut. [Citation Graph (0, 0)][DBLP] LPAR, 1993, pp:134-145 [Conf]
- Agostino Cortesi, Gilberto Filé
Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis. [Citation Graph (0, 0)][DBLP] PEPM, 1991, pp:52-61 [Conf]
- Gilberto Filé, P. Sottero
Abstract Interpretation for Type Checking. [Citation Graph (0, 0)][DBLP] PLILP, 1991, pp:311-322 [Conf]
- Dante Baldan, Nicola Civran, Gilberto Filé, Francesco Pulvirenti
A Simple and General Method for Integrating Abstract Interpretation in SICStus. [Citation Graph (0, 0)][DBLP] PPDP, 1999, pp:207-223 [Conf]
- Dante Baldan, Gilberto Filé
Abstract Interpretation from Improving WAM Code. [Citation Graph (0, 0)][DBLP] SAS, 1997, pp:364- [Conf]
- Philippe Codognet, Gilberto Filé
Computations, Abstractions and Constraints (abstract). [Citation Graph (0, 0)][DBLP] JTASPEFT/WSA, 1991, pp:70-71 [Conf]
- Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato
Complementation in Abstract Interpretation [Citation Graph (0, 0)][DBLP] SAS, 1995, pp:100-117 [Conf]
- Annalisa Bossi, Dennis Dams, Gilberto Filé, Elena Marchiori
Verification, Model Checking and Abstract Interpretation (Workshop Overview). [Citation Graph (0, 0)][DBLP] ILPS, 1997, pp:421-422 [Conf]
- Gilberto Filé, Francesco Ranzato
Improving Abstract Interpretations by Systematic Lifting to the Powerset. [Citation Graph (0, 0)][DBLP] SLP, 1994, pp:655-669 [Conf]
- Gilberto Filé
Tree Automata and Logic Programs. [Citation Graph (0, 0)][DBLP] STACS, 1985, pp:119-130 [Conf]
- Gilberto Filé
The Relation of Two Patterns with Comparable Languages. [Citation Graph (0, 0)][DBLP] STACS, 1988, pp:184-192 [Conf]
- Joost Engelfriet, Gilberto Filé
The Formal Power of One-Visit Attribute Grammars. [Citation Graph (0, 0)][DBLP] Acta Inf., 1981, v:16, n:, pp:275-302 [Journal]
- Gilberto Filé
Interpretation and Reduction of Attribute Grammars. [Citation Graph (0, 0)][DBLP] Acta Inf., 1983, v:19, n:, pp:115-150 [Journal]
- Gilberto Filé, Roberto Giacobazzi, Francesco Ranzato
A Unifying View of Abstract Domain Design. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 1996, v:28, n:2, pp:333-336 [Journal]
- Stefano Baratella, Gilberto Filé
A completeness result for SLDNF resoultion. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1988, v:35, n:, pp:97-105 [Journal]
- Joost Engelfriet, Gilberto Filé
Passes and Paths of Attributive Grammars [Citation Graph (0, 0)][DBLP] Information and Control, 1981, v:49, n:2, pp:125-169 [Journal]
- Gilberto Filé
Machines for Attribute Grammars [Citation Graph (0, 0)][DBLP] Information and Control, 1986, v:69, n:1-3, pp:41-124 [Journal]
- Gilberto Filé
The Relation of Two Patterns With Comparable Languages Patterns. [Citation Graph (0, 0)][DBLP] ITA, 1989, v:23, n:1, pp:45-57 [Journal]
- Joost Engelfriet, Gilberto Filé
Passes, sweeps, and visits in attribute grammars. [Citation Graph (0, 0)][DBLP] J. ACM, 1989, v:36, n:4, pp:841-869 [Journal]
- Joost Engelfriet, Gilberto Filé
Simple Multi-Visit Attribute Grammars. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1982, v:24, n:3, pp:283-314 [Journal]
- Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
On the Design of a Correct Freeness Analysis for Logic Programs. [Citation Graph (0, 0)][DBLP] J. Log. Program., 1996, v:28, n:3, pp:181-206 [Journal]
- Agostino Cortesi, Gilberto Filé
Sharing is Optimal. [Citation Graph (0, 0)][DBLP] J. Log. Program., 1999, v:38, n:3, pp:371-386 [Journal]
- Agostino Cortesi, Gilberto Filé, William H. Winsborough
Optimal Groundness Analysis Using Propositional Logic. [Citation Graph (0, 0)][DBLP] J. Log. Program., 1996, v:27, n:2, pp:137-167 [Journal]
- Agostino Cortesi, Gilberto Filé
Static Analysis. [Citation Graph (0, 0)][DBLP] Sci. Comput. Program., 2003, v:47, n:2-3, pp:89-90 [Journal]
- Agostino Cortesi, Gilberto Filé
Graph Properties for Normal Logic Programs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:107, n:2, pp:277-303 [Journal]
- Agostino Cortesi, Gilberto Filé, William H. Winsborough
The Quotient of an Abstract Interpretation. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:202, n:1-2, pp:163-192 [Journal]
- Gilberto Filé
Classical and Incremental Attribute Evaluation by Means of Recursive Procedures. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1987, v:53, n:, pp:25-65 [Journal]
- Gilberto Filé, Francesco Ranzato
The Powerset Operator on Abstract Interpretations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:222, n:1-2, pp:77-111 [Journal]
- Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato
Complementation in Abstract Interpretation. [Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 1997, v:19, n:1, pp:7-47 [Journal]
Expressive Power of Definite Clauses for Verifying Authenticity. [Citation Graph (, )][DBLP]
Search in 0.024secs, Finished in 0.026secs
|