Proceedings of the Fourth International Static Analysis Symposium
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Pascal Van Hentenryck
Proceedings of the Fourth International Static Analysis Symposium
SAS, 1997.

PLT
DBLP
Scholar
Full names Links ISxN
@proceedings{SAS-1997,
	address       = "Paris, France",
	editor        = "Pascal Van Hentenryck",
	isbn          = "3-540-63468-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fourth International Static Analysis Symposium}",
	volume        = 1302,
	year          = 1997,
}

Contents (33 items)

SAS-1997-Ramalingam #evaluation #on the
On Sparse Evaluation Representations (GR), pp. 1–15.
SAS-1997-ShapiroH #analysis #pointer #precise
The Effects of the Precision of Pointer Analysis (MS, SH), pp. 16–34.
SAS-1997-WaddellD #effectiveness #performance
Fast and Effective Procedure Inlining (OW, RKD), pp. 35–52.
SAS-1997-BagnaraHZ
Set-Sharing is Redundant for Pair-Sharing (RB, PMH, EZ), pp. 53–67.
SAS-1997-CodishLB #algebra #analysis #approach #logic programming #source code
An Algebraic Approach to Sharing Analysis of Logic Programs (MC, VL, FB), pp. 68–82.
SAS-1997-Scozzari #analysis #logic
Logical Optimality of Groundness Analysis (FS), pp. 83–97.
SAS-1997-YiR #effectiveness #estimation #exception #source code #towards
Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs (KY, SR), pp. 98–113.
SAS-1997-FahndrichA #constraints #program analysis #set #using
Program Analysis Using Mixed Term and Set Constraints (MF, AA), pp. 114–126.
SAS-1997-TalbotTD #analysis #automaton #logic programming
Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
SAS-1997-Zartmann #abstract interpretation #functional #logic programming #source code
Denotational Abstract Interpretation of Functional Logic Programs (FZ), pp. 141–159.
SAS-1997-SpeirsSS #analysis #termination
Termination Analysis for Mercury (CS, ZS, HS), pp. 160–171.
SAS-1997-BoigelotGWW #power of
The Power of QDDs (BB, PG, BW, PW), pp. 172–186.
SAS-1997-IgarashiK #analysis #communication #concurrent #programming language #type system
Type-Based Analysis of Communication for Concurrent Programming Languages (AI, NK), pp. 187–201.
SAS-1997-BodeiP #abstract interpretation #concurrent
True Concurrency via Abstract Interpretation (CB, CP), pp. 202–216.
SAS-1997-Mackie #distributed #implementation #interactive #static analysis
Static Analysis of Interaction Nets for Distributed Implementations (IM), pp. 217–231.
SAS-1997-JagannathanWW #analysis
Type-Directed Flow Analysis for Typed Intermediate Languages (SJ, SW, AKW), pp. 232–249.
SAS-1997-Mossin #analysis
Exact Flow Analysis (CM), pp. 250–264.
SAS-1997-Frey #polynomial #type system
Satisfying Subtype Inequalities in Polynomial Space (AF), pp. 265–277.
SAS-1997-Granger #analysis #congruence
Static Analyses of Congruence Properties on Rational Numbers (PG), pp. 278–292.
SAS-1997-HornofCN #effectiveness #source code
Effective Specialization of Realistic Programs via Use Sensitivity (LH, CC, JN), pp. 293–314.
SAS-1997-UhW #branch #performance
Coalescing Conditional Branches into Efficient Indirect Jumps (GRU, DBW), pp. 315–329.
SAS-1997-Braunburger #analysis #automation #order #polynomial #termination #using
Automatic Termination Analysis for Partial Functions Using Polynomial Orderings (JB), pp. 330–344.
SAS-1997-PanitzS #automation #functional #higher-order #named #proving #source code #strict #termination
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language (SEP, MSS), pp. 345–360.
SAS-1997-EmelianovB #semantics
Semantic Analyzer of Modula-Programs (PGE, DEB), pp. 361–363.
SAS-1997-BaldanF #abstract interpretation
Abstract Interpretation from Improving WAM Code (DB, GF), p. 364.
SAS-1997-CorrensonDPR #attribute grammar #deforestation #functional #programming
Attribute Grammars and Functional Programming Deforestation (LC, ÉD, DP, GR), p. 365.
SAS-1997-Tzolovski #abstract interpretation #data flow #dependence
Data Dependence as Abstract Interpretations (ST), p. 366.
SAS-1997-Marriott #abstract interpretation #approximate #formal method
Abstract Interpretation: A Theory of Approximate Computation (KM), pp. 367–378.
SAS-1997-CharlierF #abstract interpretation #on the #theory and practice
On the Desirable Link Between Theory and Practice in Abstract Interpretation (BLC, PF), pp. 379–387.
SAS-1997-Cousot #abstract interpretation #semantics #static analysis
Abstract Interpretation Based Static Analysis Parameterized by Semantics (PC), pp. 388–394.
SAS-1997-Harrison #abstract interpretation #compilation #question
Can Abstract Interpretation Become a Mainstream Compiler Technology? (LH), p. 395.
SAS-1997-Jones #abstract interpretation #overview #partial evaluation
Combining Abstract Interpretation and Partial Evaluation (Brief Overview) (NDJ), pp. 396–405.
SAS-1997-Ryder #analysis
Practical Compile-Time Analysis (BGR), pp. 406–412.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.