1101 search results - page 206 / 221 » Forcing in proof theory |
139
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
138
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
167
Voted
VMCAI
2010
Springer
16 years 24 days ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
143
Voted
PLPV
2009
ACM
16 years 13 days ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
125
Voted
PEPM
2010
ACM
16 years 13 days ago
2010
ACM
PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Par...