207 search results - page 5 / 42 » Proof Systems and Transformation Games |
90
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
108
click to vote
QEST
2006
IEEE
15 years 5 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
ACMACE
2005
ACM
15 years 1 months ago
2005
ACM
Trans-reality games are games that take advantage of pervasive, mobile, ubiquitous, location-based and mixed reality technical infrastructures to create game spaces that can inclu...
JIIS
2008
14 years 11 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
JLP
2008
14 years 11 months ago
2008
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...