4617 search results - page 906 / 924 » Automation of Diagrammatic Reasoning |
VMCAI
2007
Springer
15 years 8 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
102
click to vote
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Manual debugging is expensive. And the high cost has motivated extensive research on automated fault localization in both software engineering and data mining communities. Fault l...
117
click to vote
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
149
Voted
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
86
Voted
TPHOL
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract. We compare the styles of several proof assistants for mathematics. We present Pythagoras’ proof of the irrationality of √ 2 both informal and formalized in (1) HOL, (...