Sciweavers

958 search results - page 161 / 192
» Model Transformation Languages and Their Implementation by B...
Sort
View
PRDC
2009
IEEE
15 years 8 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...
SCP
2010
155views more  SCP 2010»
14 years 11 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
POPL
2005
ACM
16 years 1 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
AUSFORENSICS
2004
15 years 2 months ago
Generalising Event Forensics Across Multiple Domains
In cases involving computer related crime, event oriented evidence such as computer event logs, and telephone call records are coming under increased scrutiny. The amount of techn...
Bradley Schatz, George M. Mohay, Andrew Clark
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
15 years 7 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur