349 search results - page 68 / 70 » The Finite and the Infinite |
115
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
97
Voted
JUCS
2008
15 years 9 days ago
2008
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
90
Voted
AIS
2000
Springer
15 years 6 days ago
2000
Springer
The expression 'nature of the artificial' can be understood in (at least) two distinct, yet possibly related, senses as denoting (i) the essence (or whatness) of the art...
114
Voted
CORR
2008
Springer
15 years 13 days ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
212
click to vote
POPL
2008
ACM
16 years 20 days ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...