We present a technique for increasing the throughput of stream processing architectures by removing the bottlenecks caused by loop structures. We implement loops as self-timed pip...
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokol...
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
SOFL is a formal language and method for software system analysis, specification and design and it fully supports structured techniques and object-oriented techniques. AOP (Aspect...
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...