632 search results - page 99 / 127 » Proving Invariants of Functional Programs |
118
Voted
ICFP
2008
ACM
16 years 13 days ago
2008
ACM
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
91
Voted
CHARME
2001
Springer
15 years 5 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
127
Voted
TIC
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. A type-based certifying compiler maps source code to machine code and target-level type annotations. The target-level annotations make it possible to prove easily that th...
112
Voted
ENTCS
2008
15 years 16 days ago
2008
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
98
Voted
DAC
2007
ACM
16 years 1 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...