Sciweavers

4940 search results - page 762 / 988
» On the Complexity of Universal Programs
Sort
View
CONCUR
2011
Springer
14 years 6 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 18 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
LCPC
2005
Springer
15 years 12 months ago
Manipulating MAXLIVE for Spill-Free Register Allocation
Abstract. Many embedded systems use single-chip microcontrollers which have no on-chip RAM. In such a system, the processor registers must hold all live data values. Nanocontroller...
Shashi Deepa Arcot, Henry G. Dietz, Sarojini Priya...
HICSS
2003
IEEE
110views Biometrics» more  HICSS 2003»
15 years 11 months ago
Modeling Web Applications Using Java and XML Related Technologies
The purpose of this paper is to propose visual models for a web application using Java and XML related technologies. We consider a web application that uses 3tier architecture and...
Sam Chung, Yun Sik Lee
COMPGEOM
2010
ACM
15 years 11 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...