Sciweavers

157 search results - page 30 / 32
» Debugging formal specifications using simple counterstrategi...
Sort
View
127
Voted
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 5 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
ER
2007
Springer
111views Database» more  ER 2007»
15 years 8 months ago
Provability-Based Semantic Interoperability Via Translation Graphs
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...
Joshua Taylor, Andrew Shilliday, Selmer Bringsjord
POPL
2009
ACM
16 years 2 months ago
A calculus of atomic actions
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 5 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
FLAIRS
2008
15 years 4 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon