Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Handbook of theoretical computer science (vol. B)
Formal hardware verification by symbolic ternary trajectory evaluation
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Formal verification of content addressable memories using symbolic trajectory evaluation
DAC '97 Proceedings of the 34th annual Design Automation Conference
Tuple centres for the coordination of Internet agents
Proceedings of the 1999 ACM symposium on Applied computing
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Model checking
Symbolic execution and program testing
Communications of the ACM
Symbolic Model Checking
Validation of Concurrent ADA Programs using Symbolic Execution
ESEC '89 Proceedings of the 2nd European Software Engineering Conference
Semantic Models for Distributed Object Reflection
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
A Group Based Approach for Coordinating Active Objects
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Modeling Behavior in Compositions of Software Architectural Primitives
Proceedings of the 19th IEEE international conference on Automated software engineering
Path-Oriented Test Data Generation Using Symbolic Execution and Constraint Solving Techniques
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Web services choreography and orchestration in Reo and constraint automata
Proceedings of the 2007 ACM symposium on Applied computing
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal ReSpecT in the A&A Perspective
Electronic Notes in Theoretical Computer Science (ENTCS)
A System to Generate Test Data and Symbolically Execute Programs
IEEE Transactions on Software Engineering
The Calculus of Computation: Decision Procedures with Applications to Verification
The Calculus of Computation: Decision Procedures with Applications to Verification
Combining symbolic execution with model checking to verify parallel numerical programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Comparing Three Coordination Models: Reo, ARC, and RRD
Electronic Notes in Theoretical Computer Science (ENTCS)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Constraint Solving and Symbolic Execution
Verified Software: Theories, Tools, Experiments
Using Reo for Service Coordination
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
ReoService: Coordination Modeling Tool
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Synthesis of Connectors from Scenario-Based Interaction Specifications
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
QoS Aspects in Web Services Compositions
SOSE '08 Proceedings of the 2008 IEEE International Symposium on Service-Oriented System Engineering
Symbolic execution with abstraction
International Journal on Software Tools for Technology Transfer (STTT)
Reo Connectors as Coordination Artifacts in 2APL Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Applying Reo to service coordination in long-running business transactions
Proceedings of the 2009 ACM symposium on Applied Computing
Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
Electronic Notes in Theoretical Computer Science (ENTCS)
A Uniform Framework for Modeling and Verifying Components and Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Automated Analysis of Reo Circuits using Symbolic Execution
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics and Analysis of Component Connectors in Reo
Electronic Notes in Theoretical Computer Science (ENTCS)
Generalized symbolic execution for model checking and testing
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Data-aware design and verification of service compositions with Reo and mCRL2
Proceedings of the 2010 ACM Symposium on Applied Computing
Compositional semantics of system-level designs written in systemC
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Modeling web service interactions using the coordination language Reo
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Time and Data-Aware Analysis of Graphical Service Models in Reo
SEFM '10 Proceedings of the 2010 8th IEEE International Conference on Software Engineering and Formal Methods
Verification of context-dependent channel-based service models
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Modelling coordination in biological systems
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Symbolic execution techniques for test purpose definition
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Coordination systems in role-based adaptive software
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Actors, roles and coordinators — a coordination model for open distributed and embedded systems
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Compositional semantics of an actor-based language using constraint automata
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
An industrially effective environment for formal hardware verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the relations among the data that pass through different nodes in a circuit from which we infer the coordination patterns of the circuit. Deadlocks, which may involve data values, can also be checked using reachability analysis. As an alternative to constructing the symbolic execution tree, we use regular expressions and their derivatives which we obtain from our deterministic finite automata. We show that there is an upper bound of one for unfolding the cycles in constraint automata which is enough to reveal the relations between symbolic representations of inputs and outputs. In the presence of feedback in a Reo circuit a number of substitutions are necessary to make the relationship between successive input/output values explicit. The number of these substitutions depends on the number of buffers in the Reo circuit, and can be found by static analysis. We illustrate our technique on a set of Reo circuits to show the extracted relations between inputs and outputs. We have implemented a tool to automate our proposed technique.