Sciweavers

681 search results - page 90 / 137
» A Logic for True Concurrency
Sort
View
WSPI
2008
15 years 1 months ago
Semantics of Information as Interactive Computation
Computers today are not only the calculation tools - they are directly (inter)acting in the physical world which itself may be conceived of as the universal computer (Zuse, Fredkin...
Gordana Dodig-Crnkovic
CONCUR
2011
Springer
13 years 11 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
JAIR
2008
102views more  JAIR 2008»
14 years 12 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang
ICFP
2008
ACM
15 years 12 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
CAV
2007
Springer
113views Hardware» more  CAV 2007»
15 years 6 months ago
Three-Valued Abstraction for Continuous-Time Markov Chains
lued Abstraction for Continuous-Time Markov Chains⋆ Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 RWTH Aachen University1 , TU Munich2 , University of...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...