103 search results - page 16 / 21 » Hypothetical Reasoning and Definitional Reflection in Logic ... |
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...