211 search results - page 31 / 43 » On the Proof Theory of the Existence Predicate |
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
EGOV
2007
Springer
14 years 2 months ago
2007
Springer
The EU is currently modernizing customs legislation and practices. Main pillars in the new vision are an intensive use of IT (Customs becomes eCustoms), partnerships between Custom...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
SPIN
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
JCT
1998
13 years 8 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...