Sciweavers

2343 search results - page 199 / 469
» Structure and Interpretation of Computer Programs
Sort
View
SPIN
2010
Springer
15 years 4 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
HOPL
2007
15 years 10 months ago
The development of the Emerald programming language
Emerald is an object-based programming language and system designed and implemented in the Department of Computer Science at the University of Washington in the early and mid-1980...
Andrew P. Black, Norman C. Hutchinson, Eric Jul, H...
123
Voted
INFSOF
2006
73views more  INFSOF 2006»
15 years 6 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
EMSOFT
2003
Springer
15 years 11 months ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
ECAI
2006
Springer
15 years 10 months ago
Logic Programs with Multiple Chances
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
Francesco Buccafurri, Gianluca Caminiti, Domenico ...