Gilberto Filé

According to our database1, Gilberto Filé
  • authored at least 49 papers between 1980 and 2009.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Expressive Power of Definite Clauses for Verifying Authenticity.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2004
Precise Analysis of π-Calculus in Cubic Time.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Static Analysis.
Sci. Comput. Program., 2003

1999
The Powerset Operator on Abstract Interpretations.
Theor. Comput. Sci., 1999

Sharing is Optimal.
J. Log. Program., 1999

A Simple and General Method for Integrating Abstract Interpretation in SICStus.
Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

1998
The Quotient of an Abstract Interpretation.
Theor. Comput. Sci., 1998

1997
Complementation in Abstract Interpretation.
ACM Trans. Program. Lang. Syst., 1997

Verification, Model Checking and Abstract Interpretation (Workshop Overview).
Proceedings of the Logic Programming, 1997

Abstract Interpretation from Improving WAM Code.
Proceedings of the Static Analysis, 4th International Symposium, 1997

1996
Optimal Groundness Analysis Using Propositional Logic.
J. Log. Program., 1996

On the Design of a Correct Freeness Analysis for Logic Programs.
J. Log. Program., 1996

A Unifying View of Abstract Domain Design.
ACM Comput. Surv., 1996

Complementation of Abstract Domains made Easy.
Proceedings of the Logic Programming, 1996

1995
Complementation in Abstract Interpretation
Proceedings of the Static Analysis, 1995

Semmantic Properties of CHIP (FD).
Proceedings of the Constraint Processing, Selected Papers, 1995

1994
Improving Abstract Interpretations by Systematic Lifting to the Powerset.
Proceedings of the Logic Programming, 1994

Improving Abstract Interpretations by Systematic Lifting to the Powerset.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

The Quotient of an Abstract Interpretation for Comparing Static Analyses.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993
Graph Properties for Normal Logic Programs.
Theor. Comput. Sci., 1993

Static Analysis of Prolog with Cut.
Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

Freeness Analysis for Logic Programs - And Correctness?
Proceedings of the Logic Programming, 1993

Static Analysis of Prolog with Cut.
Proceedings of the 8th Italian Conference on Logic Programming, 1993

An Operational Semantics for CHIP.
Proceedings of the 8th Italian Conference on Logic Programming, 1993

Comparison and design of abstract domains for sharing analysis.
Proceedings of the 8th Italian Conference on Logic Programming, 1993

1992
Computations, abstractions and constraints in logic programs.
Proceedings of the ICCL'92, 1992

Comparison of Abstract Interpretations.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
Computations, Abstractions and Constraints (abstract).
Proceedings of the Actes JTASPEFL'91 (Bordeaux), 1991

Abstract Interpretation for Type Checking.
Proceedings of the Programming Language Implementation and Logic Programming, 1991

Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis.
Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1989
Passes, sweeps, and visits in attribute grammars.
J. ACM, 1989

The Relation of Two Patterns With Comparable Languages Patterns.
ITA, 1989

1988
A completeness result for SLDNF resoultion.
Bulletin of the EATCS, 1988

The Relation of Two Patterns with Comparable Languages.
Proceedings of the STACS 88, 1988

Yet another intelligent Backtracking method.
Proceedings of the SPLT'88, 1988

Yet Another Intelligent Backtracking Method.
Proceedings of the Logic Programming, 1988

1987
Classical and Incremental Attribute Evaluation by Means of Recursive Procedures.
Theor. Comput. Sci., 1987

1986
Machines for Attribute Grammars
Information and Control, 1986

Backtracking intelligent en programmation logique.
Proceedings of the SPLT'86, 1986

A Very Intelligent Backtracking Method for Logic Programs.
Proceedings of the ESOP 86, 1986

Classical and Incremental Evaluators for Attribute Grammars.
Proceedings of the CAAP '86, 1986

1985
Tree Automata and Logic Programs.
Proceedings of the STACS 85, 1985

1983
Interpretation and Reduction of Attribute Grammars.
Acta Inf., 1983

1982
Simple Multi-Visit Attribute Grammars.
J. Comput. Syst. Sci., 1982

1981
Passes and Paths of Attributive Grammars
Information and Control, May, 1981

The Formal Power of One-Visit Attribute Grammars.
Acta Inf., 1981

Passes, Sweeps and Visits.
Proceedings of the Automata, 1981

1980
Formal Properties of One-Visit and Multi-Pass Attribute Grammars.
Proceedings of the Automata, 1980


  Loading...