Sciweavers

1686 search results - page 138 / 338
» Programs as polygraphs: computability and complexity
Sort
View
SAC
2009
ACM
15 years 10 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
696
Voted

Book
1575views
16 years 11 months ago
Bison - The Yacc-compatible Parser Generator
"Bison is a general-purpose parser generator that converts an annotated context-free grammar into an LALR(1) or GLR parser for that grammar. Once you are proficient with Biso...
Charles Donnelly and Richard Stallman
124
Voted
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
15 years 10 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...
237
Voted
ESOP
2004
Springer
15 years 9 months ago
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
Cédric Lhoussaine, Vladimiro Sassone
123
Voted
ECOOP
1998
Springer
15 years 7 months ago
Reflection for Statically Typed Languages
Abstract. An object-oriented language that permits changing the behavior of a class or of a single object is said to support computational reflection. Existing reflective facilitie...
José de Oliveira Guimarães