scientific article; zbMATH DE number 1324833

Hanne Riis Nielson, Flemming Nielson, Chris Hankin

Publication date: 18 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

abstract interpretation data flow analysis effect systems constraint based analysis

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01)

Related Items

An algebraic hardware/software partitioning algorithm, Safety and precision of spatial context models for autonomous systems, Neural software vulnerability analysis using rich intermediate graph representations of programs, Precise interprocedural dependence analysis of parallel programs, Model checking dynamic memory allocation in operating systems, Nesting analysis of mobile ambients, A tree-based approach to data flow proofs, On abstract interpretation of mobile ambients, Incremental Computation of Succinct Abstractions for Hybrid Systems, Introduction to Model Checking, Combining Model Checking and Data-Flow Analysis, Enforcing Programming Guidelines with Region Types and Effects, Multi-level Access Control, Directed Graphs and Partial Orders in Flow Control for Data Secrecy and Privacy, Higher-Order Model Checking in Direct Style, Accelerating program analyses in Datalog by merging library facts, Thread-modular analysis of release-acquire concurrency, Probabilistic Analysis of Programs: A Weak Limit Approach, Static Evidences for Attack Reconstruction, Why there is no general solution to the problem of software verification, Code analysis for temporal predictability, Relational string abstract domains, A flow-insensitive-complete program representation, Program verification with interacting analysis plugins, Type systems equivalent to data-flow analyses for imperative languages, A framework for security analysis of mobile wireless networks, Tool-assisted specification and verification of typed low-level languages, An integrated approach to high integrity software verification, Combining Predicate Abstraction with Fixpoint Approximations, Semantics of Probabilistic Programs: A Weak Limit Approach, Discretionary Information Flow Control for Interaction-Oriented Specifications, Finding suitable variability abstractions for lifted analysis, A Systematic Approach to Probabilistic Pointer Analysis, Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API, Application of static analyses for state-space reduction to the microcontroller binary code, An algebra of behavioural types, Inverse-limit and topological aspects of abstract interpretation, A unifying view on SMT-based software verification, Newton’s Method for ω-Continuous Semirings, Relational Analysis of Correlation, Deadlock checking by a behavioral effect system for lock handling, Static analysis of IMC, The untyped computational $\lambda $-calculus and its intersection type discipline, Unnamed Item, Polynomial function intervals for floating-point software verification, Derivation Tree Analysis for Accelerated Fixed-Point Computation, Formalizing Soundness of Contextual Effects, Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL, Galois Connections for Recursive Types, Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs, Unbounded procedure summaries from bounded environments, Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution, Non-repudiation analysis using \textsc{LySa} with annotations, Pathway analysis for BioAmbients, Program and proof optimizations with type systems, Time Stamps for Fixed-Point Approximation, Relational Analysis and Precision via Probabilistic Abstract Interpretation, Probabilistic Semantics and Program Analysis, Regular and context-free nominal traces, XML graphs in program analysis, Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi, Information flow security in boundary ambients, Probabilistic Confinement in a Declarative Framework, Derivation tree analysis for accelerated fixed-point computation, Abstractions of data types, Static analysis of topology-dependent broadcast networks, Measuring the confinement of probabilistic systems, Analysing input/output-capabilities of mobile processes with a generic type system, Widening and narrowing operators for abstract interpretation, Unnamed Item, A novel analysis space for pointer analysis and its application for bug finding, Demand-driven interprocedural analysis for map-based abstract domains, Abstracting Nash equilibria of supermodular games, From Proposition to Program, A Transformational Approach to Resource Analysis with Typed-norms Inference, Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, Interprocedural Analysis of Concurrent Programs Under a Context Bound, Abstract Interpretation From a Denotational-semantics Perspective, Partial predicate abstraction and counter-example guided refinement, Leveraging access mode declarations in a model for memory consistency in heterogeneous systems, Program Analysis Using Weighted Pushdown Systems, Constructive Galois Connections, Slicing communicating automata specifications: Polynomial algorithms for model reduction, Falsifying Safety Properties Through Games on Over-approximating Models, Template polyhedra and bilinear optimization, Cryptographic Analysis in Cubic Time, Rethinking arithmetic for deep neural networks, Extracting a data flow analyser in constructive logic, A Scalable Inclusion Constraint Solver Using Unification, Refinement of worst-case execution time bounds by graph pruning, Managing the granularity of constraint-based analyses by rule transformation., Static analysis for the $\pi$-calculus with applications to security, A general framework for types in graph rewriting, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations, Local higher-order fixpoint iteration, A multi-domain incremental analysis engine and its application to incremental resource analysis, On Probabilistic Techniques for Data Flow Analysis, Validating firewalls using flow logics, Using Template Haskell for Abstract Interpretation, Information flow for Algol-like languages, Distributed call-tracking for security, Software Model Checking for Mobile Security – Collusion Detection in $$\mathbb {K}$$K, Automating the functional correspondence between higher-order evaluators and abstract machines, Understanding algebraic effect handlers via delimited control operators, Fixpoint Theory -- Upside Down, Limits and difficulties in the design of under-approximation abstract domains, The role of abstraction in model checking, Decoupling the ascending and descending phases in abstract interpretation, Control-flow analysis of function calls and returns by abstract interpretation, Making abstract models complete, ICE-based refinement type discovery for higher-order functional programs