Gilberto Filé

Roberto Vigo

Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2004

Precise Analysis of π-Calculus in Cubic Time.

[BibT_eX]

[DOI]

Livio Colussi

A. Griggio

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Static Analysis.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2003

1999

The Powerset Operator on Abstract Interpretations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Sharing is Optimal.

[BibT_eX]

[DOI]

J. Log. Program., 1999

A Simple and General Method for Integrating Abstract Interpretation in SICStus.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1997

Complementation in Abstract Interpretation.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1997

Verification, Model Checking and Abstract Interpretation (Workshop Overview).

[BibT_eX]

Proceedings of the Logic Programming, 1997

Abstract Interpretation from Improving WAM Code.

[BibT_eX]

[DOI]

Dante Baldan

Proceedings of the Static Analysis, 4th International Symposium, 1997

1996

Optimal Groundness Analysis Using Propositional Logic.

[BibT_eX]

[DOI]

J. Log. Program., 1996

On the Design of a Correct Freeness Analysis for Logic Programs.

[BibT_eX]

[DOI]

J. Log. Program., 1996

A Unifying View of Abstract Domain Design.

[BibT_eX]

[DOI]

Roberto Giacobazzi

ACM Comput. Surv., 1996

Complementation of Abstract Domains made Easy.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1996

1995

Semmantic Properties of CHIP (FD).

[BibT_eX]

[DOI]

Giuseppe Nardiello

Adriano Tirabosco

Proceedings of the Constraint Processing, Selected Papers, 1995

1994

Improving Abstract Interpretations by Systematic Lifting to the Powerset.

[BibT_eX]

Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

The Quotient of an Abstract Interpretation for Comparing Static Analyses.

[BibT_eX]

Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993

Graph Properties for Normal Logic Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Freeness Analysis for Logic Programs - And Correctness?

[BibT_eX]

Proceedings of the Logic Programming, 1993

Static Analysis of Prolog with Cut.

[BibT_eX]

Sabina Rossi

Proceedings of the 8th Italian Conference on Logic Programming, 1993

An Operational Semantics for CHIP.

[BibT_eX]

Giuseppe Nardiello

Adriano Tirabosco

Proceedings of the 8th Italian Conference on Logic Programming, 1993

Comparison and design of abstract domains for sharing analysis.

[BibT_eX]

Proceedings of the 8th Italian Conference on Logic Programming, 1993

1992

Computations, abstractions and constraints in logic programs.

[BibT_eX]

[DOI]

Proceedings of the ICCL'92, 1992

Comparison of Abstract Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Computations, Abstractions and Constraints (abstract).

[BibT_eX]

Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Abstract Interpretation for Type Checking.

[BibT_eX]

[DOI]

P. Sottero

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.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1989

Passes, sweeps, and visits in attribute grammars.

[BibT_eX]

[DOI]

J. ACM, 1989

The Relation of Two Patterns With Comparable Languages Patterns.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1989

1988

A completeness result for SLDNF resoultion.

[BibT_eX]

Stefano Baratella

Bull. EATCS, 1988

The Relation of Two Patterns with Comparable Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 88, 1988

Yet Another Intelligent Backtracking Method.

[BibT_eX]

Christian Codognet

Proceedings of the Logic Programming, 1988

1987

Classical and Incremental Attribute Evaluation by Means of Recursive Procedures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1986

Machines for Attribute Grammars

[BibT_eX]

[DOI]

Inf. Control., 1986

Backtracking intelligent en programmation logique.

[BibT_eX]

Christian Codognet

Proceedings of the SPLT'86, 1986

A Very Intelligent Backtracking Method for Logic Programs.

[BibT_eX]

[DOI]

Christian Codognet

Proceedings of the ESOP 86, 1986

Classical and Incremental Evaluators for Attribute Grammars.

[BibT_eX]

[DOI]

Proceedings of the CAAP '86, 1986

1985

Tree Automata and Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1983

Interpretation and Reduction of Attribute Grammars.

[BibT_eX]

[DOI]

Acta Informatica, 1983

1982

Simple Multi-Visit Attribute Grammars.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

1981

Passes and Paths of Attributive Grammars

[BibT_eX]

[DOI]

Inf. Control., May, 1981

The Formal Power of One-Visit Attribute Grammars.

[BibT_eX]

[DOI]

Acta Informatica, 1981

Passes, Sweeps and Visits.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

Formal Properties of One-Visit and Multi-Pass Attribute Grammars.

[BibT_eX]

[DOI]