438 search results - page 78 / 88 » On theorem proving in annotated logics |
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
75
Voted
ATAL
2009
Springer
15 years 2 months ago
2009
Springer
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
103
click to vote
TPCD
1994
14 years 11 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
107
click to vote
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
105
click to vote
KBSE
2000
IEEE
15 years 1 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...