11716 search results - page 361 / 2344 » Computable symbolic dynamics |
197
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
177
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
158
click to vote
STACS
2007
Springer
16 years 27 days ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
149
click to vote
DAC
1998
ACM
15 years 11 months ago
1998
ACM
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
168
Voted
HOA
1993
15 years 11 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...