Automated analysis of Reo circuits using symbolic execution

zbMATH Open1364.68142MaRDI QIDQ2989005FDOQ2989005

Authors: Bahman Pourvatan, Marjan Sirjani, Hossein Hojjat, Farhad Arbab 

Publication date: 19 May 2017

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066109004496?np=y

Recommendations

• Symbolic execution of Reo circuits using constraint automata
• Modeling component connectors in Reo by constraint automata
• Modeling dynamic reconfigurations in Reo using high-level replacement systems
• Automata based model checking for Reo connectors
• Compositional failure-based equivalence of constraint automata

zbMATH Keywords

program verificationReosymbolic executioncoordination languagesconstraint automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cited In (2)

• Symbolic execution of Reo circuits using constraint automata
• ReLo: a Dynamic Logic to Reason About Reo Circuits

Uses Software

• Reo

This page was built for publication: Automated analysis of Reo circuits using symbolic execution

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