220 search results - page 31 / 44 » Coq Modulo Theory |
MLQ
2010
14 years 8 months ago
2010
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
117
click to vote
PTS
2010
14 years 7 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
CADE
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically s...
171
click to vote
CADE
2011
Springer
13 years 9 months ago
2011
Springer
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...