Sciweavers

63 search results - page 7 / 13
» On the complexity of practical ATL model checking
Sort
View
97
Voted
IPPS
2010
IEEE
14 years 6 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
COMPSAC
2009
IEEE
15 years 4 months ago
System Safety Requirements as Control Structures
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...
Zhe Chen, Gilles Motet
MODELS
2009
Springer
15 years 4 months ago
Evaluating Context Descriptions and Property Definition Patterns for Software Formal Validation
A well known challenge in the formal methods domain is to improve their integration with practical engineering methods. In the context of embedded systems, model checking requires ...
Philippe Dhaussy, Pierre Yves Pillain, Stephen Cre...
FMICS
2006
Springer
15 years 1 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 29 days ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin