| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465509503316 |
|
|
Titolo |
Static Analysis [[electronic resource] ] : 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002. Proceedings / / edited by Manuel Hermenegildo, German Puebla |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2002.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 536 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 2477 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Database management |
Programming languages (Electronic computers) |
Computer logic |
Software engineering |
Mathematical logic |
Computer programming |
Database Management |
Programming Languages, Compilers, Interpreters |
Logics and Meanings of Programs |
Software Engineering |
Mathematical Logic and Formal Languages |
Programming Techniques |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
| |