1888 search results - page 92 / 378 » Proof theory and computational analysis |
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
JC
2008
15 years 14 days ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
102
click to vote
JUCS
2010
14 years 7 months ago
2010
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
119
Voted
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
122
click to vote
SAMOS
2009
Springer
15 years 7 months ago
2009
Springer
System-level computer architecture simulations create large volumes of simulation data to explore alternative architectural solutions. Interpreting and drawing conclusions from thi...