911 search results - page 4 / 183 » Combining programs and state machines |
POPL
2008
ACM
14 years 6 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
CEFP
2005
Springer
13 years 12 months ago
2005
Springer
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
ERSHOV
2009
Springer
14 years 26 days ago
2009
Springer
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
VLSID
1997
IEEE
13 years 10 months ago
1997
IEEE
—Logical initializability is the property of a gate-level circuit whereby it can be driven to a unique start state when simulated by a three-valued (0, 1, ) simulator. In practic...
TACAS
2005
Springer
13 years 11 months ago
2005
Springer
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...