Sciweavers

10055 search results - page 212 / 2011
» Structured programming using processes
Sort
View
FASE
2010
Springer
15 years 7 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller
ESOP
2008
Springer
15 years 2 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
100
Voted
ICFP
1998
ACM
15 years 4 months ago
Recycling Continuations
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be recycled." Once they have served their purpose...
Jonathan Sobel, Daniel P. Friedman
89
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
Data Flow Analysis for CCS
Data Flow Analysis as expressed by Monotone Frameworks is often associated with classical imperative programming languages and has played a crucial role in the efficient implementa...
Hanne Riis Nielson, Flemming Nielson
DATE
2005
IEEE
129views Hardware» more  DATE 2005»
15 years 6 months ago
Hardware Support for Arbitrarily Complex Loop Structures in Embedded Applications
In this paper, the program control unit of an embedded RISC processor is enhanced with a novel zerooverhead loop controller (ZOLC) supporting arbitrary loop structures with multip...
Nikolaos Kavvadias, Spiridon Nikolaidis