Sciweavers

215 search results - page 30 / 43
» State-Transition Computation Models and Program Correctness ...
Sort
View
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
PADL
2001
Springer
15 years 4 months ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
EDOC
2006
IEEE
15 years 3 months ago
Combining Analysis of Unstructured Workflows with Transformation to Structured Workflows
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...
Rainer Hauser, Michael Friess, Jochen Malte Kü...
FPCA
1995
15 years 3 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
CSE
2009
IEEE
15 years 3 months ago
Real Time Rectification for Stereo Correspondence
Duplicating the full dynamic capabilities of the human eye-brain combination is a difficult task but an important goal because of the wide application that a system which can acqu...
Khurram Jawed, John Morris, Tariq Khan, Georgy L. ...