297 search results - page 33 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
135
click to vote
WOODPECKER
2001
15 years 2 months ago
2001
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...
129
click to vote
ENTCS
2006
15 years 1 months ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
110
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
122
click to vote
PPDP
2007
Springer
15 years 7 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
126
click to vote
TPHOL
2005
IEEE
15 years 6 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...