Sciweavers

4447 search results - page 880 / 890
» Model Checking Games
Sort
View
137
Voted
APLAS
2006
ACM
15 years 7 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt
CAV
2003
Springer
188views Hardware» more  CAV 2003»
15 years 7 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
155
Voted
ISTCS
1992
Springer
15 years 7 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
178
Voted
ECOOP
2010
Springer
15 years 6 months ago
Contract-Based Data Structure Repair Using Alloy
Contracts and specifications have long been used in object-oriented design, programming and testing to enhance reliability before software deployment. However, the use of specifica...
Razieh Nokhbeh Zaeem, Sarfraz Khurshid
159
Voted
POPL
2010
ACM
15 years 5 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...