1894 search results - page 23 / 379 » A TLA Proof System |
81
Voted
COCO
2004
Springer
15 years 6 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
123
Voted
CADE
1990
Springer
15 years 4 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
222
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
107
Voted
ENTCS
2011
14 years 7 months ago
2011
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
134
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...