1716 search results - page 200 / 344 » Proving Conditional Termination |
111
Voted
HASE
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
104
Voted
CVPR
1997
IEEE
15 years 5 months ago
1997
IEEE
As the field of view of a picture is much smaller than our own visual field of view, it is common to paste together several pictures to create a panoramic mosaic having a larger...
89
Voted
LICS
1992
IEEE
15 years 4 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...
112
click to vote
FM
2006
Springer
15 years 4 months ago
2006
Springer
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
112
Voted
JAC
2008
15 years 2 months ago
2008
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...