Constraint-based reachability

MaRDI QIDQ3388708zbMATH OpenFDO

Authors Arnaud Gotlieb, Tristan Denmat, Nadjib Lazaar

Publication date 6 May 2021

Full work available at URL https://arxiv.org/abs/1302.3290, http://eptcs.web.cse.unsw.edu.au/paper.cgi?Infinity2012.4

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Reachability analysis of synchronized PA systems
• Constrained Reachability of Process Rewrite Systems
• Improving reachability analysis of infinite state systems by specialization
• On Bounded Reachability of Programs with Set Comprehensions
• Improving reachability analysis of infinite state systems by specialization

Cited in

(5)

• Reachability analysis of program variables
• scientific article; zbMATH DE number 1799527 (Why is no real title available?)
• Theoretical Computer Science
• Deterministic enforcement of constraints
• Constraint preservation through loops

This page was built for publication: Constraint-based reachability

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