838 search results - page 61 / 168 » From Natural Language to Formal Proof Goal |
165
click to vote
UML
2004
Springer
15 years 11 months ago
2004
Springer
Several different kinds of performance models can be generated from sets of scenarios that describe typical responses of a system, and their use of resources. The Core Scenario Mod...
286
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
145
click to vote
FM
2009
Springer
16 years 21 days ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
171
click to vote
IFL
2007
Springer
16 years 8 days ago
2007
Springer
In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our...
222
click to vote
LISP
2000
15 years 5 months ago
2000
This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967. The lectures were originally ...