Sciweavers

286 search results - page 41 / 58
» Reasoning About Partial Functions in the Formal Development ...
Sort
View
SAS
1995
Springer
127views Formal Methods» more  SAS 1995»
13 years 12 months ago
Complementation in Abstract Interpretation
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Agostino Cortesi, Gilberto Filé, Roberto Gi...
ICSE
2003
IEEE-ACM
14 years 8 months ago
End-User Software Engineering with Assertions in the Spreadsheet Paradigm
There has been little research on end-user program development beyond the activity of programming. Devising ways to address additional activities related to end-user program devel...
Margaret M. Burnett, Curtis R. Cook, Omkar Pendse,...
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
14 years 1 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
AAAI
2006
13 years 9 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
PARLE
1987
13 years 12 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch