Sciweavers

462 search results - page 51 / 93
» Symbolic Bounded Synthesis
Sort
View
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...
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 2 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
MHCI
2009
Springer
15 years 8 months ago
Phototropic memories
This paper illustrates the thesis research and process that led me to conceive, design and evaluate the Phototropic Memories device, a novel interface supporting the intimate shar...
Claudio L. Midolo
ACL
1992
15 years 3 months ago
A Connectionist Parser for Structure Unification Grammar
This paper presents a connectionist syntactic parser which uses Structure Unification Grammar as its grammatical framework. The parser is implemented in a connectionist architectu...
James Henderson
SLOGICA
2008
99views more  SLOGICA 2008»
15 years 11 days ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak