scientific article; zbMATH DE number 1324833
From MaRDI portal
Publication:4255591
Recommendations
- scientific article; zbMATH DE number 2161330
- Analyzing program analyses
- An approach to analyzing the properties of programs
- Analysis of programs and binary relations
- Proof-Producing Program Analysis
- Program analysis tools
- Recent progress in program analysis
- scientific article; zbMATH DE number 2243645
- Iterative-free program analysis
Cited in
(only showing first 100 items - show all)- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- An approach to analyzing the properties of programs
- Advanced symbolic analysis for compilers. New techniques and algorithms for symbolic program analysis and optimization.
- Validating firewalls using flow logics
- An algebraic hardware/software partitioning algorithm
- A tree-based approach to data flow proofs
- A unifying view on SMT-based software verification
- Non-repudiation analysis using \textsc{LySa} with annotations
- Analysing input/output-capabilities of mobile processes with a generic type system
- Demand-driven interprocedural analysis for map-based abstract domains
- Abstracting Nash equilibria of supermodular games
- Managing the granularity of constraint-based analyses by rule transformation.
- Static analysis for the \(\pi\)-calculus with applications to security
- Program analysis tools
- PAG -- an efficient program analyzer generator
- Information flow for Algol-like languages
- Distributed call-tracking for security
- Precise interprocedural dependence analysis of parallel programs
- Nesting analysis of mobile ambients
- On abstract interpretation of mobile ambients
- Local higher-order fixpoint iteration
- Neural software vulnerability analysis using rich intermediate graph representations of programs
- Accelerating program analyses in Datalog by merging library facts
- Thread-modular analysis of release-acquire concurrency
- Why there is no general solution to the problem of software verification
- Relational string abstract domains
- A flow-insensitive-complete program representation
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Unbounded procedure summaries from bounded environments
- Static analysis of topology-dependent broadcast networks
- Widening and narrowing operators for abstract interpretation
- Partial predicate abstraction and counter-example guided refinement
- Leveraging access mode declarations in a model for memory consistency in heterogeneous systems
- Template polyhedra and bilinear optimization
- Refinement of worst-case execution time bounds by graph pruning
- A multi-domain incremental analysis engine and its application to incremental resource analysis
- Cooperative bug isolation. Winning thesis of the 2005 ACM doctoral dissertation competition.
- Finding suitable variability abstractions for lifted analysis
- Information flow security in boundary ambients
- Abstractions of data types
- Extracting a data flow analyser in constructive logic
- A general framework for types in graph rewriting
- Program verification with interacting analysis plugins
- Safety and precision of spatial context models for autonomous systems
- From proposition to program. Embedding the refinement calculus in Coq
- Abstract interpretation from a denotational-semantics perspective
- Cryptographic analysis in cubic time
- Formal semantics for program paths
- Flow analytic type system for array bound checks
- On probabilistic techniques for data flow analysis
- Using Template Haskell for abstract interpretation
- Semantics of probabilistic programs: a weak limit approach
- Discretionary Information Flow Control for Interaction-Oriented Specifications
- Static analysis of run-time errors in embedded critical parallel C programs
- Static analysis of PostScript code
- Incremental computation of succinct abstractions for hybrid systems
- Introduction to model checking
- Combining model checking and data-flow analysis
- Higher-order model checking in direct style
- Galois Connections for Recursive Types
- scientific article; zbMATH DE number 3874581 (Why is no real title available?)
- Probabilistic analysis of programs: a weak limit approach
- Static evidences for attack reconstruction
- A Systematic Approach to Probabilistic Pointer Analysis
- Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
- Newton’s Method for ω-Continuous Semirings
- Relational Analysis of Correlation
- 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
- Probabilistic semantics and program analysis
- Types from Control Flow Analysis
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
- Data Flow Analysis
- An algebra of behavioural types
- Inverse-limit and topological aspects of abstract interpretation
- scientific article; zbMATH DE number 1203405 (Why is no real title available?)
- Program-Conflict-Analysis
- Deadlock checking by a behavioral effect system for lock handling
- Static analysis of IMC
- scientific article; zbMATH DE number 2043530 (Why is no real title available?)
- Combining Predicate Abstraction with Fixpoint Approximations
- Polynomial function intervals for floating-point software verification
- scientific article; zbMATH DE number 2087567 (Why is no real title available?)
- scientific article; zbMATH DE number 1878556 (Why is no real title available?)
- Elimination Techniques for Program Analysis
- Time stamps for fixed-point approximation
- Probabilistic confinement in a declarative framework
- scientific article; zbMATH DE number 1456967 (Why is no real title available?)
- A transformational approach to resource analysis with typed-norms inference
- Constructive Galois connections
- Falsifying safety properties through games on over-approximating models
- Rethinking arithmetic for deep neural networks
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- Semantics-directed program analysis: a tool-maker's perspective
- 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
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- Can you trust your data?
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255591)
