Sciweavers

2514 search results - page 286 / 503
» The use of industrial-strength formal methods
Sort
View
FOSSACS
2001
Springer
15 years 11 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
NGITS
1999
Springer
15 years 10 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
CAV
2004
Springer
96views Hardware» more  CAV 2004»
15 years 12 months ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan
SAS
2009
Springer
149views Formal Methods» more  SAS 2009»
16 years 1 months ago
Creating Transformations for Matrix Obfuscation
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
Stephen Drape, Irina Voiculescu
CVPR
2003
IEEE
16 years 8 months ago
A Bayesian Framework for Fusing Multiple Word Knowledge Models in Videotext Recognition
Videotext recognition is challenging due to low resolution, diverse fonts/styles, and cluttered background. Past methods enhanced recognition by using multiple frame averaging, im...
DongQing Zhang, Shih-Fu Chang