Sciweavers

233 search results - page 23 / 47
» Specifying, Programming and Verifying with Equational Logic
Sort
View
POPL
2011
ACM
14 years 3 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
15 years 9 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
214
Voted
POPL
2006
ACM
16 years 29 days ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
AOSE
2005
Springer
15 years 6 months ago
Formalisation and Analysis of the Temporal Dynamics of Conditioning
In order to create adaptive Agent Systems with abilities matching those of their biological counterparts, a natural approach is to incorporate classical conditioning mechanisms int...
Tibor Bosse, Catholijn M. Jonker, Sander A. Los, L...
178
Voted
POPL
2005
ACM
16 years 29 days ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...