429 search results - page 38 / 86 » Theorem Proving Languages for Verification |
POPL
2012
ACM
12 years 4 months ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
LISP
2002
13 years 8 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
CSR
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
FMCAD
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...