799 search results - page 128 / 160 » A Logic for Abstract State Machines |
120
click to vote
ICFP
2000
ACM
15 years 6 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
150
click to vote
ICFEM
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. Today’s software systems are becoming increasingly configurable and designed for deployment on a plethora of architectures, ranging from sequential machines via multic...
125
click to vote
IJFCS
2006
15 years 1 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
123
click to vote
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
114
click to vote
FUIN
2006
15 years 1 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...