Sciweavers

240 search results - page 11 / 48
» Infinite trace equivalence
Sort
View
FOSSACS
2010
Springer
13 years 12 months ago
Untyped Recursion Schemes and Infinite Intersection Types
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 ...
Takeshi Tsukada, Naoki Kobayashi
EMNLP
2009
13 years 6 months ago
The infinite HMM for unsupervised PoS tagging
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...
Jurgen Van Gael, Andreas Vlachos, Zoubin Ghahraman...
TPHOL
2009
IEEE
14 years 3 months ago
Trace-Based Coinductive Operational Semantics for While
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...
Keiko Nakata, Tarmo Uustalu
LICS
1992
IEEE
14 years 22 days ago
Equivalences on Observable Processes
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...
Irek Ulidowski
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 3 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
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...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...