Sciweavers

2777 search results - page 222 / 556
» Example centric programming
Sort
View
NFM
2011
252views Formal Methods» more  NFM 2011»
14 years 11 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
IFIP
2010
Springer
14 years 10 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz
SCP
2010
174views more  SCP 2010»
14 years 10 months ago
Aspects of availability: Enforcing timed properties to prevent denial of service
We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the ...
Pascal Fradet, Stéphane Hong Tuan Ha
PPOPP
2012
ACM
13 years 11 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
139
Voted
ESAW
2009
Springer
15 years 10 months ago
Normative Multi-Agent Organizations
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by organization artifacts. This abstract presents a programming language, which is d...
Mehdi Dastani