632 search results - page 21 / 127 » Combining programming with theorem proving |
TAPSOFT
1991
Springer
13 years 11 months ago
1991
Springer
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
ICALP
2003
Springer
14 years 29 days ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
IGPL
2008
13 years 7 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...