777 search results - page 83 / 156 » Model Checking with Formula-Dependent Abstract Models |
100
click to vote
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
According to Parnas's information hiding principle and Baldwin and Clark's design rule theory, the key step to decomposing a system into modules is to determine the desi...
FASE
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents the use of a method – and its corresponding tool set – for compositional verification of applet interactions on a realistic industrial smart card...
ICFEM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
106
click to vote
FDL
2006
IEEE
15 years 3 months ago
2006
IEEE
Reusing IP-cores to construct system models facilitated by automated generation of glue-logic, and automated composability checks can help designers to create efficient simulation...
GG
2004
Springer
15 years 3 months ago
2004
Springer
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these g...