136 search results - page 10 / 28 » An integrality theorem of root systems |
LOPSTR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We present an approach to a coherent program synthesis system which integrates a variety of interactively controlled and automated techniques from theorem proving and alg...
TACAS
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
IFM
2005
Springer
14 years 26 days ago
2005
Springer
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
FUIN
2006
13 years 7 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood ...