Sciweavers

4940 search results - page 161 / 988
» On the Complexity of Universal Programs
Sort
View
187
Voted
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
15 years 9 months ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...
AAAI
2008
15 years 7 months ago
Hyperequivalence of Logic Programs with Respect to Supported Models
Recent research in nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the st...
Miroslaw Truszczynski, Stefan Woltran
WWW
2006
ACM
16 years 5 months ago
One document to bind them: combining XML, web services, and the semantic web
We present a paradigm for uniting the diverse strands of XML-based Web technologies by allowing them to be incorporated within a single document. This overcomes the distinction be...
Harry Halpin, Henry S. Thompson
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 10 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
171
Voted
ICFP
2012
ACM
13 years 7 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride