Static Analysis

Domains A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184 Paolo Volpe Refining Static Analyses by Trace-Based Partinioning Using Control Flow . 200 Maria Handjieva, Stanislav Tzolovski Building Complete Abstract Interpretations in a Linear Logic-Based Setting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215 Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari

[1]  Kim G. Larsen,et al.  Compositional Verification of Probabilistic Processes , 1992, CONCUR.

[2]  Hans Zantema,et al.  Simple Termination of Rewrite Systems , 1997, Theor. Comput. Sci..

[3]  Orna Grumberg,et al.  Abstract interpretation of reactive systems : abstractions preserving .. , 1994 .

[4]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[5]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[6]  Valentin F. Turchin,et al.  The concept of a supercompiler , 1986, TOPL.

[7]  Wim Vanhoof,et al.  To Parse or Not To Parse , 1997, LOPSTR.

[8]  David N. Turner,et al.  The polymorphic Pi-calculus : theory and implementation , 1996 .

[9]  Rance Cleaveland,et al.  Optimality in Abstractions of Model Checking , 1995, SAS.

[10]  Erik Ruf Topics in online partial evaluation , 1993 .

[11]  Orna Grumberg,et al.  Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.

[12]  Bernhard Steffen,et al.  Property-Oriented Expansion , 1996, SAS.

[13]  Michael Leuschel,et al.  Sonic Partial Deduction , 1999, Ershov Memorial Conference.

[14]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[15]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, REX Workshop.

[16]  Marco Pistore,et al.  Concurrent Semantics for the π-calculus1 1Work supported in part by Esprit Basic Research project CONFER and working group COMPUGRAPH II and by Progetto Speciale CNR “Specifica ad Alto Livelloe Verifica Formale di Sistemi Digitali”. , 1995 .

[17]  Corrado Priami Interleaving based partial ordering semantics , 1996 .

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  Joseph Sifakis,et al.  Property Preserving Simulations , 1992, CAV.

[20]  Huimin Lin,et al.  Symbolic Transition Graph with Assignment , 1996, CONCUR.

[21]  Arnaud Venet,et al.  Abstract Interpretation of the pi-Calculus , 1996, LOMAPS.

[22]  Arnaud Venet,et al.  Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs , 1996, SAS.

[23]  David A. Schmidt Abstract Interpretation of Small-Step Semantics , 1996, LOMAPS.

[24]  Paul-André Melliès,et al.  On a Duality Between Kruskal and Dershowitz Theorems , 1998, ICALP.

[25]  Lutz Plümer Termination Proofs for Logic Programs , 1990, Lecture Notes in Computer Science.

[26]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[27]  Bernhard Steffen,et al.  Generating Data Flow Analysis Algorithms from Modal Specifications , 1993, Sci. Comput. Program..

[28]  Robert Glück,et al.  A positive supercompiler , 1996, Journal of Functional Programming.

[29]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[30]  Bernhard Steffen,et al.  Unifying Models , 1997, STACS.

[31]  Dexter Kozen,et al.  Results on the Propositional mu-Calculus , 1983, Theor. Comput. Sci..

[32]  Ugo Montanari,et al.  A Parametric Approach to Localities , 1992, ICALP.

[33]  Jonathan Stillman Computational problems in equational theorem proving , 1989 .

[34]  Robert Glück,et al.  An Algorithm of Generalization in Positive Supercompilation , 1995, ILPS.

[35]  Laurence Puel,et al.  Using Unavoidable Set of Trees to Generalize Kruskal's Theorem , 1989, J. Symb. Comput..

[36]  Corrado Priami,et al.  Stochastic pi-Calculus , 1995, Comput. J..

[37]  David A. Schmidt Data flow analysis is model checking of abstract interpretations , 1998, POPL '98.

[38]  Flemming Nielson,et al.  Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.

[39]  Rance Cleaveland,et al.  Testing-Based Abstractions for Value-Passing Systems , 1994, CONCUR.

[40]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..