Formal hardware verification by symbolic ternary trajectory evaluation
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Formal verification of content addressable memories using symbolic trajectory evaluation
DAC '97 Proceedings of the 34th annual Design Automation Conference
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Symbolic execution and program testing
Communications of the ACM
Validation of Concurrent ADA Programs using Symbolic Execution
ESEC '89 Proceedings of the 2nd European Software Engineering Conference
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
Automatically Generating Malicious Disks using Symbolic Execution
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
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)
Combining symbolic execution with model checking to verify parallel numerical programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
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
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
An industrially effective environment for formal hardware verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
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 Constraint Automata and more specifically exploiting their data constraints. This technique enables us to obtain the relations among the data passing through different nodes in a circuit and also infer coordination patterns. As an alternative to constructing the symbolic execution tree, we propose an algorithm similar to the algorithms used for converting deterministic finite automata to regular expressions. Our technique can be used for analyzing data-dominated systems whereas the model checking approach is best suited for the study of control-dominated applications. Deadlocks, which may involve data values, can also be checked. We illustrate the technique on a set of data dominated circuits as well as a non-trivial critical section problem. A tool is implemented to automate the proposed technique.