756 search results - page 63 / 152 » Can Abstract State Machines Be Useful in Language Theory |
177
click to vote
DAGSTUHL
1998
15 years 7 months ago
1998
Abstract. During the last years, a number of formal specification languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a comple...
174
click to vote
MEMOCODE
2008
IEEE
16 years 16 days ago
2008
IEEE
Concurrent programming languages are becoming mandatory with the advent of multi-core processors. Two major concerns in any concurrent program are data races and deadlocks. Each a...
144
click to vote
PTS
2007
15 years 7 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
137
click to vote
VSTTE
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many well-established concepts of object-oriented programming work for individual objects, but do not support object structures. The development of a verifying compiler r...
161
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...