3228 search results - page 401 / 646 » Computationally Sound Proofs |
177
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
182
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
142
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
184
click to vote
PARLE
1987
15 years 10 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
172
click to vote
ASM
2008
ASM
15 years 8 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...