Automated Analysis of Reo Circuits using Symbolic Execution

Designing FPGA Circuits in Lava

This paper explores the potential of the lazy functional programming language Haskell for the specification, synthesis and verification of digital circuits. Circuits are described using combinators that combine behaviour (allowing circuit simulation, symbolic evaluation and partial evaluation) and layout (allowing the generation of output suitable for entry into VLSI CAD tools). We call the sof...

Dynamic Symbolic Execution using Eclipse CDT

Finding software bugs before deployment is essential to achieve software safety and security. The achievable code coverage and input coverage with manual test suite development at reasonable cost is limited. Therefore, complementary automated methods for bug detection are of interest. This paper describes automated context-sensitive detection of software bugs with dynamic symbolic execution. Th...

Automated Mapping of Reo Circuits to Constraint Automata

A tool is developed in order to input Reo circuits and generate their corresponding constraint automata. The XML schemas for input and output are presented which establish a common interface for generating an integrated set of tools. Two heuristics in joining constraint automata are presented and experimental results are shown.

Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution

Checking Equivalence for Reo Networks

Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper addresses the problem of checking equivalence of two Reo networks. We present a compositional approach for the generation of a symbolic representation of co...