Sciweavers

233 search results - page 39 / 47
» Specifying, Programming and Verifying with Equational Logic
Sort
View
POPL
2007
ACM
14 years 7 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
PLDI
2010
ACM
14 years 4 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
PODC
2003
ACM
14 years 20 days ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler
ATAL
2006
Springer
13 years 11 months ago
Run-time model checking of interaction and deontic models for multi-agent systems
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
Nardine Osman, David Robertson, Christopher Walton
PPOPP
2011
ACM
12 years 10 months ago
Cooperative reasoning for preemptive execution
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan