Static analysis : 9th International Symposium, SAS 2002, Madrid, Spain, September 17 20, 2002 : roceedings
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
2477 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Static analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, proceedings, Manuel V. Hermenegildo, Germán Puebla, (eds.), Berlin, Springer, 2002, 1 vol. (XI-525 p.), Lecture notes in computer science, 3-540-44235-9 • Static Analysis, Texte imprimé, 9783662197905 |
Sisällysluettelo:
- Static Program Analysis via 3-Valued Logic
- Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges
- An Algebraic Approach to the Static Analysis of Concurrent Software
- Polynomial Constants Are Decidable
- Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
- Nonuniform Alias Analysis of Recursive Data Structures and Arrays
- Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes
- Automated Verification of Concurrent Linked Lists with Counters
- Backward Type Inference Generalises Type Checking
- More Precise Yet Efficient Type Inference for Logic Programs
- A Few Graph-Based Relational Numerical Abstract Domains
- Static Analysis of the Numerical Stability of Loops
- On Termination of Logic Programs with Floating Point Computations
- Modular Control Flow Analysis for Libraries
- An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
- Compactly Representing First-Order Structures for Static Analysis
- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
- Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis
- Improving the Precision of Equality-Based Dataflow Analyses
- Guaranteed Optimization: Proving Nullspace Properties of Compilers
- Representation Analysis for Coercion Placement
- Pipeline Modeling for Timing Analysis
- Analysing Approximate Confinement under Uniform Attacks
- An Improved Constraint-Based System for the Verification of Security Protocols
- From Secrecy to Authenticity in Security Protocols
- Security Typings by Abstract Interpretation
- Static Confidentiality Enforcement for Distributed Programs
- Refinement of LTL Formulas for Abstract Model Checking
- Making Abstract Model Checking Strongly Preserving
- Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties
- Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation
- States vs. Traces in Model Checking by Abstract Interpretation
- Reuse of Results in Termination Analysis of Typed Logic Programs
- Finiteness Analysis in Polynomial Time
- Detecting Optimal Termination Conditions of Logic Programs.