5377 search results - page 652 / 1076 » Programming Languages For Interactive Computing |
120
click to vote
ICALP
2007
Springer
16 years 14 days ago
2007
Springer
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
145
click to vote
ICALP
2007
Springer
16 years 14 days ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
137
click to vote
UM
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We present a study exploring the promise of developing computational systems to support the discovery and execution of opportunistic activities in mobile settings. We int...
181
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
189
Voted
CCS
2005
ACM
15 years 12 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...