4854 search results - page 196 / 971 » It's the Programming, Stupid |
226
click to vote
ENTCS
2006
15 years 7 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
206
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
179
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
269
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
197
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...