4419 search results - page 161 / 884 » Information Science in Transition |
162
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
144
click to vote
FM
2009
Springer
16 years 20 days ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
159
click to vote
LICS
2008
IEEE
16 years 14 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
149
click to vote
LICS
2007
IEEE
16 years 11 days ago
2007
IEEE
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
163
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...