438 search results - page 74 / 88 » On theorem proving in annotated logics |
173
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
ICTAC
2010
Springer
14 years 7 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
ML
2007
ACM
14 years 9 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...