1941 search results - page 236 / 389 » Reasoning about Computations Using Two-Levels of Logic |
132
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
142
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
146
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
135
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
125
click to vote
GIS
2010
ACM
15 years 2 months ago
2010
ACM
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...