Sciweavers

86 search results - page 16 / 18
» A Classical Realizability Model for a Semantical Value Restr...
Sort
View
JOLLI
2008
95views more  JOLLI 2008»
14 years 9 months ago
Relational Modality
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
Kathrin Glüer, Peter Pagin
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 8 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
PLDI
2011
ACM
14 years 12 days ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
SOFTVIS
2003
ACM
15 years 2 months ago
Nice Class Diagrams Admit Good Design?
Analysis and design of programs by using tools has emerged to a standard technique in object-oriented software engineering. Many of these tools claim to implement methods accordin...
Holger Eichelberger
PEWASUN
2007
ACM
14 years 11 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi