Sciweavers

357 search results - page 10 / 72
» Monaco: A DSL Approach for Programming Automation Systems
Sort
View
80
Voted
ICSE
2000
IEEE-ACM
15 years 1 months ago
Automated refactoring to introduce design patterns
Software systems have to be flexible in order to cope with evolving requirements. However, since it is impossible to predict with certainty what future requirements will emerge, i...
Mel Ó Cinnéide
ASPDAC
2012
ACM
253views Hardware» more  ASPDAC 2012»
13 years 5 months ago
An integrated and automated memory optimization flow for FPGA behavioral synthesis
Behavioral synthesis tools have made significant progress in compiling high-level programs into register-transfer level (RTL) specifications. But manually rewriting code is still ...
Yuxin Wang, Peng Zhang, Xu Cheng, Jason Cong
LOPSTR
2004
Springer
15 years 3 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
ICLP
2011
Springer
14 years 1 months ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi
CL
2000
Springer
15 years 2 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill