116
click to vote
CADE
16 years 9 days ago
2004 Springer 
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
112
click to vote
CADE
16 years 9 days ago
2004 Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
110
click to vote
CADE
16 years 9 days ago
2004 Springer
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...
108
click to vote
CADE
15 years 5 months ago
2004 Springer 
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
107
click to vote
CADE
16 years 9 days ago
2004 Springer
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
|
Logical Reasoning