1763 search results - page 147 / 353 » A Formalization of Polytime Functions |
157
Voted
TYPES
1994
Springer
15 years 8 months ago
1994
Springer
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
143
click to vote
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
132
click to vote
SAS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract We carry out an experimental analysis for two of the design dimensions of flow-insensitive points-to analysis for C: polymorphic versus monomorphic and equality-based vers...
130
click to vote
JUCS
2007
15 years 3 months ago
2007
: Nowadays, software evolution is a very hot topic. It is particularly complex when it regards critical and nonstopping systems. Usually, these situations are tackled by hard-codin...
111
click to vote
APAL
2004
15 years 3 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...