6274 search results - page 249 / 1255 » Proofs, Programs, Processes |
153
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
158
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
152
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
275
click to vote
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
160
click to vote
LICS
2006
IEEE
16 years 16 days ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...