240 search results - page 11 / 48 » Infinite trace equivalence |
113
click to vote
FOSSACS
2010
Springer
15 years 5 months ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
113
click to vote
EMNLP
2009
14 years 11 months ago
2009
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
142
Voted
TPHOL
2009
IEEE
15 years 8 months ago
2009
IEEE
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...
LICS
1992
IEEE
15 years 6 months ago
1992
IEEE
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
114
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...