31 search results - page 2 / 7 » Strategy Parallelism in Automated Theorem Proving |
CL
2000
Springer
13 years 9 months ago
2000
Springer
The control in multi-strategy proof planning goes beyond the control in other automated theorem proving approaches: not only the selection of the inference and the facts for the n...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
CSL
2001
Springer
13 years 9 months ago
2001
Springer
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
ARTS
1999
Springer
13 years 9 months ago
1999
Springer
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
SIGSOFT
2003
ACM
14 years 6 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...