7961 search results - page 58 / 1593 » Input-Output Model Programs |
132
Voted
ARTS
1999
Springer
15 years 6 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
138
click to vote
APN
1994
Springer
15 years 6 months ago
1994
Springer
In this paper we describe a modelling project to improve a nuclear waste management program in charge of the creation of a new system for the permanent disposal of nuclear waste. S...
111
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
157
Voted
JAR
2008
15 years 2 months ago
2008
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
115
click to vote
SAGT
2010
Springer
15 years 24 days ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...