1147 search results - page 145 / 230 » Termination in language-based systems |
162
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
149
click to vote
JAPLL
2007
15 years 6 months ago
2007
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
170
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
146
click to vote
ENTCS
2000
15 years 6 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
181
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...