429 search results - page 6 / 86 » Theorem Proving Languages for Verification |
POPL
2007
ACM
14 years 8 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
FASE
2000
Springer
14 years 5 days ago
2000
Springer
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...
CADE
1998
Springer
14 years 24 days ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
SPC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
EACL
1989
ACL Anthology
13 years 9 months ago
1989
ACL Anthology
CT Feature Unification can be integrated with Lambek Theorem Proving in a simple and straightforward way. Two principles determine all distribution of features in LTP. It is not ne...