169 search results - page 17 / 34 » A Logic for Formal Verification of Quantum Programs |
POPL
2010
ACM
14 years 6 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
SIGSOFT
2005
ACM
14 years 9 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
AAAI
2000
13 years 10 months ago
2000
Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we inve...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...