Sciweavers

8695 search results - page 1678 / 1739
» Making the Complex Simple
Sort
View
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
ICSE
2000
IEEE-ACM
15 years 1 months ago
Galileo: a tool built from mass-market applications
We present Galileo, an innovative engineering modeling and analysis tool built using an approach we call packageoriented programming (POP). Galileo represents an ongoing evaluatio...
David Coppit, Kevin J. Sullivan
ICSE
2000
IEEE-ACM
15 years 1 months ago
Testing levels for object-oriented software
One of the characteristicsof object-oriented software is the complex dependency that may exist between classes due to inheritance, association and aggregation relationships. Hence...
Yvan Labiche, Pascale Thévenod-Fosse, H&eac...
ITS
2000
Springer
159views Multimedia» more  ITS 2000»
15 years 1 months ago
Can We Learn from ITSs?
With the rise of VR, the internet, and mobile technologies and the shifts in educational focus from teaching to learning and from solitary to collaborative work, it's easy (bu...
Benedict du Boulay
ALT
1995
Springer
15 years 1 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
« Prev « First page 1678 / 1739 Last » Next »