232 search results - page 19 / 47 » Termination of linear bounded term rewriting systems |
FPGA
1999
ACM
13 years 12 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
JGO
2010
13 years 2 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper develops a novel robust control method for linear systems subject to additive and bounded disturbances. The approach is based on constraint tightening method. The pr...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...