552 search results - page 2 / 111 » Languages Modulo Normalization |
POPL
2010
ACM
14 years 2 months ago
2010
ACM
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
JCSS
2010
13 years 3 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
PLDI
1993
ACM
13 years 9 months ago
1993
ACM
This paper shows how to software pipeline a loop for minimal register pressure withoutsacrificing the loop’s minimum execution time. This novel bidirectional slack-scheduling m...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...