default search action
Gilberto Filé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j19]Wafa Ben Jaballah, Mauro Conti
, Gilberto Filé, Mohamed Mosbah
Whac-A-Mole: Smart node positioning in clone attack in wireless sensor networks. Comput. Commun. 119: 66-82 (2018)
2000 – 2009
- 2009
- [c31]Gilberto Filé, Roberto Vigo:
Expressive Power of Definite Clauses for Verifying Authenticity. CSF 2009: 251-265 - 2007
- [e3]Hanne Riis Nielson, Gilberto Filé:
Static Analysis, 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007, Proceedings. Lecture Notes in Computer Science 4634, Springer 2007, ISBN 978-3-540-74060-5 [contents] - 2004
- [c30]Livio Colussi, Gilberto Filé, A. Griggio:
Precise Analysis of π-Calculus in Cubic Time. IFIP TCS 2004: 317-331 - 2003
- [j18]Agostino Cortesi
Static Analysis. Sci. Comput. Program. 47(2-3): 89-90 (2003)
1990 – 1999
- 1999
- [j17]Agostino Cortesi
Sharing is Optimal. J. Log. Program. 38(3): 371-386 (1999) - [j16]Gilberto Filé, Francesco Ranzato:
The Powerset Operator on Abstract Interpretations. Theor. Comput. Sci. 222(1-2): 77-111 (1999) - [c29]Dante Baldan, Nicola Civran, Gilberto Filé, Francesco Pulvirenti:
A Simple and General Method for Integrating Abstract Interpretation in SICStus. PPDP 1999: 207-223 - [e2]Agostino Cortesi
Static Analysis, 6th International Symposium, SAS '99, Venice, Italy, September 22-24, 1999, Proceedings. Lecture Notes in Computer Science 1694, Springer 1999, ISBN 3-540-66459-9 [contents] - 1998
- [j15]Agostino Cortesi
The Quotient of an Abstract Interpretation. Theor. Comput. Sci. 202(1-2): 163-192 (1998) - 1997
- [j14]Agostino Cortesi
Complementation in Abstract Interpretation. ACM Trans. Program. Lang. Syst. 19(1): 7-47 (1997) - [c28]Dante Baldan, Gilberto Filé:
Abstract Interpretation from Improving WAM Code. SAS 1997: 364 - [c27]Annalisa Bossi, Dennis Dams, Gilberto Filé, Elena Marchiori:
Verification, Model Checking and Abstract Interpretation (Workshop Overview). ILPS 1997: 421-422 - 1996
- [j13]Gilberto Filé, Roberto Giacobazzi, Francesco Ranzato:
A Unifying View of Abstract Domain Design. ACM Comput. Surv. 28(2): 333-336 (1996) - [j12]Agostino Cortesi
Optimal Groundness Analysis Using Propositional Logic. J. Log. Program. 27(2): 137-167 (1996) - [j11]Michael Codish
On the Design of a Correct Freeness Analysis for Logic Programs. J. Log. Program. 28(3): 181-206 (1996) - [c26]Gilberto Filé, Francesco Ranzato:
Complementation of Abstract Domains made Easy. JICSLP 1996: 348-362 - 1995
- [c25]Gilberto Filé, Giuseppe Nardiello, Adriano Tirabosco:
Semmantic Properties of CHIP (FD). Constraint Processing, Selected Papers 1995: 225-245 - [c24]Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi
Complementation in Abstract Interpretation. SAS 1995: 100-117 - 1994
- [c23]Gilberto Filé, Francesco Ranzato:
Improving Abstract Interpretations by Systematic Lifting to the Powerset. GULP-PRODE (1) 1994: 357-371 - [c22]Agostino Cortesi, Gilberto Filé, William H. Winsborough:
The Quotient of an Abstract Interpretation for Comparing Static Analyses. GULP-PRODE (1) 1994: 372-387 - [c21]Gilberto Filé, Francesco Ranzato:
Improving Abstract Interpretations by Systematic Lifting to the Powerset. ILPS 1994: 655-669 - 1993
- [j10]Agostino Cortesi
Graph Properties for Normal Logic Programs. Theor. Comput. Sci. 107(2): 277-303 (1993) - [c20]Agostino Cortesi, Gilberto Filé:
Comparison and design of abstract domains for sharing analysis. GULP 1993: 251-266 - [c19]Gilberto Filé, Sabina Rossi:
Static Analysis of Prolog with Cut. GULP 1993: 325-340 - [c18]Gilberto Filé, Giuseppe Nardiello, Adriano Tirabosco:
An Operational Semantics for CHIP. GULP 1993: 633-648 - [c17]Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe:
Freeness Analysis for Logic Programs - And Correctness? ICLP 1993: 116-131 - [c16]Gilberto Filé, Sabina Rossi:
Static Analysis of Prolog with Cut. LPAR 1993: 134-145 - [e1]Patrick Cousot, Moreno Falaschi, Gilberto Filé, Antoine Rauzy:
Static Analysis, Third International Workshop, WSA'93, Padova, Italy, September 22-24, 1993, Proceedings. Lecture Notes in Computer Science 724, Springer 1993, ISBN 3-540-57264-3 [contents] - 1992
- [c15]Agostino Cortesi
Comparison of Abstract Interpretations. ICALP 1992: 521-532 - [c14]Philippe Codognet, Gilberto Filé:
Computations, abstractions and constraints in logic programs. ICCL 1992: 155-164 - 1991
- [c13]Agostino Cortesi, Gilberto Filé, William H. Winsborough:
Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis. LICS 1991: 322-327 - [c12]Agostino Cortesi
Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis. PEPM 1991: 52-61 - [c11]Gilberto Filé, P. Sottero:
Abstract Interpretation for Type Checking. PLILP 1991: 311-322 - [c10]Philippe Codognet, Gilberto Filé:
Computations, Abstractions and Constraints (abstract). JTASPEFT/WSA 1991: 70-71
1980 – 1989
- 1989
- [j9]Gilberto Filé:
The Relation of Two Patterns With Comparable Languages Patterns. RAIRO Theor. Informatics Appl. 23(1): 45-57 (1989) - [j8]Joost Engelfriet, Gilberto Filé:
Passes, sweeps, and visits in attribute grammars. J. ACM 36(4): 841-869 (1989) - 1988
- [j7]Stefano Baratella, Gilberto Filé:
A completeness result for SLDNF resoultion. Bull. EATCS 35: 97-105 (1988) - [c9]Christian Codognet, Philippe Codognet, Gilberto Filé:
Yet Another Intelligent Backtracking Method. ICLP/SLP 1988: 447-465 - [c8]Christian Codognet, Philippe Codognet, Gilberto Filé:
Yet another intelligent Backtracking method. SPLT 1988: 317-336 - [c7]Gilberto Filé:
The Relation of Two Patterns with Comparable Languages. STACS 1988: 184-192 - 1987
- [j6]Gilberto Filé:
Classical and Incremental Attribute Evaluation by Means of Recursive Procedures. Theor. Comput. Sci. 53: 25-65 (1987) - 1986
- [j5]Gilberto Filé:
Machines for Attribute Grammars. Inf. Control. 69(1-3): 41-124 (1986) - [c6]Gilberto Filé:
Classical and Incremental Evaluators for Attribute Grammars. CAAP 1986: 112-126 - [c5]Christian Codognet, Philippe Codognet, Gilberto Filé:
A Very Intelligent Backtracking Method for Logic Programs. ESOP 1986: 315-326 - [c4]Christian Codognet, Philippe Codognet, Gilberto Filé:
Backtracking intelligent en programmation logique. SPLT 1986: 25-50 - 1985
- [c3]Gilberto Filé:
Tree Automata and Logic Programs. STACS 1985: 119-130 - 1983
- [j4]Gilberto Filé:
Interpretation and Reduction of Attribute Grammars. Acta Informatica 19: 115-150 (1983) - 1982
- [j3]Joost Engelfriet, Gilberto Filé:
Simple Multi-Visit Attribute Grammars. J. Comput. Syst. Sci. 24(3): 283-314 (1982) - 1981
- [j2]Joost Engelfriet, Gilberto Filé:
The Formal Power of One-Visit Attribute Grammars. Acta Informatica 16: 275-302 (1981) - [j1]Joost Engelfriet, Gilberto Filé:
Passes and Paths of Attributive Grammars. Inf. Control. 49(2): 125-169 (1981) - [c2]Joost Engelfriet, Gilberto Filé:
Passes, Sweeps and Visits. ICALP 1981: 193-207 - 1980
- [c1]Joost Engelfriet, Gilberto Filé:
Formal Properties of One-Visit and Multi-Pass Attribute Grammars. ICALP 1980: 182-194
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: