Sciweavers

244 search results - page 43 / 49
» Contracts for first-class classes
Sort
View
BIRTHDAY
1992
Springer
13 years 12 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson
ECOOP
2010
Springer
13 years 11 months ago
Verifying Executable Object-Oriented Specifications with Separation Logic
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
Stephan van Staden, Cristiano Calcagno, Bertrand M...
GECON
2008
Springer
121views Business» more  GECON 2008»
13 years 8 months ago
Monitoring and Reputation Mechanisms for Service Level Agreements
A Service Level Agreement (SLA) is an electronic contract between a service user and a provider, and specifies the service to be provided, Quality of Service (QoS) properties that...
Omer F. Rana, Martijn Warnier, Thomas B. Quillinan...
AI
2010
Springer
13 years 7 months ago
Double preference relations for generalised belief change
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
Richard Booth, Samir Chopra, Thomas Meyer, Aditya ...
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 7 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger