FEEDBACK Smiley face
Normal view MARC view ISBD view

Static Analysis [electronic resource] :5th International Symposium, SAS’98 Pisa, Italy, September 14–16, 1998 Proceedings /

Contributor(s): Levi, Giorgio [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 1503Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1998.Description: X, 394 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540497271.Subject(s): Computer science | Software engineering | Computer programming | Programming languages (Electronic computers) | Computers | Computer logic | Computer Science | Theory of Computation | Software Engineering/Programming and Operating Systems | Logics and Meanings of Programs | Programming Techniques | Programming Languages, Compilers, Interpreters | Software EngineeringOnline resources: Click here to access online
Contents:
Data-Flow Analysis -- Bidirectional Data Flow Analysis in Code Motion: Myth and Reality -- On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines -- Enabling Sparse Constant Propagation of Array Elements via Array SSA Form -- Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyses -- Logic Programming -- Analysis of Normal Logic Programs -- The Correctness of Set-Sharing -- Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing -- Concurrency -- A Symbolic Semantics for Abstract Model Checking -- Automatic Determination of Communication Topologies in Mobile Systems -- Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation -- Abstract Domains -- A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs -- Refining Static Analyses by Trace-Based Partitioning Using Control Flow -- Building Complete Abstract Interpretations in a Linear Logic-Based Setting -- Partial Evaluation -- On the Power of Homeomorphic Embedding for Online Termination -- Analysis of Imperative Programs through Analysis of Constraint Logic Programs -- Improving Control in Functional Logic Program Specialization -- Type Inference -- Directional Type Inference for Logic Programs -- Finite Subtype Inference with Explicit Polymorphism -- Optimization -- Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis -- A New Solution to the Hidden Copy Problem -- Tutorials -- A Tutorial on Domain Theory in Abstract Interpretation -- Program Analysis as Model Checking of Abstract Interpretations -- Invited Talks -- Certifying, Optimizing Compilation.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Data-Flow Analysis -- Bidirectional Data Flow Analysis in Code Motion: Myth and Reality -- On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines -- Enabling Sparse Constant Propagation of Array Elements via Array SSA Form -- Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyses -- Logic Programming -- Analysis of Normal Logic Programs -- The Correctness of Set-Sharing -- Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing -- Concurrency -- A Symbolic Semantics for Abstract Model Checking -- Automatic Determination of Communication Topologies in Mobile Systems -- Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation -- Abstract Domains -- A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs -- Refining Static Analyses by Trace-Based Partitioning Using Control Flow -- Building Complete Abstract Interpretations in a Linear Logic-Based Setting -- Partial Evaluation -- On the Power of Homeomorphic Embedding for Online Termination -- Analysis of Imperative Programs through Analysis of Constraint Logic Programs -- Improving Control in Functional Logic Program Specialization -- Type Inference -- Directional Type Inference for Logic Programs -- Finite Subtype Inference with Explicit Polymorphism -- Optimization -- Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis -- A New Solution to the Hidden Copy Problem -- Tutorials -- A Tutorial on Domain Theory in Abstract Interpretation -- Program Analysis as Model Checking of Abstract Interpretations -- Invited Talks -- Certifying, Optimizing Compilation.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in