13383 search results - page 4 / 2677 » Abstractions from proofs |
TPHOL
2003
IEEE
14 years 26 days ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
JAR
2010
13 years 6 months ago
2010
Abstract. We present a declarative language inspired by the pseudonatural language used in Matita for the explanation of proof terms. We show how to compile the language to proof t...
IFL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...