Sciweavers

148 search results - page 2 / 30
» Reasoning about Repairability of Workflows at Design Time
Sort
View
CAD
2006
Springer
13 years 4 months ago
Repairing CAD model errors based on the design history
For users of CAD data, few things are as frustrating as receiving unusable, poor quality data. Users often waste time fixing or rebuilding such data from scratch on the basis of p...
Jeongsam Yang, Soonhung Han
ICSE
2009
IEEE-ACM
14 years 5 months ago
Reasoning about edits to feature models
Features express the variabilities and commonalities among programs in a software product line (SPL). A feature model defines the valid combinations of features, where each combin...
Christian Kästner, Don S. Batory, Thomas Th&u...
CSFW
2003
IEEE
13 years 10 months ago
Using First-Order Logic to Reason about Policies
A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason...
Joseph Y. Halpern, Vicky Weissman
CONCUR
2010
Springer
13 years 6 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 5 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick