Sciweavers

1750 search results - page 322 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 3 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
ICSE
1998
IEEE-ACM
15 years 1 months ago
What You See Is What You Test: A Methodology for Testing Form-Based Visual Programs
Form-based visual programming languages, which include commercial spreadsheets and various research systems, have had a substantial impact on end-user computing. Research shows, h...
Gregg Rothermel, Lixin Li, Christopher DuPuis, Mar...
AAMAS
2008
Springer
14 years 9 months ago
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
SIGCOMM
2012
ACM
13 years 5 days ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...
PLDI
2012
ACM
13 years 5 days ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa