13383 search results - page 258 / 2677 » Abstractions from proofs |
194
click to vote
JACM
2002
15 years 6 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
146
click to vote
JAT
2011
15 years 1 months ago
2011
We prove that there exists a weakly closed and bounded subset E of c0 which is not remotal from 0, and such that co (E) is remotal from 0. This answers a question of M. Mart´ın ...
202
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
175
click to vote
DRM
2007
Springer
16 years 25 days ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
145
click to vote
AISC
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...