888 search results - page 76 / 178 » The Power of Temporal Proofs |
220
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
192
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
166
click to vote
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
145
click to vote
RTA
2004
Springer
15 years 11 months ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
166
click to vote
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...