Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization

DOI10.1007/978-3-662-54434-1_33zbMath1485.68075OpenAlexW2596236679MaRDI QIDQ2988672

No author found.

Publication date: 19 May 2017

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54434-1_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Accelerating program analyses in Datalog by merging library facts

Uses Software

• LOCKSMITH
• SPECjvm2008
• SPEC Benchmarks
• Angelic Verification

Cites Work

• Precise interprocedural dataflow analysis with applications to constant propagation
• The dependence condition graph: precise conditions for dependence between program points
• Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
• Specification Inference Using Context-Free Language Reachability
• Automated Inference of Library Specifications for Source-Sink Property Verification
• Conditional must not aliasing for static race detection
• Existential Label Flow Inference Via CFL Reachability
• Precise interprocedural dataflow analysis with applications to constant propagation
• Type-base flow analysis
• Context-sensitive data-dependence analysis via linear conjunctive language reachability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization