1204 search results - page 147 / 241 » Termination of Polynomial Programs |
100
Voted
ENTCS
2008
15 years 22 days ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
74
Voted
ORL
2008
15 years 19 days ago
2008
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
93
Voted
PPL
2008
15 years 19 days ago
2008
Algorithmic skeletons intend to simplify parallel programming by providing a higher abstraction compared to the usual message passing. Task and data parallel skeletons can be dist...
106
click to vote
TASE
2008
IEEE
15 years 18 days 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...
108
Voted
CORR
2004
Springer
15 years 16 days 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...