Sciweavers

378 search results - page 45 / 76
» Automating Mathematical Program Transformations
Sort
View
IHIS
2005
ACM
15 years 4 months ago
Verifying web services composition based on hierarchical colored petri nets
Current Web services composition proposals, such as BPML, BPEL, WSCI, and OWL-S, provide notations for describing the control and data flows in Web service collaborations. However...
Yanping Yang, QingPing Tan, Yong Xiao
POPL
2010
ACM
15 years 8 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
ICLP
2005
Springer
15 years 4 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
SPE
2002
130views more  SPE 2002»
14 years 10 months ago
Unix tools as visual programming components in a GUI-builder environment
Development environments based on ActiveX controls and JavaBeans are marketed as "visual programming" platforms; in practice their visual dimension is limited to the des...
Diomidis Spinellis
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
15 years 5 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller