975 resultados para COMPUTER SCIENCE, THEORY


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Illustrations, p. 30-52, numbered as leaves.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Bibliography: p. 7-9.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Bibliography: p. 141-143.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Originally presented as the author's thesis (M.A.), University of Illinois at Urbana-Champaign.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We provide an abstract command language for real-time programs and outline how a partial correctness semantics can be used to compute execution times. The notions of a timed command, refinement of a timed command, the command traversal condition, and the worst-case and best-case execution time of a command are formally introduced and investigated with the help of an underlying weakest liberal precondition semantics. The central result is a theory for the computation of worst-case and best-case execution times from the underlying semantics based on supremum and infimum calculations. The framework is applied to the analysis of a message transmitter program and its implementation. (c) 2005 Elsevier B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Main styles, or paradigms of programming â imperative, functional, logic, and object-oriented â are shortly described and compared, and corresponding programming techniques are outlined. Programming languages are classified in accordance with the main style and techniques supported. It is argued that profound education in computer science should include learning base programming techniques of all main programming paradigms.