1128 search results - page 15 / 226 » Little Engines of Proof |
SEMWEB
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Justifications -- that is, minimal entailing subsets of an ontology -- are currently the dominant form of explanation provided by ontology engineering environments, espec...
102
click to vote
ITP
2010
14 years 11 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
TSE
2010
14 years 7 months ago
2010
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
108
click to vote
PEPM
2010
ACM
14 years 11 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...