1 option
Static Analysis : 7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 6, 2000, Proceedings / edited by Jens Palsberg.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1824.
- Lecture Notes in Computer Science, 0302-9743 ; 1824
- Language:
- English
- Subjects (All):
- Programming languages (Electronic computers).
- Computer logic.
- Computer programming.
- Logic, Symbolic and mathematical.
- Software engineering.
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Local Subjects:
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Physical Description:
- 1 online resource (VIII, 433 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- Contents:
- Invited Papers
- Enforcing Design Constraints with Object Logic
- Model Checking as Constraint Solving
- Contributed Papers
- Abstract Interpretation Based Semantics of Sequent Calculi
- A Transformational Approach for Generating Non-linear Invariants
- Deriving Parallel Codes via Invariants
- Safety of Strictness Analysis via Term Graph Rewriting
- Checking Cleanness in Linked Lists
- Confidentiality Analysis of Mobile Systems
- Unified Analysis of Array and Object References in Strongly Typed Languages
- Polymorphic versus Monomorphic Flow-Insensitive Points-To Analysis for C
- Efficient Inference of Static Types for Java Bytecode
- Abstract Interpretation of Game Properties
- FULLDOC: A Full Reporting Debugger for Optimized Code
- Partial Redundancy Elimination on Predicated Code
- TVLA: A System for Implementing Static Analyses
- Tree Schemata and Fair Termination
- Abstract Interpretation of Probabilistic Semantics
- Code Specialization Based on Value Profiles
- Flattening Is an Improvement
- Model Checking Guided Abstraction and Analysis
- Abstract Domains for Sharing Analysis by Optimal Semantics
- Concurrency Analysis for Java.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45099-3
- 9783540450993
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.