1941 search results - page 248 / 389 » Reasoning about Computations Using Two-Levels of Logic |
139
click to vote
ACL2
2006
ACM
15 years 9 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
247
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
122
click to vote
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
GROUP
2005
ACM
15 years 9 months ago
2005
ACM
We describe results from a survey of employees at Microsoft about how they manage personal and household scheduling. We saw a much greater use of digital calendars than we expecte...
117
click to vote
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using t...