1101 search results - page 118 / 221 » Forcing in proof theory |
140
click to vote
ASE
2002
15 years 3 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
142
Voted
IANDC
2010
15 years 2 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
144
click to vote
POPL
2012
ACM
13 years 11 months ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
137
click to vote
ENTCS
2008
15 years 3 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
134
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...