756 search results - page 64 / 152 » Can Abstract State Machines Be Useful in Language Theory |
SPIN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
VSTTE
2005
Springer
14 years 1 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
ML
2007
ACM
13 years 7 months ago
2007
ACM
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, inc...
KAIS
2006
13 years 8 months ago
2006
Abstract. Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the...