425 search results - page 25 / 85 » The TPS Theorem Proving System |
169
click to vote
EJC
2002
15 years 5 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
185
click to vote
TAP
2010
Springer
15 years 3 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
128
click to vote
CIE
2007
Springer
16 years 1 days ago
2007
Springer
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
149
click to vote
MKM
2007
Springer
15 years 12 months ago
2007
Springer
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
159
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...