1226 search results - page 59 / 246 » Proofs, Programs and Abstract Complexity |
139
click to vote
CP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
146
click to vote
IFL
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
135
click to vote
CADE
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...
126
Voted
WOLLIC
2010
Springer
15 years 8 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
108
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...