1941 search results - page 222 / 389 » Reasoning about Computations Using Two-Levels of Logic |
163
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
139
click to vote
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
130
click to vote
EXACT
2008
15 years 6 months ago
2008
The representation and manipulation of natural human understanding of temporal phenomena is a fundamental field of study in Computer Science, which aims both to emulate human think...
152
click to vote
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
151
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...