The following pages link to (Q4255591):
Displaying 50 items.
- Safety and precision of spatial context models for autonomous systems (Q271722) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Deadlock checking by a behavioral effect system for lock handling (Q444480) (← links)
- Static analysis of IMC (Q444504) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (Q507359) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- XML graphs in program analysis (Q532414) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API (Q617917) (← links)
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- Model checking dynamic memory allocation in operating systems (Q835783) (← links)
- Code analysis for temporal predictability (Q853616) (← links)
- Type systems equivalent to data-flow analyses for imperative languages (Q860844) (← links)
- A framework for security analysis of mobile wireless networks (Q860908) (← links)
- Tool-assisted specification and verification of typed low-level languages (Q861687) (← links)
- An integrated approach to high integrity software verification (Q861714) (← links)
- Pathway analysis for BioAmbients (Q953532) (← links)
- Program and proof optimizations with type systems (Q953533) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- A novel analysis space for pointer analysis and its application for bug finding (Q988180) (← links)
- Slicing communicating automata specifications: Polynomial algorithms for model reduction (Q1019005) (← links)
- An approach to analyzing the properties of programs (Q1103383) (← links)
- Advanced symbolic analysis for compilers. New techniques and algorithms for symbolic program analysis and optimization. (Q1396163) (← links)
- Validating firewalls using flow logics (Q1603656) (← links)
- An algebraic hardware/software partitioning algorithm (Q1613267) (← links)
- A tree-based approach to data flow proofs (Q1629956) (← links)
- A unifying view on SMT-based software verification (Q1703012) (← links)
- Non-repudiation analysis using \textsc{LySa} with annotations (Q1749255) (← links)
- Analysing input/output-capabilities of mobile processes with a generic type system (Q1772312) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Introduction to set constraint-based program analysis (Q1818069) (← links)
- Managing the granularity of constraint-based analyses by rule transformation. (Q1853047) (← links)
- Static analysis for the \(\pi\)-calculus with applications to security (Q1854437) (← links)
- Program analysis tools (Q1856179) (← links)
- PAG -- an efficient program analyzer generator (Q1856182) (← links)
- Information flow for Algol-like languages (Q1869976) (← links)
- Distributed call-tracking for security (Q1869981) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Nesting analysis of mobile ambients (Q1886451) (← links)
- On abstract interpretation of mobile ambients (Q1887169) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- Neural software vulnerability analysis using rich intermediate graph representations of programs (Q2123552) (← links)
- Accelerating program analyses in Datalog by merging library facts (Q2145320) (← links)
- Thread-modular analysis of release-acquire concurrency (Q2145344) (← links)
- Why there is no general solution to the problem of software verification (Q2151520) (← links)
- Relational string abstract domains (Q2152641) (← links)
