Sciweavers

1073 search results - page 121 / 215
» Formal Program Development with Approximations
Sort
View
POPL
2000
ACM
14 years 1 months ago
Type Systems for Distributed Data Structures
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
Ben Liblit, Alexander Aiken
VL
1999
IEEE
136views Visual Languages» more  VL 1999»
14 years 1 months ago
Scaling up a "What You See Is What You Test" Methodology to Spreadsheet Grids
Although there has been considerable research into ways to design visual programming environments to improve the processes of creating new programs and of understanding existing o...
Margaret M. Burnett, Andrei Sheretov, Gregg Rother...
APLAS
2009
ACM
14 years 3 months ago
Asymptotic Resource Usage Bounds
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
Elvira Albert, Diego Alonso, Puri Arenas, Samir Ge...
ICFP
2010
ACM
13 years 10 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
POPL
2004
ACM
14 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford