Analyzing pushdown systems with stack manipulation

DOI10.1016/J.IC.2017.12.003MaRDI QIDQ1706143zbMATH OpenOpenAlexFDO

Authors Fu Song

Publication date 21 March 2018

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2017.12.003

zbMATH Keywords

pushdown systemsreachability analysissoftware verificationBoolean programsaturation procedure

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
• Pushdown systems with stack manipulation
• Reachability analysis of pushdown systems with an upper stack
• Program Analysis Using Weighted Pushdown Systems
• On the analysis of interacting pushdown systems

Cites work

• scientific article; zbMATH DE number 1670555 (Why is no real title available?)
• scientific article; zbMATH DE number 1670767 (Why is no real title available?)
• scientific article; zbMATH DE number 1670780 (Why is no real title available?)
• scientific article; zbMATH DE number 1796143 (Why is no real title available?)
• scientific article; zbMATH DE number 1903366 (Why is no real title available?)
• scientific article; zbMATH DE number 2090847 (Why is no real title available?)
• scientific article; zbMATH DE number 2102748 (Why is no real title available?)
• scientific article; zbMATH DE number 2242594 (Why is no real title available?)
• A semantics-based approach to malware detection
• An automata-theoretic approach to infinite-state systems
• Analysis of recursively parallel programs
• CONCUR 2005 – Concurrency Theory
• Computer Aided Verification
• Computer Aided Verification
• Dense-timed pushdown automata
• Efficient CTL model-checking for pushdown systems
• Efficient CTL model-checking for pushdown systems
• Efficient malware detection using model-checking
• Introspective pushdown analysis of higher-order programs
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Model checking dynamic pushdown networks
• Model checking dynamic pushdown networks
• Nested timed automata
• On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
• Pushdown model checking for malware detection
• Pushdown systems with stack manipulation
• Reachability analysis of pushdown automata: Application to model-checking
• Reachability analysis of the HTML5 parser specification and its application to compatibility testing
• STACS 2005
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• Weighted Pushdown Systems with Indexed Weight Domains
• Weighted pushdown systems with indexed weight domains
• Well-structured pushdown system: case of dense timed pushdown automata
• Well-structured pushdown systems

Cited in

(4)

• Program Analysis Using Weighted Pushdown Systems
• Reachability analysis of pushdown systems with an upper stack
• Pushdown systems with stack manipulation
• Stack inspection

Describes a project that uses

Uses Software

• PuMoC
• Bebop
• SPIN

This page was built for publication: Analyzing pushdown systems with stack manipulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706143)