1226 search results - page 55 / 246 » Proofs, Programs and Abstract Complexity |
141
click to vote
SAS
2010
Springer
15 years 1 months ago
2010
Springer
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
119
click to vote
HIPEAC
2005
Springer
15 years 8 months ago
2005
Springer
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper pre...
103
click to vote
TACS
1997
Springer
15 years 7 months ago
1997
Springer
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
117
click to vote
CIE
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
142
click to vote
FUIN
2008
15 years 3 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...