Sciweavers

88 search results - page 1 / 18
» Proving the Correctness of the STG Machine
Sort
View
IFL
2001
Springer
13 years 9 months ago
Proving the Correctness of the STG Machine
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
Alberto de la Encina, Ricardo Pena
ACSD
2006
IEEE
118views Hardware» more  ACSD 2006»
13 years 11 months ago
Strategies for Optimised STG Decomposition
— When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into small...
Mark Schäfer, Walter Vogler, Ralf Wollowski, ...
LICS
1999
IEEE
13 years 9 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
TOCL
2008
113views more  TOCL 2008»
13 years 5 months ago
Abstract state machines capture parallel algorithms: Correction and extension
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
Andreas Blass, Yuri Gurevich
MFCS
1998
Springer
13 years 9 months ago
Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation
Abstract. We provide concise abstract code for running the Java Virtual Machine (JVM) to execute compiled Java programs, and define a general compilation scheme of Java programs to...
Egon Börger, Wolfram Schulte