888 search results - page 133 / 178 » The Power of Temporal Proofs |
182
click to vote
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
192
click to vote
FSTTCS
1999
Springer
15 years 10 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
138
click to vote
KBSE
1998
IEEE
15 years 10 months ago
1998
IEEE
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
141
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
168
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...