1581 search results - page 91 / 317 » Mechanizing Inductive Reasoning |
190
click to vote
WEBI
2010
Springer
15 years 4 months ago
2010
Springer
In recent years, there has been an explosion of publicly available RDF and OWL web pages. Some of these pages are static text files, while others are dynamically generated from la...
168
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
169
click to vote
TPHOL
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
177
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
167
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....