6274 search results - page 285 / 1255 » Proofs, Programs, Processes |
160
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
188
click to vote
FMICS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Safe is a first-order functional language with unusual memory management features: memory can be both explicitly and implicitly deallocated at some specific points in the...
161
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
We describe a gate level design of a FlexRay-like bus interface. An electronic control unit (ECU) is obtained by integrating this interface into the design of the verified VAMP pro...
169
click to vote
APLAS
2001
ACM
15 years 10 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
173
click to vote
ITICSE
2010
ACM
15 years 8 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...