Sciweavers

7961 search results - page 147 / 1593
» Input-Output Model Programs
Sort
View
LOPSTR
2009
Springer
15 years 9 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
97
Voted
LCPC
1993
Springer
15 years 7 months ago
Event-based Composition of Concurrent Programs
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
Raju Pandey, James C. Browne
PPDP
2009
Springer
15 years 9 months ago
Scrap your boilerplate: prologically!
“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the un...
Ralf Lämmel
GCC
2007
Springer
15 years 5 months ago
Component Based Legacy Program Executing over Grid
Executing the legacy program over grid is very important and necessary. To reuse the legacy program, we developed a method based on Component for executing the legacy code. We can...
Le Du, Yongwei Wu, Chunlu Wang
EOR
2006
65views more  EOR 2006»
15 years 3 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini