Conferences in DBLP
G. Ramalingam On Sparse Evaluation Representations. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:1-15 [Conf ] Marc Shapiro 0002 , Susan Horwitz The Effects of the Presision of Pointer Analysis. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:16-34 [Conf ] Oscar Waddell , R. Kent Dybvig Fast and Effective Procedure Inlining. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:35-52 [Conf ] Roberto Bagnara , Patricia M. Hill , Enea Zaffanella Set-Sharing is Redundant for Pair-Sharing. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:53-67 [Conf ] Michael Codish , Vitaly Lagoon , Francisco Bueno An Algebraic Approach to Sharing Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:68-82 [Conf ] Francesca Scozzari Logical Optimality of Groundness Analysis. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:83-97 [Conf ] Kwangkeun Yi , Sukyoung Ryu Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:98-113 [Conf ] Manuel Fähndrich , Alexander Aiken Program Analysis Using Mixed Term and Set Constraints. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:114-126 [Conf ] Jean-Marc Talbot , Sophie Tison , Philippe Devienne Set-Based Analysis for Logic Programming and Tree Automata. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:127-140 [Conf ] Frank Zartmann Denotational Abstract Interpretation of Functional Logic Programs. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:141-159 [Conf ] Chris Speirs , Zoltan Somogyi , Harald Søndergaard Termination Analysis for Mercury. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:160-171 [Conf ] Bernard Boigelot , Patrice Godefroid , Bernard Willems , Pierre Wolper The Power of QDDs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:172-186 [Conf ] Atsushi Igarashi , Naoki Kobayashi Type-Based Analysis of Communication for Concurrent Programming Languages. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:187-201 [Conf ] Chiara Bodei , Corrado Priami True Concurrency via Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:202-216 [Conf ] Ian Mackie Static Analysis of Interaction Nets for Distributed Implementations. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:217-231 [Conf ] Suresh Jagannathan , Stephen Weeks , Andrew K. Wright Type-Directed Flow Analysis for Typed Intermediate Languages. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:232-249 [Conf ] Christian Mossin Exact Flow Analysis. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:250-264 [Conf ] Alexandre Frey Satisfying Subtype Inequalities in Polynomial Space. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:265-277 [Conf ] Philippe Granger Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:278-292 [Conf ] Luke Hornof , Charles Consel , Jacques Noyé Effective Specialization of Realistic Programs via Use Sensitivity. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:293-314 [Conf ] Gang-Ryung Uh , David B. Whalley Coalescing Conditional Branches into Efficient Indirect Jumps. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:315-329 [Conf ] Jürgen Brauburger Automatic Termination Analysis for Partial Functions Using Polynomial Orderings. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:330-344 [Conf ] Sven Eric Panitz , Manfred Schmidt-Schauß TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:345-360 [Conf ] Pavel G. Emelianov , Danil E. Baburin Semantic Analyzer of Modula-Programs. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:361-363 [Conf ] Dante Baldan , Gilberto Filé Abstract Interpretation from Improving WAM Code. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:364- [Conf ] Loïc Correnson , Étienne Duris , Didier Parigot , Gilles Roussel Attribute Grammars and Functional Programming Deforestation. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:365- [Conf ] Stanislav Tzolovski Data Dependence as Abstract Interpretations. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:366- [Conf ] Kim Marriott Abstract Interpretation: A Theory of Approximate Computation. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:367-378 [Conf ] Baudouin Le Charlier , Pierre Flener On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:379-387 [Conf ] Patrick Cousot Abstract Interpretation Based Static Analysis Parameterized by Semantics. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:388-394 [Conf ] Luddy Harrison Can Abstract Interpretation Become a Mainstream Compiler Technology? (Abstract). [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:395- [Conf ] Neil D. Jones Combining Abstract Interpretation and Partial Evaluation (Brief Overview). [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:396-405 [Conf ] Barbara G. Ryder Practical Compile-Time Analysis. [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:406-412 [Conf ]