1686 search results - page 147 / 338 » Programs as polygraphs: computability and complexity |
144
Voted
NJC
2000
15 years 3 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
174
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
130
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...
141
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
132
Voted
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...