293 search results - page 48 / 59 » Reasoning About States of Probabilistic Sequential Programs |
SCP
1998
13 years 7 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
ASM
2004
ASM
14 years 27 days ago
2004
ASM
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
TCAD
2010
13 years 2 months ago
2010
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...
SAS
1997
Springer
13 years 11 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...