Symbolic execution of Reo circuits using constraint automata
DOI10.1016/j.scico.2011.04.001zbMath1242.68073OpenAlexW2009315879MaRDI QIDQ433344
Bahman Pourvatan, Farhad Arbab, Hossein Hojjat, Marjan Sirjani
Publication date: 13 July 2012
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2011.04.001
program verificationsymbolic executioncoordination languagesprogram validationReo constraint automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Symbolic model checking for channel-based component connectors
- Modeling component connectors in Reo by constraint automata
- Comparing Three Coordination Models: Reo, ARC, and RRD
- Symbolic execution of concurrent systems using Petri nets
- Verification of Context-Dependent Channel-Based Service Models
- Symbolic Execution Techniques for Test Purpose Definition
- Compositional Semantics of System-Level Designs Written in SystemC
- Symbolic execution and program testing
- Reo: a channel-based coordination model for component composition
- Formal ReSpecT
- Composition of Interacting Computations
- Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
- Generative communication in Linda
- Model Checking Software
- Derivatives of Regular Expressions
- Recent Trends in Algebraic Development Techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Symbolic execution of Reo circuits using constraint automata