837 search results - page 51 / 168 » Proof Development with OMEGA |
POPL
2008
ACM
14 years 10 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
VSTTE
2005
Springer
14 years 3 months ago
2005
Springer
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying program...
MFCS
2004
Springer
14 years 3 months ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
AAAI
1998
13 years 11 months ago
1998
In this paper, we develop a formal methodology for verifying situated agents. The methodology consists of two elements, a specification language for specifying the agent capabilit...