575 search results - page 24 / 115 » Wichita State University |
STOC
1998
ACM
14 years 1 days ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
ng Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation Yan Chen Dept. of Computer Science Portland State University Portland, OR, 97207 chenyan@cs.pdx.e...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Dynamic technology-driven circumstances fortify academic librarians’ reconsideration of their professional purposes, processes and relationships. In response, California Polytec...