Sciweavers

394 search results - page 42 / 79
» Formal polytypic programs and proofs
Sort
View
POPL
2003
ACM
14 years 8 months ago
Toward a foundational typed assembly language
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
Karl Crary
PLSA
1994
14 years 3 days ago
Language and Architecture Paradigms as Object Classes
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
Diomidis Spinellis, Sophia Drossopoulou, Susan Eis...
ESOP
2005
Springer
14 years 1 months ago
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of imp...
Steve Kremer, Mark Ryan
TPHOL
2007
IEEE
14 years 2 months ago
Separation Logic for Small-Step cminor
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
Andrew W. Appel, Sandrine Blazy
POPL
2005
ACM
14 years 8 months ago
Environmental acquisition revisited
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...
Richard Cobbe, Matthias Felleisen