357 search results - page 31 / 72 » Monaco: A DSL Approach for Programming Automation Systems |
FORTE
2004
14 years 11 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Partitioning an application among software running on a microprocessor and hardware co-processors in on-chip configurable logic has been shown to improve performance and energy co...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
An ever increasing number of dynamic interactive applications are implemented on portable consumer electronics. Designers depend largely on operating systems to map these applicat...
113
click to vote
ALP
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...