2000 search results - page 141 / 400 » Program Transformation and Proof Transformation |
173
Voted
COCO
1997
Springer
15 years 7 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
154
Voted
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
108
Voted
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
166
Voted
ICLP
2011
Springer
14 years 7 months ago
2011
Springer
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
138
Voted
ICSE
2009
IEEE-ACM
16 years 4 months ago
2009
IEEE-ACM
Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 package java.util.concurrent (j.u.c.) supports writing concurrent programs: much of...