Sciweavers

73 search results - page 8 / 15
» Testing Concurrent Systems: An Interpretation of Intuitionis...
Sort
View
TCS
2008
14 years 9 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
15 years 2 months ago
Convergence Testing in Term-Level Bounded Model Checking
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Se...
ENTCS
1998
115views more  ENTCS 1998»
14 years 9 months ago
A Testing Equivalence for Reactive Probabilistic Processes
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...
Marta Z. Kwiatkowska, Gethin Norman
VVEIS
2007
14 years 10 months ago
UML-driven Information Systems and their Formal Integration Validation and Distribution
Being the de-facto standard (object-oriented-OO) method(-logy) for software-intensive systems development, UML with its different diagrams and supporting tools represent nowadays t...
Nasreddine Aoumeur, Gunter Saake
ENTCS
2008
102views more  ENTCS 2008»
14 years 9 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda