1226 search results - page 8 / 246 » Proofs, Programs and Abstract Complexity |
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
89
Voted
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
CAV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
106
click to vote
SAS
2012
Springer
12 years 12 months ago
2012
Springer
Abstract. Shivers’s escape technique enables one to analyse the control flow of higher-order program fragments. It is widely used, but its soundness has never been proven. In th...