Sciweavers

147 search results - page 20 / 30
» Relational Parametricity and Separation Logic
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 8 days ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
ICSE
2007
IEEE-ACM
15 years 11 months ago
Modeling Product Line Architectures through Change Sets and Relationships
The essence of any modeling approach for product line architectures lies in its ability to express variability. Existing approaches do so by explicitly specifying variation points...
André van der Hoek, Scott A. Hendrickson
96
Voted
MEDINFO
2007
112views Healthcare» more  MEDINFO 2007»
15 years 1 months ago
SNOMED CT's Problem List: Ontologists' and Logicians' Therapy Suggestions
After a critical review of the present architecture of SNOMED CT, addressing both logical and ontological issues, we present a roadmap towards an overall improvement of this termi...
Stefan Schulz, Boontawee Suntisrivaraporn, Franz B...
85
Voted
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 5 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
PTS
2008
109views Hardware» more  PTS 2008»
15 years 1 months ago
Runtime Verification of C Programs
We present in this paper a framework, RMOR, for monitoring the execution of C programs against state machines, expressed in a textual (nongraphical) format in files separate from t...
Klaus Havelund